A multiple sliding windows approach to speed up string matching algorithms

Authors:
Simone Faro;Thierry Lecroq
Affiliations:
Università di Catania, Catania, Italy;LITIS EA 4108, Université de Rouen, Mont-Saint-Aignan Cedex, France
Venue:
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Year:
2012

Citing 7
Cited 0

Fast text searching: allowing errors

Communications of the ACM
A fast string searching algorithm

Communications of the ACM
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Fast exact string matching algorithms

Information Processing Letters
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Bit-(parallelism)2: getting to the next level of parallelism

FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Bit-parallel search algorithms for long patterns

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a general approach to string matching based on multiple sliding text-windows, and show how it can be applied to some among the most efficient algorithms for the problem based on nondeterministic automata and comparison of characters. From our experimental results it turns out that the new multiple sliding windows approach leads to algorithms which obtain better results than the original ones when searching texts over relatively large alphabets. Best improvements are obtained especially for short patterns.