A new problem in string searching
Group Theory
2009-09-25 v1
Abstract
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timestamp algorithms which skip searching parts of the text where there are no matches at all and prove their correctness. At the match level, we consider Harrison signature, Karp-Rabin fingerprint, Bloom filter and automata based matching algorithms and present experimental performance figures.
Keywords
Cite
@article{arxiv.math/9406206,
title = {A new problem in string searching},
author = {George Havas and Jin Xian Lian},
journal= {arXiv preprint arXiv:math/9406206},
year = {2009}
}
Comments
To appear in Proceedings Fifth Annual International Symposium on Algorithms and Computation (ISAAC'94), Lecture Notes in Computer Science