Real-time streaming string-matching

Authors:
Dany Breslauer;Zvi Galil
Affiliations:
Caesarea Rothchild Institute, University of Haifa, Haifa, Israel;College of Computing, Georgia Institute of Technology, Atlanta, Georgia
Venue:
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Year:
2011

Citing 4
Cited 4

Optimal parallel algorithms for string matching

Information and Control
String Matching in Real Time

Journal of the ACM (JACM)
Efficient randomized pattern-matching algorithms

IBM Journal of Research and Development - Mathematics and computing
Exact and Approximate Pattern Matching in the Streaming Model

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science

The Ehrenfeucht-Silberger problem

Journal of Combinatorial Theory Series A
Pattern matching in multiple streams

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Parikh matching in the streaming model

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Simple real-time constant-space string matching

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.