Efficient pattern-matching with don't cares

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 655-656

  Kalai, Adam ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

DON'T-CARES; FINGERPRINT METHOD; RANDOMIZED ALGORITHMS; STRING MATCHING;

ALGORITHMS;

EID: 84961604860     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. M.J. Fischer and M.S. Paterson, String Matching and other Products, in Complexity of Computation, R.M. Karp (editor), SIAM AMS Proceedings, 7, pp. 113-125, 1974.
2. Z. Galil, Open problems in stringology, Combinatorial problems on words, NATO ASI Series, Vol. F12, pp. 1-8, 1985.
3. P. lndyk, Faster algorithms for string matching problems: matching the convolution bound, in Proceedings of the 39th Symposium on Foundations of Computer Science, 1998.
4. R.M. Karp and M.O. Rabin, Efficient randomized pattern-matching algorithms, IBM Journal of Research and Development, Vol. 31, no 2., pp. 249-260, 1987.
5. S. Muthukrishan and K. Palem, Non-standard Stringology: Algorithms and Complexity, in Proceedings of the 26th Symposium on the Theory of Computing, 1994.
6. S. Muthukrishnan, H. Ramesh, String Matching under a General Matching Relation, Information and Computation, Vol. 122, No. 1, pp. 140-148, Oct 1995.