Skip to main content
Conference Proceedings

Real-time streaming string-matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6661 LNCS 162-172
DOI: 10.1007/978-3-642-21458-5_15
17Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a real-time randomized streaming string matching algorithm that uses O(logm) 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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Breslauer, D., & Galil, Z. (2011). Real-time streaming string-matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6661 LNCS, pp. 162–172). https://doi.org/10.1007/978-3-642-21458-5_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free