Encyclopedia of Algorithms

2008 Edition
| Editors: Ming-Yang Kao

Efficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds

1993; Gusfield
  • Francis Chin
  • S. M. Yiu
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-30162-4_123

Keywords and Synonyms

Multiple string alignment; Multiple global alignment        

Problem Definition

Multiple sequence alignment is an important problem in computational biology. Applications include finding highly conserved subregions in a given set of biological sequences and inferring the evolutionary history of a set of taxa from their associated biological sequences (e. g., see [6]). There are a number of measures proposed for evaluating the goodness of a multiple alignment, but prior to this work, no efficient methods are known for computing the optimal alignment for any of these measures. The work of Gusfield [5] gives two computationally efficient multiple alignment approximation algorithms for two of the measures with approximation ratio of less than 2. For one of the measures, they also derived a randomized algorithm, which is much faster and with high probability, reports a multiple alignment with small error bounds. To the best knowledge of the entry authors, this work is...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Bafna, V., Lawler, E.L., Pevzner, P.A.: Approximation algorithms for multiple sequence alignment. Theor. Comput. Sci. 182, 233–244 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Francis, Y.L., Chin, N.L.H., Lam, T.W., Prudence, W.H.W.: Efficient constrained multiple sequence alignment with performance guarantee. J. Bioinform. Comput. Biol. 3(1), 1–18 (2005)CrossRefGoogle Scholar
  3. 3.
    Dalli, D., Wilm, A., Mainz, I., Stegar, G.: STRAL: progressive alignment of non-coding RNA using base pairing probability vectors in quadratic time. Bioinformatics 22(13), 1593–1599 (2006)CrossRefGoogle Scholar
  4. 4.
    Elias, I.: Setting the intractability of multiple alignment. In: Proc. of the 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003), 2003, pp. 352–363Google Scholar
  5. 5.
    Gusfield, D.: Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol. 55(1), 141–154 (1993)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Pevsner, J.: Bioinformatics and functional genomics. Wiley, New York (2003)Google Scholar
  7. 7.
    Pevzner, P.A.: Multiple alignment, communication cost, and graph matching. SIAM J. Appl. Math. 52, 1763–1779 (1992)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Pevzner, P.A.: Computational molecular biology: an algorithmic approach. MIT Press, Cambridge, MA (2000)zbMATHGoogle Scholar
  9. 9.
    Tang, C.Y., Lu, C.L., Chang, M.D.T., Tsai, Y.T., Sun, Y.J., Chao, K.M., Chang, J.M., Chiou, Y.H., Wu, C.M., Chang, H.T., Chou, W.I.: Constrained multiple sequence alignment tool development and its application to RNase family alignment. In: Proc. of the First IEEE Computer Society Bioinformatics Conference (CSB 2002), 2002, pp. 127–137Google Scholar
  10. 10.
    Tompa, M.: Lecture notes. Department of Computer Science & Engineering, University of Washington. http://www.cs.washington.edu/education/courses/527/00wi/. (2000)
  11. 11.
    Wang, L. Jiang, T.: On the complexity of multiple sequence alignment. J. Comp. Biol. 1, 337–48 (1994)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • Francis Chin
    • 1
  • S. M. Yiu
    • 1
  1. 1.Department of Computer ScienceUniversity of Hong KongHong KongChina