An efficient method for multiple sequence alignment
Affiliations
- PMID: 7584393
Item in Clipboard
An efficient method for multiple sequence alignment
Proc Int Conf Intell Syst Mol Biol.
1994.
Abstract
Multiple sequence alignment has been a useful method in the study of molecular evolution and sequence-structure relationships. This paper presents a new method for multiple sequence alignment based on simulated annealing technique. Dynamic programming has been widely used to find an optimal alignment. However, dynamic programming has several limitations to obtain optimal alignment. It requires long computation time and cannot apply certain types of cost functions. We describe detail mechanisms of simulated annealing for multiple sequence alignment problem. It is shown that simulated annealing can be an effective approach to overcome the limitations of dynamic programming in multiple sequence alignment problem.
Similar articles
-
Multiple sequence alignment using simulated annealing.Comput Appl Biosci. 1994 Jul;10(4):419-26. doi: 10.1093/bioinformatics/10.4.419. Comput Appl Biosci. 1994. PMID: 7804875
-
Protein structure alignment by deterministic annealing.Bioinformatics. 2005 Jan 1;21(1):51-62. doi: 10.1093/bioinformatics/bth467. Epub 2004 Aug 12. Bioinformatics. 2005. PMID: 15308541
-
Multiple sequence alignment by parallel simulated annealing.Comput Appl Biosci. 1993 Jun;9(3):267-73. doi: 10.1093/bioinformatics/9.3.267. Comput Appl Biosci. 1993. PMID: 8324627
-
Multiple sequence alignments.Curr Opin Struct Biol. 2005 Jun;15(3):261-6. doi: 10.1016/j.sbi.2005.04.002. Curr Opin Struct Biol. 2005. PMID: 15963889 Review.
-
Multiple sequence alignment: algorithms and applications.Adv Biophys. 1999;36:159-206. doi: 10.1016/s0065-227x(99)80007-0. Adv Biophys. 1999. PMID: 10463075 Review.