Dynamic use of multiple parameter sets in sequence alignment

Nucleic Acids Research

Volumn 35, Issue 2, 2007, Pages 678-686

  Huang, Xiaoqiu ^a   Brutlag, Douglas L ^b  

^a Iowa State University   (United States)

^b STANFORD UNIVERSITY SCHOOL OF MEDICINE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; BIOINFORMATICS; COMPUTER PROGRAM; GENE SEQUENCE; GENETIC ALGORITHM; INTERMETHOD COMPARISON; MATHEMATICAL COMPUTING; PARAMETER; PRIORITY JOURNAL; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SEQUENCE HOMOLOGY; STATISTICAL PARAMETERS; STATISTICAL SIGNIFICANCE;

ALGORITHMS; COMPUTATIONAL BIOLOGY; SEQUENCE ALIGNMENT; SEQUENCE HOMOLOGY, AMINO ACID; SOFTWARE;

EID: 33846912471     PISSN: 03051048     EISSN: 13624962     Source Type: Journal    
DOI: 10.1093/nar/gkl1063     Document Type: Article

References (38)

1. Pearson,W.R. and Lipman,D. (1988) Improved tools for biological sequence comparison. Proc. Natl Acad. Sci. USA, 85, 2444-2448.
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. Burkhardt,S., Crauser,A., Lenhof,H.-P., Rivals,E., Ferragina,P. and Vingron,M. (1999) Q-gram based database searching using a suffix array. In Proceedings of the Third Annual International Conference on Computational Molecular Biology. ACM Press, New York, pp. 77-83.
4. Ning,Z., Cox,A.J. and Mullikin,J.C. (2001) SSAHA: A fast search method for large DNA databases. Genome Res., 11, 1725-1729.
5. Kent,W.J. (2002) BLAT-The BLAST-like alignment tool. Genome Res., 12, 656-664.
6. Ma,B., Tromp,J. and Li,M. (2002) PatternHunter: Faster and more sensitive homology search. Bioinformatics, 18, 440-445.
7. Bray,N., Dubchak,I. and Pachter,L. (2003) AVID: A global alignment program. Genome Res., 13, 97-102.
8. Schwartz,S., Kent,W.J., Smit,A., Zhang,Z., Baertsch,R., Hardison,R., Haussler,D. and Miller,W. (2003) Human-mouse alignments with BLASTZ. Genome Res., 13, 103-107.
9. Brudno,M., Do,C.B., Cooper,G.M., Kim,M.F., Davydov,E., Green,E.D., Sidow,A. and Batzoglou,S. (2003) LAGAN and Multi-LAGAN: Efficient tools for large-scale multiple alignment of genomic DNA. Genome Res., 13, 721-731.
10. Kurtz,S., Phillippy,A., Delcher,A.L., Smoot,M., Shumway,M., Antonescu,C. and Salzberg,S.L. (2004) Versatile and open software for comparing large genomes. Genome Biol., 5, R12.1-9.
11. Needleman,S.B. and Wunsch,C.D. (1970) A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. Mol. Biol., 48, 443-453.
12. Smith,T.F. and Waterman,M.S. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
13. Gotoh,O. (1982) An improved algorithm for matching biological sequences. J. Mol. Biol., 162, 705-708.
14. Waterman,M.S. and Eggert,M. (1987) A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons. J. Mol. Biol., 197, 723-728.
15. Myers,E.W. and Miller,W. (1988) Optimal alignments in linear space. Comput. Appl. Biosci., 4, 11-17.
16. Gotoh,O. (1990) Optimal sequence alignment allowing for long gaps. Bull. Math. Biol., 52, 359-373.
17. Huang,X. and Miller,W. (1991) A time-efficient, linear-space local similarity algorithm. Adv. Appl. Math., 12, 337-357.
18. Chao,K.-M., Pearson,W.R. and Miller,W. (1992) Aligning two sequences within a specified diagonal band. Comput. Appl. Biosci., 8, 481-487.
19. Huang,X. and Chao,K.-M. (2003) A generalized global alignment algorithm. Bioinformatics, 19, 228-233.
20. Collins,J.F., Coulson,A.F.W. and Lyall,A. (1988) The significance of protein sequence similarities. Comput. Appl. Biosci., 4, 67-71.
21. Altschul,S.F. (1993) A protein alignment scoring system sensitive at all evolutionary distances. J. Mol. Evol., 36, 290-300.
22. Zhu,J., Liu,J.S. and Lawrence,C.E. (1998) Bayesian adaptive sequence alignment. Bioinformatics, 14, 25-39.
23. Liu,J.S. and Lawrence,C.E. (1999) Bayesian inference on biopolymer models. Bioinformatics, 15, 38-52.
24. 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.
25. Hirschberg,D.S. (1975) A linear space algorithm for computing maximal common subsequences. Commun. Assoc. Comput. Mach., 18, 341-343.
26. Huang,X. (1994) On global sequence alignment. Comput. Appl. Biosci., 10, 227-235.
27. Mott,R. (1997) EST_GENOME: A program to align spliced DNA sequences to unspliced genomic DNA. Comput. Appl. Biosci., 13, 477-478.
28. Huang,X. (2002) Bio-sequence comparison and applications. In Jiang,T., Xu,Y. and Zhang,M. (eds), Current Topics in Computational Molecular Biology. MIT Press, Cambridge, pp. 45-69.
29. Henikoff,S. and Henikoff,J.G. (1992) Amino acid substitution matrices from protein blocks. Proc. Natl Acad. Sci. USA, 89, 10915-10919.
30. Pearson,W.R. (1995) Comparison of methods for searching protein sequence databases. Protein Sci., 4, 1145-1160.
31. Pearson,W.R. (1998) Empirical statistical estimates for sequence similarity searches. J. Mol. Biol., 276, 71-84.
32. Reese,J.T. and Pearson,W.R. (2002) Empirical determination of effective gap penalties for sequence comparison. Bioinformatics, 18, 1500-1507.
33. Wu,T.D., Nevill-Manning,C.G. and Brutlag,D.L. (1999) Minimal-risk scoring matrices for sequence analysis. J. Comp. Biol., 6, 219-235.
34. Wu,T.D., Nevill-Manning,C.G. and Brutlag,D.L. (2000) Fast probabilistic analysis of sequence function using scoring matrices. Bioinformatics, 16, 233-244.
35. 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.
36. Mott,R. (1992) Maximum-likelihood estimation of the statistical distribution of Smith-Waterman local sequence similarity scores. Bull. Math. Biol., 54, 59-75.
37. Waterman,M.S. and Vingron,M. (1994) Rapid and accurate estimates of statistical significance for sequence database searches. Proc. Natl Acad. Sci. USA, 91, 4625-4628.
38. Altschul,S.F. and Gish,W. (1996) Local alignment statistics. Enzymol., 266, 460-480.