TY - JOUR
T1 - A Hybrid Multiobjective Memetic Metaheuristic for Multiple Sequence Alignment
AU - Rubio-Largo, Álvaro
AU - Vega-Rodríguez, Miguel A.
AU - González-Álvarez, David L.
N1 - Rubio-Largo, Á., Vega-Rodríguez, M. A., & González-Álvarez, D. L. (2016). A Hybrid Multiobjective Memetic Metaheuristic for Multiple Sequence Alignment. IEEE Transactions on Evolutionary Computation, 20(4), 499-514. [7274726]. https://doi.org/10.1109/TEVC.2015.2469546 ---%ABS4%
PY - 2016/8/1
Y1 - 2016/8/1
N2 - Over the last 25 years, the multiple sequence alignment (MSA) problem has attracted the attention of biologists because it is one of the major techniques used in several areas of computational biology, such as homology searches, genomic annotation, protein structure prediction, gene regulation networks, or functional genomics. This problem implicates the alignment of more than two biological sequences, and is considered as a nondeterministic polynomial time optimization problem. In this paper, we find a number of different approaches for dealing with this biological sequence alignment problem. Basically, we distinguish six main groups: 1) exact methods; 2) progressive methods; 3) consistency-based methods; 4) iterative methods; 5) evolutionary algorithms; and 6) structure-based methods. In this paper, we propose the use of evolutionary computation and multiobjective optimization for solving this bioinformatics problem. A multiobjective version of a memetic metaheuristic is presented: hybrid multiobjective metaheuristics for MSA. In order to prove the effectiveness of the new proposal, we use three structure-based benchmarks created by using empirical data as input. The results obtained by our method are compared with well-known methods published in this paper, concluding that the new approach presents remarkable accuracy when dealing with sets of sequences with a low sequence similarity, the most frequent ones in real world.
AB - Over the last 25 years, the multiple sequence alignment (MSA) problem has attracted the attention of biologists because it is one of the major techniques used in several areas of computational biology, such as homology searches, genomic annotation, protein structure prediction, gene regulation networks, or functional genomics. This problem implicates the alignment of more than two biological sequences, and is considered as a nondeterministic polynomial time optimization problem. In this paper, we find a number of different approaches for dealing with this biological sequence alignment problem. Basically, we distinguish six main groups: 1) exact methods; 2) progressive methods; 3) consistency-based methods; 4) iterative methods; 5) evolutionary algorithms; and 6) structure-based methods. In this paper, we propose the use of evolutionary computation and multiobjective optimization for solving this bioinformatics problem. A multiobjective version of a memetic metaheuristic is presented: hybrid multiobjective metaheuristics for MSA. In order to prove the effectiveness of the new proposal, we use three structure-based benchmarks created by using empirical data as input. The results obtained by our method are compared with well-known methods published in this paper, concluding that the new approach presents remarkable accuracy when dealing with sets of sequences with a low sequence similarity, the most frequent ones in real world.
KW - Memetic metaheuristic
KW - multiobjective optimization
KW - multiple sequence alignment (MSA)
UR - http://www.scopus.com/inward/record.url?scp=84982791264&partnerID=8YFLogxK
U2 - 10.1109/TEVC.2015.2469546
DO - 10.1109/TEVC.2015.2469546
M3 - Article
AN - SCOPUS:84982791264
SN - 1089-778X
VL - 20
SP - 499
EP - 514
JO - IEEE Transactions on Evolutionary Computation
JF - IEEE Transactions on Evolutionary Computation
IS - 4
M1 - 7274726
ER -