Faster algorithms for optimal Multiple Sequence Alignment based on pairwise comparisons


Journal Article

Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of (he best known scheme for finding an optimal alignment, based on dynamic programming, increases exponentially with the number of input sequences. Hence, many heuristics were suggested for the problem. We consider the following version of the MSA problem: In a preprocessing stage pairwisc alignments are found for every pair of sequences. The goal is to find an optimal alignment in which matches arc restricted to positions that wore matched at the preprocessing stage. We present several techniques for making the dynamic programming algorithm more efficient, while still finding an optimal solution under these restrictions. Namely, in our formulation the MSA must conform with pairwisc (local) alignments, and in return can he solved more efficiently. We prove that it stiffices to find an optimal alignment of sequence segments, rallier than single letters, thereby reducing the input size and thus improving the running time. © Springer-Verlag Berlin Heidelberg 2005.

Full Text

Duke Authors

Cited Authors

  • Agarwal, PK; Bilu, Y; Kolodny, R

Published Date

  • December 1, 2005

Published In

Volume / Issue

  • 3692 LNBI /

Start / End Page

  • 315 - 327

Electronic International Standard Serial Number (EISSN)

  • 1611-3349

International Standard Serial Number (ISSN)

  • 0302-9743

Digital Object Identifier (DOI)

  • 10.1007/11557067_26

Citation Source

  • Scopus