Evaluation measures of multiple sequence alignments

Journal of Computational Biology

Volumn 7, Issue 1-2, 2000, Pages 261-276

  Gonnet, Gaston H ^a   Korostensky, Chantal ^a   Benner, Steve ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Evolution; Multiple sequence alignment; Phylogenetic tree; Scoring function; TSP

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; GENE SEQUENCE; GENETIC PROCEDURES; PHYLOGENY; PRIORITY JOURNAL; PROTEIN FAMILY; PROTEIN STRUCTURE; REVIEW;

ALGORITHMS; AMINO ACID SEQUENCE; BIOMETRY; COMPUTER SIMULATION; EVOLUTION, MOLECULAR; MARKOV CHAINS; MOLECULAR SEQUENCE DATA; PHYLOGENY; PROTEINS; SEQUENCE ALIGNMENT; SEQUENCE HOMOLOGY, AMINO ACID;

EID: 0034120071     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/10665270050081513     Document Type: Review

References (42)

1. Altschul, S., and Erickson, B.W. 1986. Optimal sequence alignment using affine gap costs. J. Mol. Biol., 48, 603.
2. Altschul, S., and Lipman, D. 1989. Trees, stars, and multiple sequence alignment. J. Appl. Math., 49, 197-209.
3. Baldi, P., Chauvin, Y., Hunkapiller, T., and McClure, M.A. 1994. Hidden markov models of biological primary sequence information. Proc. Natl. Acad. Sci. USA, 91, 1059-1063.
4. Brenner, S.A., Cohen, M.A., and Gonnet, G.H. 1993. Empirical and structural models for insertions and deletions in the divergent evolution of proteins. J. Molecular Biology, 229: 1065-1082.
5. Carillo, H., and Lipman, D. 1988. The multiple sequence alignment problem in biology. SIAM J. Appl. Math., 48(5), 1073-1082.
6. Dayhoff, M.O., Schwartz, R.M., and Orcutt, B.C. 1978. A model for evolutionary change in proteins. In Dayhoff, M.O., editor, Atlas of Protein Sequence and Structure, volume 5, 345-352.
7. Dress, A., and Steel, M. 1993. Convex tree realization of partitions. Appl. Math. Lett., 5, 3-6.
8. Estabrook, G., Johnson, C., and McMorris, F. 1975. An idealized concept of the true cladistic character. Math. Biosciences, 23, 263-72.
9. Estabrook, G., Johnson, C., and McMorris, F. 1976. A mathematical foundation for the analysis of cladistic character compatibility. Math. Biosciences, 29, 181-87.
10. Felsenstein, J. 1973. Maximum-likelihood estimation of evolutionary trees from continuous characters. Amer. J. Human Genetics, 25, 471-492.
11. Felsenstein, J. 1981. Evolutionary trees from gene frequencies and quantitative characters: finding maximum likelihood estimates. Evolution, 35, 1229-1242.
12. Foulds, L.R., and Graham, R.L. 1982. The Steiner problem in phylogeny is np-complete. Proc. Natl. Academy Science, 3, 43-49.
13. Gonnet, G.H. 1994a. New algorithms for the computation of evolutionary phylogenetic trees. In Suhai, S., ed., Computational Methods In Genome Research, 153-161.
14. Gonnet, G.H. 1994b. A tutorial introduction to computational biochemistry using Darwin.
15. Gonnet, G.H., and Brenner, S.A. 1996. Probabilistic ancestral sequences and multiple alignments. In Fifth Scandinavian Workshop on Algorithm Theory, Reykjevik July 1996.
16. Gonnet, G.H., Cohen, M.A., and Brenner, S.A. 1992. Exhaustive matching of the entire protein sequence database. Science, 256, 1443-1445.
17. Gotoh, O. 1982. An improved algorithm for matching biological sequences. J. Mol. Biol., 162, 705-708.
18. Groetschel, M., and Holland, O. 1991. Solution of large-scale symmetric traveling salesman problems. Math. Programming, 141-202.
19. Gupta, S., Kececioglu, J., and Schaffer, A. 1995. Making the shortest-paths approach to sum-of-pairs multiple sequence alignment more space efficient in practice. Proc. 6th Symp. On Combinatorial Pattern Matching, 128-43.
20. Gupta, S.K., Kececioglu, J., and Schaffer, A.A. 1996. Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. J. Comp. Biol.
21. Higgins, D., and Sharp, P. 1989. Fast and sensitive multiple sequence alignments on a microcomputer. CABIOS, 5, 151-153.
22. Huang, X. 1994. On global sequence alignment. CABIOS, 10(3), 227-235.
23. Jiang, T., and Wang, L. 1994. On the complexity of multiple sequence alignment. J. Comp. Biol., 1, 337-48.
24. Jiang, T., Wang, L., and Lawler, E.L. 1996. Approximation algorithms for tree alignment with a given phylogeny. Algorithmica, 16, 302-15.
25. Johnson, D. 1987. More approaches to the travelling salesman guide. Nature, 330, 525.
26. Johnson, D. 1990. Local optimization and the traveling salesman problem. In Proc. 17th Colloq. On Automata, Languages and Programming, volume 443 of Lecture Notes in Computer Sciences, 446-461, Berlin. Springer Verlag.
27. Kececioglu, J. 1993. The maximum weight trace problem in multiple sequence alignment. Proc. 4th Symp. on Combinatorial Pattern Matching, 106-19.
28. Korostensky, C., and Gonnet, G.H. 1999a. Near optimal multiple sequence alignments using a traveling salesman problem approach. SPIRE99, 105-114.
29. Korostensky, C., and Gonnet, G.H. 1999b. Using traveling salesman problem algorithms for evolutionary tree construction. J. of Comp. Biol., submitted.
30. Krogh, A., Brown, M., Mian, I.S., Sjolander, K., and Haussler, D. 1994. Hidden markov models in computational biology: Applications to protein modeling. J. Mol. Biol., 235, 1501-1531.
31. Lipman, D.J., Altschul, S.F., and Kececioglu, J.D. June 1989. A tool for multiple sequence alignment. Proc. Natl. Acad. Sci. USA, 86, 4412-4415.
32. 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.
33. Padberg, M., and Rinaldi, G. 1991. A branch- and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review, 33, 60-100.
34. Papadimitriou, C.H. 1977. The euclidean traveling salesman problem is np-complete. Theoretical Computer Science, 4(3), 237-244.
35. Roui, R., and Kececioglu, J. 1998. Approximation algorithms for multiple sequence alignments under a fixed evolutionary tree. Discrete Applied Mathematics, 355-366.
36. Sankoff, D. 1975. Minimal mutation trees of sequences. SIAM J. Appl. Math., 28, 35-42.
37. Sankoff, D., and Cedergren, R. 1983. Simultaneous comparison of tree or more sequences related by a tree. In Sankoff, D., and Kruskal, G., eds., Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison, volume 28, 253-263. Addison Wesley, Reading, MA.
38. Schwarz, R, and Dayhoff, M. 1979. Matrices for detecting distant relationship. In Dayhoff, M., ed., Atlas of Protein Sequences, 353-58. Natl. Biomed. Res. Found.
39. Smith, T.F., and Waterman, M.S. 1981. Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
40. Thompson, J., Higgins, D., and Gibson, T. 1994. Clustal w: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, positions-specific gap penalties and weight matrix choice. Nucleic Acids Research, 22, 4673-4680.
41. Thorne, J., Kishino, H., and Felsenstein, J. 1993. Inching toward reality: An improved likelihood model of sequence evolution. J. Mol. Biol., 34, 3-16.
42. Wang, L., and Gusfield, D. 1996. Improved approximation algorithms for tree alignment. Proc. 7th Symp. on Combinatorial Pattern Matching, 220-33.