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.
CITATION STYLE
Havas, G., & Lian, J. X. (1994). A new problem in string searching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 660–668). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_235
Mendeley helps you to discover research relevant for your work.