Simple deterministic wildcard matching
| Autor: | Peter Clifford, Raphaël Clifford |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: |
Matching (graph theory)
Commentz-Walter algorithm Wildcard character computer.file_format String searching algorithm Single character Computer Science Applications Theoretical Computer Science Task (computing) Wildcard Simple (abstract algebra) Signal Processing ComputingMethodologies_DOCUMENTANDTEXTPROCESSING computer Algorithm Information Systems Mathematics |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|