期刊名称：Journal of Advanced Computer Science & Technology
印刷版ISSN：2227-4332
电子版ISSN：2227-4332
出版年度：2016
卷号：5
期号：2
页码：28-33
DOI：10.14419/jacst.v5i2.6079
出版社：Science Publishing Corporation
摘要：Multiple Sequence Alignment (MSA) is used in genomic analysis, such as the identification of conserved sequence motifs, the estimation of evolutionary divergence between sequences, and the genes’ historical relationships inference. Several researches were conducted to determine the level of similarity of a set of sequences. Due to the problem of the NP-complete class property, a number of researches use genetic algorithms (GA) to find a solution to the multiple sequence alignment. However, the nature of genetic algorithms makes the complexity extremely high due to the redundancy provided by the different operators. The aim of this paper is to study some proposed GA solutions provided for MSA and to compare them using some criteria which we believe any solution should comply with in matters of representativeness, closeness and original sequence invariance.
