Multiple sequence alignment using simulated annealing.
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.
Kim
J
J
Department of Computer Science, Michigan State University, East Lansing 48824-1027.
Pramanik
S
S
Chung
M J
MJ
D000465:Algorithms; D000595:Amino Acid Sequence; D000818:Animals; D003365:Costs and Cost Analysis; D005069:Evaluation Studies as Topic; D006801:Humans; D008969:Molecular Sequence Data; D011506:Proteins / Q000235:genetics; D016415:Sequence Alignment / Q000191:economics / Q000379:methods* / Q000706:statistics & numerical data; D017386:Sequence Homology, Amino Acid; D012984:Software; D013997:Time Factors
D011506:Proteins