Real-Time Streaming String-Matching

This paper presents a real-time randomized streaming string matching algorithm that uses O(log m) space. The algorithm only makes one-sided small probability false-positive errors, possibly reporting phantom occurrences of the pattern, but never misses an actual occurrence.

[1]  Zvi Galil,et al.  Time-Space-Optimal String Matching , 1983, J. Comput. Syst. Sci..

[2]  Ely Porat,et al.  Exact and Approximate Pattern Matching in the Streaming Model , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[3]  H. Wilf,et al.  Uniqueness theorems for periodic functions , 1965 .

[4]  Funda Ergün,et al.  Periodicity in Streams , 2010, APPROX-RANDOM.

[5]  Zvi Galil.  Optimal Parallel Algorithms for String Matching , 1985, Inf. Control..

[6]  Richard M. Karp,et al.  Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..

[7]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[8]  Zvi Galil,et al.  String Matching in Real Time , 1981, JACM.