A min-cut algorithm for the consistency problem in multiple sequence alignment

Bioinformatics

Volumn 26, Issue 8, 2010, Pages 1015-1021

  Corel, Eduardo ^a   Pitschi, Florian ^b   Morgenstern, Burkhard ^a  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

^b MAX PLANCK INSTITUTE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; DNA SEQUENCE; GENETIC DATABASE; GENOMICS; METHODOLOGY; SEQUENCE ALIGNMENT;

ALGORITHMS; DATABASES, GENETIC; GENOMICS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA;

EID: 77951942339     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btq082     Document Type: Article

References (38)

1. Abdeddaïm,S. and Morgenstern,B. (2001) Speeding up the DIALIGN multiple alignment program by using the 'greedy alignment of biological sequences library' (GABIOS-LIB). Lect. Notes Comput. Sci., 2066, 1-11.
2. Altschul,S.F. et al. (1997) Gapped BLASTand PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res., 25, 3389-3402.
3. Bailey,T.L. and Elkan,C. (1994)Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology. AAAI Press, Atlanta, pp. 28-36.
4. Cormen,T. et al. (2001) Introduction to Algorithms. MIT Press, Cambridge, MA; London, England.
5. Do,C.B. et al. (2005) ProbCons: probabilistic consistency-based multiple sequence alignment. Genome Res., 15, 330-340.
6. Do,C.B. et al. (2006) CONTRAlign: discriminative training for protein sequence alignment. In Proceedings Research in Computational Molecular Biology '06. Vol. of 3909 Lecture Notes in Computer Science. Springer-Verlag.
7. Dress,A. et al. (2008) Stability of multiple alignments and phylogenetic trees: an analysis of ABC-transporter proteins. Algorithms Mol. Biol., 3, 15.
8. Durbin,R. et al. (1998) Biological sequence analysis. Cambridge University Press, Cambridge.
9. Eddy,S. (1995) Fast and sound two-step algorithms for multiple alignment of nucleic sequences. In Proceedings of Intelligent Systems for Molecular Biology '95. AAAI Press, Atlanta, pp. 114-120.
10. Edgar,R. (2004) MUSCLE: multiple sequence alignment with high score accuracy and high throughput. Nucleic Acids Res., 32, 1792-1797.
11. Edgar,R.C. and Batzoglou,S. (2006) Multiple sequence alignment. Curr. Opin. Struct. Biol., 16, 368-373.
12. Edmonds,J. and Karp,R.M. (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM, 19, 248-264.
13. Ford,L. and Fulkerson,D. (1956) Maximal flow through a network. Can. J. Math, 8, 399-404.
14. Gotoh,O. (1990) Consistency of optimal sequence alignments. Bull. Math. Biol., 52, 509-525.
15. Gusfield,D. (1997) Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge.
16. Katoh,K.et al. (2005) MAFFT version 5: improvement in accuracy of multiple sequence alignment. Nucleic Acids Res., 33, 511-518.
17. Kececioglu,J.D. et al. (2000) A polyhedral approach to sequence alignment problems. Discrete Appl. Math., 104, 143-186.
18. Kemena,C. and Notredame,C. (2009) Upcoming challenges for multiple sequence alignment methods in the high-throughput era. Bioinformatics, 25, 2455-2465.
19. Lassmann,T. and Sonnhammer,E.L. (2002) Quality assessment of multiple alignment programs. FEBS Lett., 529, 126-130.
20. Lassmann,T. and Sonnhammer,E.L. (2005) Kalign an accurate and fast multiple sequence alignment algorithm. BMC Bioinformatics, 6, 298.
21. Lenhof,H.-P. et al. (1999) An exact solution for the segment-to-segment multiple sequence alignment problem. Bioinformatics, 15, 203-210.
22. Morgenstern,B. (1999) DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics, 15, 211-218.
23. Morgenstern,B. (2000) A space-efficient algorithm for aligning large genomic sequences. Bioinformatics, 16, 948-949.
24. Morgenstern,B. (2002) A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences. Appl. Math. Lett., 15, 11-16.
25. Morgenstern,B. et al. (1996) Multiple DNA and protein sequence alignment based on segment-to-segment comparison. Proc. Natl Acad. Sci. USA, 93, 12098-12103.
26. Morgenstern,B. et al. (2005) Multiple sequence alignment with user-defined constraints at GOBICS. Bioinformatics, 21, 1271-1273.
27. Morgenstern,B. et al. (2006) Multiple sequence alignment with user-defined anchor points. Algorithms Mol. Biol., 1,6.
28. Morrison,D.A. (2006) Multiple sequence alignment for phylogenetic purposes. Aust. Syst. Bot., 19, 479-539.
29. Needleman,S.B. and Wunsch,C.D. (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
30. Notredame, C., Higgins, D., and Heringa, J. (2000). T-Coffee: a novel algorithm for multiple sequence alignment. J. Mol. Biol., 302, 205-217.
31. Pitschi,F. (2008) Sequence similarity, motif detection and alignments with N-local decoded anchor points. PhD Thesis, Universität Leipzig, Faculty of Mathematics and Computer Science, Germany.
32. Smith,T.F. and Waterman,M.S. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
33. Stoye,J. et al. (1998) Rose: generating sequence families. Bioinformatics, 14, 157-163.
34. Subramanian,A.R. et al. (2005) DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment. BMC Bioinformatics, 6, 66.
35. Subramanian,A.R. et al. (2008) DIALIGN-TX: greedy and progressive approaches for the segment-based multiple sequence alignment. Algorithms Mol. Biol., 3,6.
36. Thompson,J.D. et al. (1994) CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res., 22, 4673-4680.
37. Thompson,J.D. et al. (2005) BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins Struct. Funct. Bioinform., 61, 127-136.
38. Vingron,M. and Argos,P. (1991) Motif recognition and alignment for many sequences by comparison of dot-matrices. J. Mol. Biol., 218, 33-43.