Speeding Up Pattern Matching by Text Sampling

Authors:
Francisco Claude;Gonzalo Navarro;Hannu Peltola;Leena Salmela;Jorma Tarhio
Affiliations:
Department of Computer Science, University of Chile,;Department of Computer Science, University of Chile,;Department of Computer Science and Engineering, Helsinki University of Technology,;Department of Computer Science and Engineering, Helsinki University of Technology,;Department of Computer Science and Engineering, Helsinki University of Technology,
Venue:
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Year:
2008

Citing 10
Cited 1

Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Fast and flexible word searching on compressed text

ACM Transactions on Information Systems (TOIS)
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences

Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
String Searching Algorithms Revisited

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Sparse Suffix Trees

COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
String Matching with Stopper Encoding and Code Splitting

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Replacing suffix trees with enhanced suffix arrays

Journal of Discrete Algorithms - SPIRE 2002
Compressed full-text indexes

ACM Computing Surveys (CSUR)
Compressed Text Indexes with Fast Locate

CPM '07 Proceedings of the 18th annual symposium on Combinatorial Pattern Matching
Suffix arrays on words

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

From nondeterministic suffix automaton to lazy suffix tree

Algorithms and Applications

Quantified Score

Hi-index	0.00

Visualization

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.