Sequence alignment with an appropriate substitution matrix

Journal of Computational Biology

Volumn 15, Issue 2, 2008, Pages 129-138

  Huang, Xiaoqiu ^a  

^a Iowa State University   (United States)

Author keywords

Evolutionary distance; Sequence alignment; Substitution matrix

Indexed keywords

ACCURACY; ALGORITHM; ARTICLE; COMPUTER PROGRAM; GENE SEQUENCE; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; PROTEIN FAMILY; SEQUENCE ALIGNMENT; SEQUENCE HOMOLOGY;

ALGORITHMS; AMINO ACID SEQUENCE; EVOLUTION, MOLECULAR; PROTEINS; SEQUENCE ALIGNMENT; SOFTWARE;

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

References (31)

1. Altschul, S.F. 1993. A protein alignment scoring system sensitive at all evolutionary distances. J. Mol. Evol. 36, 290-300.
2. Brent, R.P. 1973. Algorithms for Minimization without Derivatives, Prentice-Hall, Englewood Cliffs, NJ.
3. Brutlag, D.L., Dautricout, J.P., Maulik, S., et al. 1990. Improved sensitivity of biological sequence database searches. Comp. Appl. Biol. 6, 237-245.
4. Dayhoff, M.O., Schwartz, R.M., and Orcutt, B.C. 1978. A model of evolutionary change in proteins, 345-358. In: Dayhoff, M.O., ed., Atlas of Protein Sequence and Structure, Vol. 5, Suppl. 3. National Biomedical Research Foundation, Washington, DC.
5. Durbin, R., Eddy, S., Krogh, A., and Mitchison, G. 1998. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge, UK.
6. Felsenstein, J. 2004. Inferring Phylogenies. Sinauer Associates, Sunderland, MA.
7. Fernández-Baca, D., and Srinivasan, S. 1991. Constructing the minimization diagram of a two-parameter problem. Operat. Res. Lett. 10, 87-93.
8. Fitch, W., and Smith, T. 1983. Optimal sequence alignments. Proc. Natl. Acad. Sci. USA 80, 1382-1386.
9. Gonnet, G.H., Cohen, M.A., and Benner, S.A. 1992. Exhaustive matching of the entire protein sequence database. Science 256, 1443-1445.
10. Gotoh, O. 1982. An improved algorithm for matching biological sequences. J. Mol. Biol. 162, 705-708.
11. Gotoh, O. 1990. Optimal sequence alignment allowing for long gaps. Bull. Math. Biol. 52, 359-373.
12. Gusfield, D., Balasubramanian, K., and Naor, D. 1992. Parametric optimization of sequence alignment. Proc. Third Annu. ACM-SIAM Symp. Discrete Algorithms, 432-439. SIAM, Philadelphia, PA.
13. Henikoff, S., and Henikoff, J.G. 1992. Amino acid substitution matrices from protein blocks. Proc. Natl. Acad. Sci USA 89, 10915-10919.
14. Huang, X., and Brutlag, D.L. 2007. Dynamic use of multiple parameter sets in sequence alignment. Nucleic Acids Res. 35, 678-686.
15. Huang, X., and Chao, K.-M. 2003. A generalized global alignment algorithm. Bioinformatics 19, 228-233.
16. Huang, X., and Miller, W. 1991. A time-efficient, linear-space local similarity algorithm. Adv. Appl. Math. 12, 337-357.
17. Jones, D.T., Taylor, W.R., and Thornton, J.M. 1992. The rapid generation of mutation data matrices from protein sequences. Comput. Appl. Biosci. 8, 275-282.
18. Karlin, S., and Altschul, S.F. 1990. Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. Proc. Natl. Acad. Sci. USA 87, 2264-2268.
19. Mott, R. 2000. Accurate formula for P-values of gapped local sequence and profile alignments. J. Mol. Biol. 300, 649-659.
20. Müller, T., and Vingron, M. 2000. Modeling amino acid replacement. J. Comput. Biol. 7, 761-776.
21. Pearson, W.R. 1995. Comparison of methods for searching protein sequence databases. Protein Sci. 4, 1145-1160.
22. Press, W.H., Teukolsky, S.A., Vetterling, W.T., et al. 1992. Numerical Recipes in C. Cambridge University Press, Cambridge, UK.
23. Reese, J.T., and Pearson, W.R. 2002. Empirical determination of effective gap penalties for sequence comparison. Bioinformatics 18, 1500-1507.
24. Schmidt, H.A., Strimmer, K., Vingron, M., et al. 2002. TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing. Bioinformatics 18, 502-504.
25. Smith, T.F., and Waterman, M.S. 1981. Identification of common molecular subsequences. J. Mol. Biol. 147, 195-197.
26. Tatusov, R.L., Koonin, E.V., and Lipman, D.J. 1997. A genomic perspective on protein families. Science 278, 631-637.
27. Vingron, M., and Argos, P. 1991. Motif recognition and alignment for many sequences by comparison of dot-matrices. J. Mol. Biol. 218, 33-43.
28. Vingron, M., and Waterman, M.S. 1994. Sequence alignment and penalty choice: review of concepts, case studies and implications. J. Mol. Biol. 235, 1-12.
29. Vogt, G., Etzold, T., and Argos, P. 1995. An assessment of amino acid exchange matrices in aligning protein sequences: the twilight zone revisited. J. Mol. Biol. 249, 816-831.
30. Waterman, M.S., Eggert, M., and Lander, E. 1992. Parametric sequence comparisons. Proc. Natl. Acad. Sci. USA 89, 6090-6093.
31. Webb, B.-J.M., Liu, J.S., and Lawrence, C.E. 2002. BALSA: Bayesian algorithm for local sequence alignment. Nucleic Acids Res. 30, 1268-1277.