Genetic Algorithm with Improved Mutation Operator for Multiple Sequence Alignment
In this paper, an improved mutation operator in GA is proposed to solve multiple sequence alignment problems. The pair wise alignment method is used to generate a child population using the mutation operator. The performances have been tested on a number of bench mark datasets and the results are compared with some of the existing methods available in literature. The experimental results shows that proposed method achieved better solutions than the others for most of the cases.
KeywordsMultiple sequence alignment Genetic algorithm Pair-wise alignment
- 12.Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
- 13.Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs—Third, Revised and Extended Edition. Springer, Berlin (1996)Google Scholar
- 14.De Jong, K.: Learning with genetic algorithms: an overview. Mach. Learn. 3, 121–138 (1988)Google Scholar
- 15.Anbarasu, L.A., Narayanasamy, P., Sundararajan, V.: Multiple molecular sequence alignment by island parallel genetic algorithm. Curr. Sci. 78, 858–863 (2000)Google Scholar