Journal article icon

Journal article

Simple deterministic wildcard matching

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 (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:
Published

Actions


Access Document


Publisher copy:
10.1016/j.ipl.2006.08.002

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Statistics
Clifford, R More by this author
Journal:
INFORMATION PROCESSING LETTERS
Volume:
101
Issue:
2
Pages:
53-54
Publication date:
2007-01-31
DOI:
ISSN:
0020-0190
URN:
uuid:52d9d11c-60ca-499a-bdaf-8324fd03b8a1
Source identifiers:
97451
Local pid:
pubs:97451
Language:
English
Keywords:

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP