Simple Deterministic Wildcard Matching

Peter Clifford, Raphaël Clifford

Research output: Contribution to journalArticle (Academic Journal)peer-review

74 Citations (Scopus)


We present a simple and fast deterministic solution to the \emph{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(n\log{m})$ time for a text of length $n$ and a pattern of length $m$ and in our view is conceptually simpler than previous approaches.
Translated title of the contributionSimple Deterministic Wildcard Matching
Original languageEnglish
Article number-
JournalInformation Processing Letters
Publication statusPublished - 2007


Dive into the research topics of 'Simple Deterministic Wildcard Matching'. Together they form a unique fingerprint.

Cite this