Efficient q-gram filters for finding all ε-matches over a given length

Journal of Computational Biology

Volumn 13, Issue 2, 2006, Pages 296-308

  Rasmussen, Kim R ^a   Stoye, Jens ^a   Myers, Eugene W ^b  

^a BIELEFELD UNIVERSITY   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

EST clustering; Filter; Local alignment searching; q grams; Sequence assembly

Indexed keywords

ALGORITHM; BIOINFORMATICS; CALCULATION; COMPUTER PROGRAM; CONFERENCE PAPER; DATA ANALYSIS; DATA EXTRACTION; ERROR; EXPRESSED SEQUENCE TAG; GENE SEQUENCE; GENOME; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SEQUENCE HOMOLOGY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DATABASES, NUCLEIC ACID; GENOME; SENSITIVITY AND SPECIFICITY; SEQUENCE ALIGNMENT;

EID: 33646000287     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.13.296     Document Type: Conference Paper

References (21)

1. Altschul, S.F., Gish, W., Miller, W., Myers, E.W., and Lipman, D.J. 1990. Basic local alignment search tool. J. Mol. Biol. 215(3), 403-410.
2. Altschul, S.F., Madden, T.L., Schäffer, A.A., Zhang, J., Zhang, Z., Miller, W., and Lipman, D.J. 1997. Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucl. Acids Res. 25(17), 3389-3402.
3. Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H.-P., Rivals, E., and Vingron, M. 1999. q-gram based database searching using a suffix array. Proc. 3rd Ann. Int. Conf. on Computational Molecular Biology (RECOMB '99), 77-83.
4. Burkhardt, S., and Kärkkäinen, J. 2001. Better filtering with gapped q-grams. Proc. 12th Ann. Symp. on Combinatorial Pattern Matching (CPM '01), vol. 2089, 73-85.
5. Califano, A., and Rigoutsos, I. 1993. FLASH: A fast look-up algorithm for string homology. Proc. 1st Int. Conf. on Intelligent Systems for Molecular Biology (ISMB '93), 56-64.
6. Chang, W.I., and Lawler, E.L. 1994. Sublinear expected time approximate string matching and biological applications. Algorithmica 12(4/5), 327-344.
7. Eppstein, D., Galil, Z., Giancarlo, R., and Italiano, G.F. 1992. Sparse dynamic programming I: Linear cost functions. J. ACM 39(3), 519-545.
8. Gusfield, D. 1997. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, Cambridge University Press, London.
9. Jokinen, P., and Ukkonen, E. 1991. Two algorithms for approximate string matching in static texts. Mathematical Foundations of Computer Science 1991: Proc. of the 16th Int. Symp. (MFCS '91), 240-248.
10. Kent, W.J. 2002. BLAT-The BLAST-like alignment tool. Genome Res. 12(4), 656-664.
11. Li, M., Ma, B., Kisman, D., and Tromp, J. 2003. PatternHunter II: Highly sensitive and fast homology search. Proc. 14th Ann. Int. Conf. on Genome Informatics (GIW '03), 164-175.
12. Ma, B., Tromp, J., and Li, M. 2002. PatternHunter-Faster and more sensitive homology search. Bioinformatics 18, 440-445.
13. Myers, E. 1994. A sublinear algorithm for approximate keyword searching. Algorithmica 12(4/5), 345-374.
14. Myers, E. 1999. A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM 46(3), 395-415.
15. Myers, G., and Durbin, R. 2003. A table-driven, fulls-sensitivity similarity search algorithm. J. Comp. Biol. 10(2), 103-117.
16. Ning, Z., Cox, A.J., and Mullikin, J.C. 2001. SSAHA: A fast search method for large DNA databases. Genome Res. 11(10), 1725-1729.
17. Pearson, W.R. 1991. Searching protein sequence libraries: Comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms. Genomics 11(3), 635-650.
18. Pearson, W.R., and Lipman, D.J. 1988. Improved tools for biological sequence comparison. Proc. Natl. Acad. Sci. USA 85, 2444-2448.
19. Smith, T.F., and Waterman, M.S. 1981. Identification of common molecular subsequences. J. Mol. Biol. 147(1), 195-197.
20. Ukkonen, E. 1992. Approximate string-matching with q-grams and maximal matches. Theor. Comput. Sci. 92(1), 191-211.
21. Zhang, Z., Berman, P., and Miller, W. 1998. Alignments without low-scoring regions. Proc. 2nd Ann. Int. Conf. on Computational Molecular Biology (RECOMB '98), 294-301.