Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.ipl.2006.08.002 | Inf. Process. Lett. |
Keywords | DocType | Volume |
deterministic solution,wildcards.,length n,algorithms,simple deterministic wildcard matching,single character wildcards,string matching,previous approach,length m,wildcards | Journal | 101 |
Issue | ISSN | Citations |
2 | 0020-0190 | 31 |
PageRank | References | Authors |
1.30 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Clifford | 1 | 42 | 2.68 |
| Raphaël Clifford | 2 | 268 | 28.57 |