Divide-and-conquer multiple alignment with segment-based constraints

Bioinformatics

Volumn 19, Issue SUPPL. 2, 2003, Pages

  Sammeth, Michael ^a   Morgenstern, Burkhard ^b   Stoye, Jens ^a  

^a BIELEFELD UNIVERSITY   (Germany)

^b UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; BASE PAIRING; CONFERENCE PAPER; METHODOLOGY; MOLECULAR GENETICS; NUCLEOTIDE SEQUENCE; PRIORITY JOURNAL; QUALITY CONTROL; SEQUENCE ALIGNMENT;

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

References (22)

1. Abdeddaïm, S. (1997) Incremental computation of transitive closure and greedy alignment. Proceedings of 8th Annual Symposium on Combinatorial Pattern Matching (CPM 1997), volume 1264 of LNCS, pp. 167-179.
2. Abdeddaïm, S. and Morgenstern, B. (2001) Speeding up the DI-ALIGN multiple alignment program by using the 'greedy alignment of biological sequences library' (GABIOS-LIB). Proceedings Journëes Ouvertes: Biologie, Informatique, Mathématiques (JOBlM 2000), volume 2066 of LNCS, pp. 1-11.
3. Carrillo, H. and Lipman, D. (1988) The multiple sequence alignment problem in biology. SIAM J. Applied Math., 48, 1073-1082.
4. Depiereux, L., Baudoux, G., Briffeuil, P., Reginster, I., Boll, X.D., Vinals, C. and Feytmans, E. (1997) Match-Box server: a multiple sequence alignment tool placing emphasis on reliability. CABIOS, 13, 249-256.
5. Feng, D.F. and Doolittle, R.F. (1987) Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol., 25, 351-360.
6. Gupta, S., Kececioglu, J. and Schäffer, A. (1995) Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. J. Comp. Biol., 2, 459-472.
7. Higgins, D. and Sharp, P. (1988) CLUSTAL-a package for performing multiple sequence alignment on a microcomputer. Gene, 73, 237-244.
8. Kececioglu, J. (1993) The maximum weight trace problem in multiple sequence alignment. Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching (CPM 1993), volume 684 of LNCS, pp. 106-119.
9. Lassmann, T. and Sonnhammer, E. (2002) Quality assessment of multiple alignment programs. FEBS Lett., 529, 126-130.
10. Morgenstern, B. (1999) DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics, 15, 211-218.
11. Morgenstern, B., Dress, A. and Werner, T. (1996) Multiple DNA and protein sequence alignment based on segment-to-segment comparison. Proc. Natl Acad. Sci. USA, 93, 12098-12103.
12. Myers, G., Selznick, S., Zhang, Z. and Miller, W. (1996) Progressive multiple alignment with constraints. J. Comp. Biol., 3, 563-572.
13. Notredame, C. (2002) Recent progress in multiple sequence alignment: a survey. Pharmacogenomics, 3, 131-144.
14. Notredame, C., Higgins, D. and Heringa, J. (2000) T-COFFEE: a novel method for fast and accurate multiple sequence alignment. J. Mol. Biol., 302, 205-217.
15. Schuler, G.D., Altschul, S.F. and Lipman, D.J. (1991) A workbench for multiple alignment construction and analysis. Proteins: Struct. Funct. Genet., 9, 180-190.
16. Stoye, J. (1998) Multiple sequence alignment with the divide-and-conquer method. Gene, 211, GC45-GC56.
17. Taylor, W.R. (1988) A flexible method to align large numbers of biological sequences. J. Mol. Evol., 28, 161-169.
18. Thompson, J., Higgins, D. and Gibson, T. (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.
19. Thompson, J., Plewniak, F. and Poch, O. (1999) BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics, 15, 87-88.
20. Thompson, J., Plewniak, F. and Poch, O. (1999) A comprehensive comparison of multiple sequence alignment programs. Nucleic Acids Res., 27, 2682-2690.
21. Tönges, U., Perrey, S., Stoye, J. and Dress, A. (1996) A general method for fast multiple sequence alignment. Gene, 172, GC33-GC41.
22. Vingron, M. and Argos, P. (1991) Motif recognition and alignment for many sequences by comparison of dot-matrices. J. Mol., Biol., 218, 33-43.