Optimal sum-of-pairs multiple sequence alignment using incremental Carrillo and Lipman bounds

Journal of Computational Biology

Volumn 13, Issue 3, 2006, Pages 668-685

  Konagurthu, Arun S ^a,b   Stuckey, Peter J ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b MONASH UNIVERSITY   (Australia)

Author keywords

Dynamic programming; Multiple sequence alignment; Sum of pairs alignment

Indexed keywords

ALGORITHM; ARTICLE; CARRILLO AND LIPMAN METHOD; MATHEMATICAL ANALYSIS; MOLECULAR BIOLOGY; MULTIPLE SEQUENCE ALIGNMENT; PRIORITY JOURNAL; REACTION OPTIMIZATION; SEQUENCE ALIGNMENT; SUM OF PAIRS MULTIPLE ALIGNMENT METHOD;

ALGORITHMS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, PROTEIN;

EID: 33744481015     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.13.668     Document Type: Article

References (27)

1. Althaus, E., Caprara, A., Lenhof, H.-P., and Reinert, K. 2002. Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatories. Bioinformatics 18(Suppl. S). S4-S16.
2. Altschul, S.F. 1989. Gap costs for multiple sequence alignment. J. Theor. Biol. 138, 297-309.
3. Altschul, S.F., and Erickson, B.W. 1986. Optimal sequence alignment using affine gap costs. Bull. Math. Biol. 48, 603-616.
4. Altschul, S.F. and Lipman, D.J. 1989. Trees, stars, and multiple biological sequence alignment. SIAM J. Appl. Math. 49, 197-209.
5. Carrillo, H., and Lipman, D. 1988. The multiple sequence alignment problem in biology. SIAM J. Appl. Math. 48(5), 1073-1082.
6. Gupta, S.K., Kececioglu, J.D.m and Schaffer, A. 1995. Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignments. J. Comp. Biol. 2(3), 459-472.
7. Gusfield, D. 1993. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol. 55(1) 141-154.
8. Gusfield, D. 1997. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. chap. 11. Cambridge University Press. London.
9. Henikoff, S., and Henikoff, J.G. 1992. Amino acid substitution matrices from protein blocks. Proc. Natl. Acad. Sci. USA 89(22), 10915-10919.
10. Hughey, R., and Krogh. A. 1996. Hidden Markov models for sequence analysis: Extension and analysis of basic method. Comp. Appl. Biosci. 12, 95-107.
11. Just, W. 2001. Computational complexity of multiple sequence alignment with SP-score. J. Comp. Biol. 8(6), 615-623.
12. Kececioglu, J.D. 1993. The maximum weight trace problem in multiple sequence alignment. Proc. 4th Ann. Symp. on Combinatorial Pattern Matching, 106-119.
13. Lermen, M., and Reinert, K. 2000. The practical use of the A* algorithm for exact multiple sequence alignment. J. Comp. Biol. 7, 655-671.
14. Lipman, D.J., Altschul, S.E. and Kececioghi, J.D. 1989. A tool for multiple sequence alignment. Proc. Natl. Acad. Sci. USA 86, 4412-4415.
15. Mizuguchi, K., Deane, C.M., Blundell, T.L., and Overington, J.P. 1998. HOMSTRAD: A database of protein structure alignments for homologous families. Protein Sci. 7, 2469-2471.
16. Murata, M., Richardson, J., and Sussman, J. 1985. Simultaneous comparison of three protein sequences. Proc. Natl. Acad. Sci. USA 82, 3073-3077.
17. Needleman, S.B., and Wunsch, C.D. 1970. A general method applicable to the search for similarities in amino acid sequence of two proteins, J. Mol. Biol. 48, 443-453.
18. Notredame, C. 2002. Recent progress in multiple sequence alignments: A survey. Pharmacogenomics 3, 1-14.
19. Notredame, C., Higgins, D., and Heriaga, J. 2000. T-Coffee: A novel method for multiple sequence alignments. J. Mol. Biol, 302, 205-217.
20. Reinen, K., Lenhof, H.-P., Mutzel, P., Mehlhorn, K., and Kececioglu, J. 1997. A branch-and eat algorithm for multiple sequence alignment. Proc. 1st Ann. Int. Conf. on Computational Molecular Biology (RECOMB 97), 241-249.
21. Reinert, K., Stoye, J., and Will, T. 2000. An iterative method for faster sum-of-pairs multiple sequence alignment. Bioinformatics 16, 808-814.
22. Sneath, P.H.A., and Sokal, R.R. 1973. Numerical Taxonomy, W. H. Freeman, San Fransisco.
23. Stoye, J. 1998. Multiple sequence alignment with the divide-and-conquer method. Gene 211, GC45-GC56.
24. Stoye, J., Moulton, V., and Dress, A.W. 1997. DCA: An efficient implementation of divide and conquer approach to simultaneous multiple sequence alignment. Comput. Appl. Biosci. 13(6), 625-626.
25. Thompson, J.D., Higgins, D.G., and Gibson, T.J. 1994. CLUSTAL W: Improving the sensitivity of progressive multiple alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucl. Acids Res. 22, 4673-4680.
26. Thompson, J.D., Plewniak, F., and Poch, O. 1999. BALIBASE: A benchmark alignment database for the evaluation of multiple sequence alignment programs. Bioinformatics 15, 87-88.
27. Wang, L., and Jiang, T. 1994. On the complexity of multiple sequence alignment. J. Comp. Biol. 1. 337-348.