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.
This is a preview of subscription content, log in via an institution to check access.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shuang, L., Zhong-xi, M. Solving the multiple sequence alignment problem based on simulated annealing algorithm. Wuhan Univ. J. Nat. Sci. 7, 144 (2002). https://doi.org/10.1007/BF02830302
Issue Date:
DOI: https://doi.org/10.1007/BF02830302