Faster pattern matching with character classes using prime number encoding

Journal of Computer and System Sciences

Volumn 75, Issue 3, 2009, Pages 155-162

  Linhart, Chaim ^a   Shamir, Ron ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

FFT based pattern matching; Hamming distance; Pattern matching with character classes; Subset matching

Indexed keywords

ENCODING (SYMBOLS); FAST FOURIER TRANSFORMS; PATTERN MATCHING; SIGNAL ENCODING;

APPROXIMATE MATCHING; ENCODING SCHEMES; FINITE ALPHABET; K-MISMATCHES; MATCHING PROBLEMS; PATTERN POSITION; RUNNING TIME; SUBSET MATCHING;

HAMMING DISTANCE;

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

References (21)

1. Knuth D., Morris J., and Pratt V. Fast pattern matching in strings. SIAM J. Comput. 6 2 (1977) 323-350
2. Boyer R.S., and Moore J.S. A fast string searching algorithm. Commun. ACM 20 10 (1977) 762-772
3. Gusfield D. Algorithms on Strings, Trees, and Sequences (1997), Cambridge Univ. Press
4. M. Fischer, M. Paterson, String matching and other products, in: R.M. Karp (Ed.), Complexity of Computation, SIAM-AMS Proceedings, 1974, pp. 113-125
5. P. Indyk, Faster algorithms for string matching problems: matching the convolution bound, in: Proc. 39th IEEE Annual Symposium on Foundations of Computer Science, 1998, pp. 166-173
6. A. Kalai, Efficient pattern-matching with don't cares, in: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 655-656
7. R. Cole, R. Hariharan, Verifying candidate matches in sparse and wildcard matching, in: Proc. 34th Symposium on Theory of Computing, 2002, pp. 592-601
8. Clifford P., and Clifford R. Simple deterministic wildcard matching. Inform. Process. Lett. 101 2 (2007) 53-54
9. Pinter R. Efficient string matching with don't-care patterns. In: Apostolico A., and Galil Z. (Eds). Combinatorial Algorithms on Words. NATO ASI Ser. vol. F12 (1985), Springer-Verlag 11-29
10. Abrahamson K. Generalized string matching. SIAM J. Comput. 16 (1987) 1039-1051
11. Baeza-Yates R.A., and Gonnet G.H. A new approach to text searching. Commun. ACM 35 10 (1992) 74-82
12. A. Amir, M. Lewenstein, E. Porat, Faster algorithms for string matching with k mismatches, in: Proc. 11th annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 794-803
13. 3 m) time, in: Proc. 29th ACM Symposium on Theory of Computing, 1997, pp. 66-75
14. Hoh J., Jin S., Parrado T., Edington J., Levine A., and Ott J. The p53MH algorithm and its application in detecting p53-responsive genes. Proc. Natl. Acad. Sci. USA 99 13 (2002) 8467-8472
15. Linhart C., and Shamir R. The degenerate primer design problem: Theory and applications. J. Comput. Biol. 12 4 (2005) 431-456
16. Fuchs T., Malecova B., Linhart C., Sharan R., Khen M., Herwig R., Shmulevich D., Elkon R., Steinfath M., O'Brien J., Radelof U., Lehrach H., Lancet D., and Shamir R. DEFOG: A practical scheme for deciphering families of genes. Genomics 80 3 (2002) 295-302
17. Olender T., Fuchs T., Linhart C., Shamir R., Adams M., Kalush F., Khen M., and Lancet D. The canine olfactory subgenome. Genomics 83 3 (2004) 361-372
18. Rosser J., and Schoenfield L. Approximate formulas for some functions of prime numbers. Illinois J. Math. 6 (1962) 64-94
19. Agrawal M., Kayal N., and Saxena N. PRIMES is in P. Ann. of Math. 160 2 (2004) 781-793
20. Atkin A., and Bernstein D. Prime sieves using binary quadratic forms. Math. Comp. 73 (2004) 1023-1030
21. Cormen T., Leiserson C., Rivest R., and Stein C. Introduction to Algorithms. 2nd edition (2001), MIT Press, McGraw-Hill