Non-standard stringology: algorithms and complexity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
String matching under a general matching relation
Information and Computation
Faster Algorithms for String Matching Problems: Matching the Convolution Bound
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Simple deterministic wildcard matching
Information Processing Letters
Discovering regularities in biosequences: Challenges and applications
Journal of Computational Methods in Sciences and Engineering
A Black Box for Online Approximate Pattern Matching
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
From coding theory to efficient pattern matching
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Faster pattern matching with character classes using prime number encoding
Journal of Computer and System Sciences
Pattern matching with don't cares and few errors
Journal of Computer and System Sciences
Pattern matching with wildcards based on key character location
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
BPBM: An Algorithm for String Matching with Wildcards and Length Constraints
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A filtering algorithm for k-mismatch with don't cares
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
A filtering algorithm for k-mismatch with don't cares
Information Processing Letters
Pattern matching with wildcards using words of shorter length
Information Processing Letters
A black box for online approximate pattern matching
Information and Computation
Online dictionary matching with variable-length gaps
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
String indexing for patterns with wildcards
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Self-normalised distance with don't cares
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
PMBC: Pattern mining from biological sequences with wildcard constraints
Computers in Biology and Medicine
Fingerprints in compressed strings
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We present a randomized algorithm for the string matching with don't cares problem. Based on the simple fingerprint method of Karp and Rabin for ordinary string matching [4], our algorithm runs in time O(n log m) for a text of length n and a pattern of length m and is simpler and slightly faster than the previous algorithms [3, 5, 1].