Simple deterministic wildcard matching

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(n log m) 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. Key words: Algorithms; String matching; Wildcards.

• Type: Journal
• Year: 2007
• Where: IPL
• Authors: Peter Clifford, Raphaël Clifford
• Keywords: Algorithms, Fast Deterministic Solution, IPL 2006, IPL 2007, Single Character Wildcards