Simple deterministic wildcard matching

Authors:
Peter Clifford;Raphaël Clifford
Affiliations:
Department of Statistics, University of Oxford, UK;University of Bristol, Department of Computer Science, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, UK
Venue:
Information Processing Letters
Year:
2007

Citing 3
Cited 26

Verifying candidate matches in sparse and wildcard matching

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficient pattern-matching with don't cares

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Faster Algorithms for String Matching Problems: Matching the Convolution Bound

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Approximating general metric distances between a pattern and a text

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Black Box for Online Approximate Pattern Matching

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Matching with don't-cares and a small number of mismatches

Information Processing Letters
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
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Set Intersection and Sequence Matching

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Pattern matching with don't cares and few errors

Journal of Computer and System Sciences
K-mismatch with don't cares

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 faster algorithm for the computation of string convolutions using LZ78 parsing

Information Processing Letters
Hardness of comparing two run-length encoded strings

Journal of Complexity
A filtering algorithm for k-mismatch with don't cares

Information Processing Letters
On the complexity of deciding avoidability of sets of partial words

Theoretical Computer Science
Pattern matching with wildcards using words of shorter length

Information Processing Letters
Finding witnesses by peeling

ACM Transactions on Algorithms (TALG)
The indexing for one-dimensional proportionally-scaled strings

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
Efficient and secure generalized pattern matching via fast fourier transform

AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Periodicity algorithms for partial words

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
A new efficient indexing algorithm for one-dimensional real scaled patterns

Journal of Computer and System Sciences
Practical verified computation with streaming interactive proofs

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
SecTTS: A secure track & trace system for RFID-enabled supply chains

Computers in Industry
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

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a simple and fast deterministic solution to the string matching with don't cares problem. The task is to determine all positions in a text where a pattern occurs, allowing both pattern and text to contain single character wildcards. Our algorithm takes O(nlogm) time for a text of length n and a pattern of length m and in our view the algorithm is conceptually simpler than previous approaches.