Abstract
We introduce a novel alphabet sampling technique for speeding up both online and indexed string matching. We choose a subset of the alphabet and select the corresponding subsequence of the text. Online or indexed searching is then carried out on that subsequence, and candidate matches are verified in the full text. We show that this speeds up online searching, especially for moderate to long patterns, by a factor of up to 5. For indexed searching we achieve indexes that are as fast as the classical suffix array, yet occupy space less than 0.5 times the text size (instead of 4) plus text. Our experiments show no competitive alternatives in a wide space/time range. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Claude, F., Navarro, G., Peltola, H., Salmela, L., & Tarhio, J. (2008). Speeding up pattern matching by text sampling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5280 LNCS, pp. 87–98). Springer Verlag. https://doi.org/10.1007/978-3-540-89097-3_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
