Years and Authors of Summarized Original Work
1993; Gusfield
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 [9]). 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 [7] 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 and reports a multiple alignment with small error bounds. To the best knowledge of the entry authors, this work is the first to...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Bafna V, Lawler EL, Pevzner PA (1997) Approximation algorithms for multiple sequence alignment. Theor Comput Sci 182:233–244
Dalli D, Wilm A, Mainz I, Stegar G (2006) STRAL: progressive alignment of non-coding RNA using base pairing probability vectors in quadratic time. Bioinformatics 22(13):1593–1599
Do C, Brudno M, Batzoglou S (2004) ProbCons: probabilistic consistency-based multiple alignment of amino acid sequences. In: Proceedings of the thirteenth national conference on artificial intelligence, pp 703–708, San Jose. AAAI Press
Edgar R (2004) MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res 32:1792–1797
Elias I (2003) Setting the intractability of multiple alignment. In: Proceedings of the 14th annual international symposium on algorithms and computation (ISAAC 2003), Kyoto, pp 352–363
Francis YL, Chin NLH, Lam TW, Prudence WHW (2005) Efficient constrained multiple sequence alignment with performance guarantee. J Bioinform Comput Biol 3(1):1–18
Gusfield D (1993) Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull Math Biol 55(1):141–154
Notredame C, Higgins D, Heringa J (2000) T-coffee: a novel method for multiple sequence alignments. J Mol Biol 302:205–217
Pevsner J (2003) Bioinformatics and functional genomics. Wiley, New York
Pevzner PA (1992) Multiple alignment, communication cost, and graph matching. SIAM J Appl Math 52:1763–1779
Pevzner PA (2000) Computational molecular biology: an algorithmic approach. MIT, Cambridge
Tang CY, Lu CL, Chang MDT, Tsai YT, Sun YJ, Chao KM, Chang JM, Chiou YH, Wu CM, Chang HT, Chou WI (2002) Constrained multiple sequence alignment tool development and its application to RNase family alignment. In: Proceedings of the first IEEE computer society bioinformatics conference (CSB 2002), Stanford, pp 127–137
Wang L, Jiang T (1994) On the complexity of multiple sequence alignment. J Comput Biol 1:337–48
Ye Y, Cheung D, Wang Y, Yiu SM, Qing Z, Lam TW, Ting HF GLProbs: aligning multiple sequences adaptively. IEEE/ACM Trans Comput Biol Bioinformatics. doi:http://doi.ieeecomputersociety.org/10.1109/TCBB.2014.2316820
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Yiu, S.M., Chin, F.Y.L. (2016). Efficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_123
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_123
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering