Multiobjective artificial fish swarm algorithm for multiple sequence alignment

被引:16
作者
Dabba, Ali [1 ]
Tari, Abdelkamel [1 ]
Zouache, Djaafar [2 ]
机构
[1] Abderrahmane Mira Univ, Fac Sci, Comp Sci Dept, Bejaia, Algeria
[2] Mohamed Elbachir Elibrahimi Univ, Comp Sci Dept, Bordj Bou Arreridj, Algeria
关键词
Multiple sequence alignment; artificial fish swarm algorithm; bioinspired algorithms; bioinformatics; optimization algorithms; evolutionary algorithm; molecular biology; swarm intelligence; HIDDEN MARKOV-MODELS; GENETIC ALGORITHM; PROTEIN; COFFEE;
D O I
10.1080/03155986.2019.1629782
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multiple sequence alignment (MSA) represents a basic task for many bioinformatics applications. MSA allows finding common conserved regions among various sequences of proteins or DNA. However, to find the optimal multiple sequence alignment, it is necessary to design an efficient exploration approach that could explore a huge number of possible multiple sequence alignments. As well as, it is required to use a powerful evaluation method to assess the biological relevance of these multiple sequence alignment. To address these main problems, this article presents a multiobjective artificial fish swarm algorithm (MOAFS) to solve multiple sequence alignment. MOAFS uses the behaviors of artificial fish swarm algorithm such as the cooperation, decentralization and parallelism to ensure a good trade-off between the exploration and the exploitation of the search space of MSA problem. To preserve the quality and consistency of alignment, two fitness functions have been simultaneously used by the MOAFS algorithm: (i) Weighted Sum of Pairs to determine similar regions horizontally and (ii) Similarity function to determine vertically similar regions between the sequences of an alignment. Following the exploration of space search, the Pareto-optimal set is obtained by MOAFS which performs the optimal multiple sequence alignments for both fitness functions. The performance of MOAFS algorithm has been proved by comparing our algorithm with different progressive alignment methods, and other alignment methods based on evolutionary algorithms with singleobjective and many-objective. The experiment results conducted on BAliBASE 2.0 and BAliBASE 3.0 benchmark confirm that the MOAFS algorithm provides a greater accuracy statistical significance in terms of SP or CS scores.
引用
收藏
页码:38 / 59
页数:22
相关论文
共 50 条
[41]   RECOGNITION OF SUPER-SECONDARY STRUCTURE IN PROTEINS [J].
TAYLOR, WR ;
THORNTON, JM .
JOURNAL OF MOLECULAR BIOLOGY, 1984, 173 (04) :487-514
[42]   BAliBASE 3.0: Latest developments of the multiple sequence alignment benchmark [J].
Thompson, JD ;
Koehl, P ;
Ripp, R ;
Poch, O .
PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS, 2005, 61 (01) :127-136
[43]   CLUSTAL-W - IMPROVING THE SENSITIVITY OF PROGRESSIVE MULTIPLE SEQUENCE ALIGNMENT THROUGH SEQUENCE WEIGHTING, POSITION-SPECIFIC GAP PENALTIES AND WEIGHT MATRIX CHOICE [J].
THOMPSON, JD ;
HIGGINS, DG ;
GIBSON, TJ .
NUCLEIC ACIDS RESEARCH, 1994, 22 (22) :4673-4680
[44]  
Wadud MS, 2018, INT C INT SYST DES A, V941, P1065
[45]   M-Coffee: combining multiple sequence alignment methods with T-Coffee [J].
Wallace, IM ;
O'Sullivan, O ;
Higgins, DG ;
Notredame, C .
NUCLEIC ACIDS RESEARCH, 2006, 34 (06) :1692-1699
[46]  
Wang L, 1994, J Comput Biol, V1, P337, DOI 10.1089/cmb.1994.1.337
[47]   SOME BIOLOGICAL SEQUENCE METRICS [J].
WATERMAN, MS ;
SMITH, TF ;
BEYER, WA .
ADVANCES IN MATHEMATICS, 1976, 20 (03) :367-387
[48]   EGSA: a new enhanced gravitational search algorithm to resolve multiple sequence alignment problem [J].
Zemali, Elamine ;
Boukra, Abdelmadjid .
INTERNATIONAL JOURNAL OF INTELLIGENT ENGINEERING INFORMATICS, 2018, 6 (1-2) :204-217
[49]  
Zhou R, 2004, PROC INT C TOOLS ART, P688
[50]   A Novel Approach to Multiple Sequence Alignment Using Multiobjective Evolutionary Algorithm Based on Decomposition [J].
Zhu, Huazheng ;
He, Zhongshi ;
Jia, Yuanyuan .
IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS, 2016, 20 (02) :717-727