Multiple Sequence Alignment Problem Solution Using Genetic Algorithm
Abstract
multiple Sequence Alignment is an important problem in molecular biology; In general, MSA belongs to a class of hard optimization problems called combinatorial problems. One of the methods that have been developed recently to solve this type of Problems is Genetic Algorithms. In this study we show how Genetic Algorithms can be used to solve the Multiple Sequence Alignment problem. Our results suggest that optimal or near-optimal solutions can be obtained with GA faster than with dynamic programming methods.
Authors
Anuj Kumar, Kamlesh kalaknii, Deepak Tiwari