Segment-based multiple sequence alignment

Bioinformatics

Volumn 24, Issue 16, 2008, Pages

  Rausch, Tobias ^a   Emde, Anne Katrin ^b   Weese, David ^b   Döring, Andreas ^b   Notredame, Cedric ^c   Reinert, Knut ^b  

^a INTERNATIONAL MAX PLANCK RESEARCH SCHOOL FOR COMPUTATIONAL BIOLOGY AND SCIENTIFIC COMPUTING   (Germany)

^b Institut für Informatik   (Germany)

^c CENTRE FOR GENOMIC REGULATION CRG   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURACY; AMINO ACID SEQUENCE; CLINICAL ASSESSMENT TOOL; CONFERENCE PAPER; DNA SEQUENCE; GENETIC ALGORITHM; GENETIC CONSERVATION; GENOME ANALYSIS; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL PARAMETERS; MOLECULAR LIBRARY; NUCLEOTIDE SEQUENCE; PRIORITY JOURNAL; RELIABILITY; SEQUENCE ALIGNMENT;

EID: 49549106252     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btn281     Document Type: Conference Paper

References (41)

1. Abouelhoda,M.I. and Ohlebusch,E. (2003) Multiple genome alignment: chaining methods revisited. In Proceedings of the 14th Annual Symposium on Combinatorial pattern matching (CPM) 2003. pp. 1-16.
2. Althaus,E. et al. (2002). Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. In Proceedings of the 1st European Conference on Computational Biology (ECCB 2002), pp. 4-16.
3. Althaus,E. et al. (2006). A branch-and-cut algorithm for multiple sequence alignment. Math. Prog., 105, 387-425.
4. Altschul,S.F. et al. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410.
5. Carrillo,H. and Lipman,D. (1988) The multiple sequence alignment problem in biology. SIJAM: SIAM Journal on Applied Mathematics, 48.
6. Cormen,T.H. et al. (2001) Introduction to Algorithms. MIT Press, Cambridge, MA.
7. Delcher,A.L. et al. (1999) Alignment of whole genomes. Nucl. Acids. Res., 27, 2369-2376.
8. Chuong,B. et al. (2004) ProbCons: Probabilistic consistency-based multiple alignment of amino acid sequences. In Dcborah,L. McGuinness and George Ferguson, (eds), AAAI, AAAI Press/The MIT Press, pp. 703-708.
9. Döring,A. et al. (2008). SeqAn - an efficient, generic C++ library for sequence analysis. BMC Bioinformatics, 9,11.
10. Edelsbrunner,H. Dynamic Data Structures for Orthogonal Intersection Queries. Technical Report F59, Technical University of Graz, 1980.
11. Edgar,R.C. (2004) MUSCLE: Multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res., 32, 1792-17917.
12. Feng,D.-F. and Doolittle,R.F. (1987) Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol., 25 351-360.
13. Gotoh,O. An improved algorithm for matching biological sequences. J. Mol. Biol., 162, 705-708.
14. Gotoh,O. (1990) Consistency of optimal sequence alignments. BMB., 52.
15. Halpern,A.L. et al. (2002) Segment match refinment and applications. In Proceedings of the 2nd Workshop on Algorithms Bioinformatics (WABI-02). Springer-Verlag, London, UK, pp. 126-139.
16. Hirschberg,D.S. (1975) A linear space algorithm for computing maximal common subsequences. Commum. ACAY, 18. 341-343.
17. Jacobson,G. and Vo,K.-P. (1992) Heaviest increasing/common subsequence problems. In Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching (CPM). Springer-Verlag, London, UK, pp. 52-66.
18. Katoh,K. et al (2002) MAFFT: A novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res., 30, 3059-3066.
19. Kececioglu,J.D. (1993) The maximum weight trace problem in multiple sequence alignment. In CPM '93: Proceedings of 4th Annual Symposium on Combinatorial Pattern Matching. Springer-Verlag, London, UK, pp. 106-119.
20. Lenhof,H.-P. et al. (1999) An exact solution for the segment-to-segment multiple sequence alignment problem. Bioinformatics, 15, 203-210.
21. Lermen,M. and Reinert,K. (2000) The practical use of the A* algorithm for exact multiple sequence alignment. J. Comp. Biol., 7, 655-671.
22. Lipman,D.J. et al. (1989) A tool for multiple sequence alignment. Proc. Natl Acad. Sci. USA, 86, 4412-4415.
23. Myers,G. and Miller,W. (1995) Chaining multiple-alignment fragments in sub-quadratic fime. In Proceedings of 6th Annual SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimetal Analysis of Discrete Algorithms). Society for Industrial and Applied Mathematics, San Francisco, California, pp. 38-47.
24. 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. Molecular Biol., 48, 443-453.
25. Notredame,C. et al. (2000) T-Coffee: A novel method for fast and accurate multiple sequence alignment. J. Mol. Biol., 302, 205-217.
26. Pei,J. and Grishin,N.V. (2007) MUMMALS: Multiple sequence alignment improved by using hidden Markov models with local structural information. Nucleic Acids Res., 34, 4364-4374.
27. Pei,J. and Grishin,N.V. (2006) PROMALS: Towards accurate multiple sequence alignments of distantly related proteins. Bioinformatics, 23, 802-808.
28. Reinert,K. et al. (2000) An iterative methods for faster sum-of-pairs multiple sequence alignment. Bioinformatics, 16 808-814.
29. Saitou,N. and Nei,M. (1987) The neighbor-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol., 4, 406-425.
30. Sankoff,A. and Kruskal,J. (1983) Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, MA.
31. Schwartz,A.S. and Pachter,L. (2007) Multiple alignment by sequence annealing. Bioinformatics, 23, e24-e29.
32. Sokal,R.R. and Michener,C.D. (1958) A statistical method for evaluating systematic relationships. Univ. Kansas Sci. Bull., 38, 1409-1438.
33. Subramanian,A.R. et al. (2005) DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment. BMC Bioinformatics, 6, 66.
34. Szklarczyk,R. and Heringa,J. (2006) AuberGene-a sensitive genome alignment tool. Bioinformatics, 22, 1431-1436.
35. 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.
36. Thompson,J.D. et al. (2005) BAliBASE 3.0: Latest developments of the multiple sequence alignment benchmark. Proteins, 61, 127-136.
37. Thompson,J.D. et al. (1999) BAliBASE: A benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics, 15, 87-88.
38. Wallace,I.M. et al. (2006) M-Coffee: Combining multiple sequence alignment methods with T-Coffee. Nucleic Acids Res., 34, 1692-1699.
39. Wang,L. and Jiang,T. (1994) On the complexity of multiple sequence alignment. J. Comput. Biol., 1, 337-348.
40. Waterman,M.S. and Eggert.M. (1987) A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons. J. Mol. Biol 197, 723-728
41. Wheeler,T.J. and Kececioglu,J.D. (2007) Multiple alignment by aligning alignments. Bioinformatics, 23, 559-568.