A family of fast constant-space substring search algorithms
This paper describes a new strategy for searching a substring in a given text. The method is based on the well-known Boyer-Moore algorithm complementing it with a technique called q-slicing, a form of probabilistic 5-gram matching. As a result, we get a family of highly parametric algorithms apt for...
Saved in:
| Main Authors: | |
|---|---|
| Corporate Author: | |
| Format: | Article |
| Published: |
1999
|
| Series: | Acta cybernetica
14 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Algoritmus |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12624 |
| Summary: | This paper describes a new strategy for searching a substring in a given text. The method is based on the well-known Boyer-Moore algorithm complementing it with a technique called q-slicing, a form of probabilistic 5-gram matching. As a result, we get a family of highly parametric algorithms apt for adaptation to the special properties inherent to the source which generates the input strings. The search procedure is independent of the alphabet size and appropriate for efficient and practical on-line implementations. Simulation results show that they are comparable to the fastest currently known Boyer-Moore variants. |
|---|---|
| Physical Description: | 239-250 |
| ISSN: | 0324-721X |