Simple deterministic wildcard matching

Information Processing Letters

Volumn 101, Issue 2, 2007, Pages 53-54

  Clifford, Peter ^a   Clifford, Raphaël ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Algorithms; String matching; Wildcards

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; TEXT PROCESSING;

STRING MATCHING; WILDCARD MATCHING; WILDCARDS;

PATTERN MATCHING;

EID: 33751254073     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.08.002     Document Type: Article

References (4)

1. R. Cole, R. Hariharan, Verifying candidate matches in sparse and wildcard matching, in: Proceedings of the Annual ACM Symposium on Theory of Computing, 2002, pp. 592-601
2. M. Fischer, M. Paterson, String matching and other products, in: R. Karp (Ed.), Proceedings of the 7th SIAM-AMS Complexity of Computation, 1974, pp. 113-125
3. P. Indyk, Faster algorithms for string matching problems: Matching the convolution bound, in: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1998, pp. 166-173
4. Kalai A. Efficient pattern-matching with don't cares. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (2002), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA 655-656