Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics

Bioinformatics

Volumn 18, Issue SUPPL. 2, 2002, Pages

  Althaus, Ernst ^a   Caprara, Alberto ^b   Lenhof, Hans Peter ^c   Reinert, Knut ^d  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c SAARLAND UNIVERSITY   (Germany)

^d CELERA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; CONFERENCE PAPER; COST BENEFIT ANALYSIS; DATA BASE; MATHEMATICAL COMPUTING; MOLECULAR BIOLOGY; PERFORMANCE; PRIORITY JOURNAL; QUALITATIVE ANALYSIS; SEQUENCE ALIGNMENT;

EID: 23044499051     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/18.suppl_2.S4     Document Type: Conference Paper

References (26)

1. Althaus,E., Kohlbacher,O., Lenhof,H.-P. and Müller,P. (2000) A combinatorial approach to protein docking with flexible side-chains. In Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00). ACM Press, pp. 15-24.
2. Altschul,S.F., Gish,W., Miller,W., Myers,E.W. and Lipman,D.J. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410.
3. Caprara,A., Lancia,G. and Ng,S. (1999) A column-generation based branch-and-bound algorithm for sorting by reversals. In Farach-Colton,M., Roberts,F., Vingron,M. and Waterman,M. (eds), Mathematical Support for Molecular Biology, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 47, pp. 213-226.
4. Christof,T., Jünger,M., Kececioglu,J., Mutzel,P. and Reinelt,G. (1997) A branch-and-cut approach to physical mapping with end-probes. In Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB97). pp. 84-93.
5. Dayhoff,M., Schwartz,R. and Orcut,B. (1979) A model of evolutionary change in proteins. In Dayhoff,M. (ed.), Atlas of Protein Sequence and Structure, Vol. 5, National Biomedical Research Foundation, Washington, DC, pp. 345-352.
6. Delcher,A., Kasif,S., Fleischmann,R., Peterson,J.O.W. and Salzberg,S. (1999) Alignment of whole genomes. Nucleic Acids Res., 27, 2369-2376.
7. Eppstein,D. (1990) Sequence comparison with mixed convex and concave costs. J. Algorithms, 85-101.
8. Gotoh,O. (1982) An improved algorithm for matching biological sequences. J. Mol. Biol., 162, 705-708.
9. Gupta,S., Kececioglu,J. and Schaeffer,A. (1995) Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. J. Comput. Biol., 2, 459-472.
10. Gusfield,D. (1997) Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge.
11. Henikoff,S. and Henikoff,J. (1992) Amino acid substitution matrices from protein blocks. Proc. Natl Acad. Sci. USA, 89, 10915-10919.
12. Kececioglu,J.D., Lenhof,H.-P., Mehlhorn,K., Mutzel,P., Reinert,K. and Vingron,M. (2000) A polyhedral approach to sequence alignment problems. Discrete Appl. Math., 104, 143-186.
13. Lancia,G., Carr,R., Walenz,B. and Istrail,S. (2001) 101 optimal pdb structure alignments: a branch-and-cut algorithm for the maximum contact overlap problem. In Proceedings of the 5th Annual International Conference on Computational Molecular Biology (RECOMB-01). ACM Press, pp. 193-202.
14. Larmore,L. and Schieber,B. (1990) Online dynamic programming with applications to the prediction of rna secondary structure. In Proceedings of the First Symposium on Discrete Algorithms. pp. 503-512.
15. Lenhof,H.-P., Morgenstern,B. and Reinert,K. (1999) An exact solution for the segment-to-segment multiple sequence alignment problem. Bioinformatics, 15, 203-210.
16. Lenhof,H.-P., Reinert,K. and Vingron,M. (1998) A polyhedral approach to RNA sequence structure alignment. J. Comput. Biol., 5, 517-530.
17. Lermen,M. and Reinert,K. (2000) The practical use of the A* algorithm for exact multiple sequence alignment. J. Comput. Biol., 7, 655-673.
18. Lipman,D., Altschul,S. and Kececioglu,J. (1989) A tool for multiple sequence alignment. Proc. Natl Acad. Sci. USA, 86, 4412-4415.
19. Needleman,S. and Wunsch,C. (1970) A general method applicable to the search for similarities in the amino-acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
20. Notredame,C., Higgins,D.G. and Heringa,J. (2000) T-coffee: a novel method for fast and accurate multiple sequence alignment. J. Mol. Biol., 302, 205-217.
21. Reinert,K. (1999) A Polyhedral Approach to Sequence Alignment Problems, Ph.D. thesis, Universität des Saarlandes.
22. Reinert,K., Lenhof,H.-P., Mutzel,P., Mehlhorn,K. and Kececioglu,J. (1997) A branch-and-cut algorithm for multiple sequence alignment. In Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB-97). pp. 241-249.
23. Reinert,K., Stoye,J. and Will,T. (2000) An iterative methods for faster sum-of-pairs multiple sequence alignment. Bioinformatics, 16, 808-814.
24. SCIL, (2002) SCIL-Symbolic Constraints for Integer Linear programming. http://www.mpi-sb.mpg.de/SCIL.
25. Smith,T.F. and Waterman,M.S. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
26. Thompson,J.D., Plewniak,F. and Poch,O. (1999) BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics, 15, 87-88.