A novel multi-objective genetic algorithm for multiple sequence alignment Online publication date: Sat, 13-Feb-2016
by Mehmet Kaya; Buket Kaya; Reda Alhajj
International Journal of Data Mining and Bioinformatics (IJDMB), Vol. 14, No. 2, 2016
Abstract: There is no well-accepted theoretical model for multiple sequence alignment. An algorithm is accepted as a good method for multiple sequence alignment if it produces better fitness scores with respect to the benchmark datasets. For this purpose, we propose an efficient method using multi-objective genetic algorithm to discover optimal alignments in multiple sequence data. The main advantage of our approach is that a large number of trade-off alignments can be obtained by a single run with respect to conflicting objectives: alignment length minimisation and similarity and support maximisation. We compare our method with the four well-known multiple sequence alignment methods, MUSCLE, ClustalW, SAGA and MSA-GA. The first two of them are progressive methods, and the other two are based on evolutionary algorithms. Experimental results on the BAliBASE 2.0 database demonstrate that our method found better solutions than the others for most of the cases in terms of accuracy.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining and Bioinformatics (IJDMB):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook