Optimal spaced seeds for faster approximate string matching

Journal of Computer and System Sciences

Volumn 73, Issue 7, 2007, Pages 1035-1044

  Farach Colton, Martin ^a   Landau, Gad M ^b   Sahinalp, S Cenk ^c   Tsur, Dekel ^d  

^a Center for Discrete Mathematics and Theoretical Computer Science   (United States)

^b UNIVERSITY OF HAIFA   (Israel)

^c SIMON FRASER UNIVERSITY   (Canada)

^d BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Hamming distance; Pattern matching; Seeds design

Indexed keywords

APPROXIMATION THEORY; HAMMING DISTANCE; HEURISTIC METHODS; STATISTICAL METHODS;

FALSE POSITIVES RATE; SEEDS DESIGN; SPACED SEEDS; TRUE MATCHES;

PATTERN MATCHING;

EID: 34547109672     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.03.007     Document Type: Article

References (16)

1. Altschul S., Gisch W., Miller W., Myers E., and Lipman D. Basic local alignment search tool. J. Mol. Biol. 215 3 (1990) 403-410
2. Amir A., Lewenstein M., and Porat E. Faster algorithms for string matching with k mismatches. J. Algorithms 50 2 (2004) 257-275
3. Brejová B., Brown D.G., and Vinar T. Vector seeds: An extension to spaced seeds. J. Comput. System Sci. 70 3 (2005) 364-380
4. Buhler J., Keich U., and Sun Y. Designing seeds for similarity search in genomic DNA. J. Comput. System Sci. 70 3 (2005) 342-363
5. Burkhardt S., and Kärkkäinen J. Better filtering with gapped q-grams. Fundam. Inform. 56 1-2 (2003) 51-70
6. A. Califano, I. Rigoutsos, FLASH: A fast look-up algorithm for string homology, in: Proc. 1st International Conference on Intelligent Systems for Molecular Biology (ISMB), 1993, pp. 56-64
7. Cole R., and Hariharan R. Approximate string matching: A simpler faster algorithm. SIAM J. Comput. 31 6 (2002) 1761-1782
8. Karpinski M., and Zelikovsky A. Approximating dense cases of covering problems. Electronic Colloquium on Computational Complexity (ECCC) 4 4 (1997)
9. Keich U., Li M., Ma B., and Tromp J. On spaced seeds for similarity search. Discrete Appl. Math. 138 3 (2004) 253-263
10. Kucherov G., Noé L., and Roytberg M.A. Multiseed lossless filtration. IEEE/ACM Trans. Comput. Biol. Bioinform. 2 1 (2005) 51-61
11. Landau G.M., and Vishkin U. Fast parallel and serial approximate string matching. J. Algorithms 10 2 (1989) 157-169
12. Li M., Ma B., Kisman D., and Tromp J. Patternhunter II: Highly sensitive and fast homology search. J. Bioinform. Comput. Biol. 2 3 (2004) 417-440
13. Ma B., Tromp J., and Li M. Patternhunter: Faster and more sensitive homology search. Bioinformatics 18 3 (2002) 440-445
14. S.C. Sahinalp, U. Vishkin, Efficient approximate and dynamic matching of patterns using a labeling paradigm, in: Proc. 37th Symposium on Foundation of Computer Science (FOGS), 1996, pp. 320-328
15. Sun Y., and Buhler J. Designing multiple simultaneous seeds for DNA similarity search. J. Comput. Biol. 12 6 (2005) 847-861
16. J. Xu, D.G. Brown, M. Li, B. Ma, Optimizing multiple spaced seeds for homology search, in: Proc. 14th Annual Symposium on Combinatorial Pattern Matching (CPM), 2004, pp. 47-58