Nomadic genetic algorithm for multiple sequence alignment (MSANGA)
by S. Siva Sathya, S. Kuppuswami, K. Syam Babu
International Journal of Adaptive and Innovative Systems (IJAIS), Vol. 1, No. 1, 2009

Abstract: Genetic algorithms (GA) are adaptive search procedures that try to produce a globally optimum solution for problems of huge search space. This paper speaks about a variant of the standard genetic algorithm (SGA) called nomadic genetic algorithm (NGA) which is based on the concept of 'birds of the same feather flock together'. This NGA is found to maintain the diversity of individuals in the population by intelligently adapting to its environment as well as results in faster convergence of the solution. The objective of this paper is to prove the merits of NGA over SGA for problems of large search space like the problem of multiple sequence alignment (MSA) in bioinformatics. NGA was applied to MSA (MSANGA) and the convergence of NGA is compared with that of SGA and the results tabulated. Also, the accuracy of the alignment produced using MSANGA is compared with nine other popular tools for the data sets chosen from the standard BaliBASE benchmark alignment suite, illustrating the superiority of NGA over SGA and all other tools to produce quality alignment at a faster rate.

Online publication date: Tue, 16-Dec-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Adaptive and Innovative Systems (IJAIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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