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. © 2006 Elsevier B.V. All rights reserved.
- Publication status:
- Publisher copy:
- Copyright date:
If you are the owner of this record, you can report an update to it here: Report update to this record