Skip Navigation

This Article
Right arrow Full Text (Print PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kim, J.
Right arrow Articles by Chung, M. J.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Kim, J.
Right arrow Articles by Chung, M. J.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

Multiple sequence alignment using simulated annealing

Jin Kim , Sakti Pramanik 1 and Moon Jung Chung

Department of Computer Science, Michigan State University East Lansing. MI 48824-1027, USA

1To whom reprint requests should be sent

Multiple sequence alignment is a useful technique for studying molecular evolution and analyzing structure-sequence relationships. Dynamic programming of multiple sequence alignment has been widely used to find an optimal alignment. However, dynamic programming does not allow for certain types of gap costs, and it limits the number of sequences that can be aligned due to its high computational complexity. The focus of this paper is to use simulated annealing as the basis for developing an efficient multiple sequence alignment algorithm. An algorithm called Multiple Sequence Alignment using Simulated Annealing (MSASA) has been developed. The computational complexity of MSASA is significantly reduced by replacing the high-temperature phase of the annealing process by a fast heuristic algorithm. This heuristic algorithm facilitates in minimizing the solution set of the low-temperature phase of the annealing process. Compared to the dynamic programming approach, MSASA can (i) use natural gap costs which can generate better solution, (ii) align more sequences and (iii) take less computation time.

; accepted on February 18, 1994

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Genome ResHome page
C. B. Do, M. S.P. Mahabhashyam, M. Brudno, and S. Batzoglou
ProbCons: Probabilistic consistency-based multiple sequence alignment
Genome Res., February 1, 2005; 15(2): 330 - 340.
[Abstract] [Full Text] [PDF]

Home page
 Protein Eng Des SelHome page
A. Williams, D.R. Gilbert, and D.R. Westhead
Multiple structural alignment for distantly related all {beta} structures using TOPS pattern discovery and simulated annealing
Protein Eng. Des. Sel., December 1, 2003; 16(12): 913 - 923.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.