A new problem in string searching

Details A new problem in string searching A new problem in string searching

1994-06-15

arxiv.org/abs/math/9406206v1

Mathematics

Group Theory

To appear in Proceedings Fifth Annual International Symposium on Algorithms and Computation (ISAAC'94), Lecture Notes in Compu

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A new problem in string searching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new problem in string searching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new problem in string searching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-653132