Abstract
The multiple sequence alignment problem (MSAP) is one of the most difficult problems in computational molecular biology. In this paper, we describe the optimization model and the neighborhood structure on the MSAP, then propose a scheme to solve the MSAP using Simulated Annealing Algorithm. Experiment shows that the scheme is effcient.
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have