Skip to main content
Conference Proceedings

Simple real-time constant-space string matching

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

Abstract

We use a simple observation about the locations of critical factorizations to derive a real-time variation of the Crochemore-Perrin constant-space string matching algorithm. The real-time variation has a simple and efficient control structure. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Breslauer, D., Grossi, R., & Mignosi, F. (2011). Simple real-time constant-space string matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6661 LNCS, pp. 173–183). https://doi.org/10.1007/978-3-642-21458-5_16

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