Fast-search: a new efficient variant of the Boyer-Moore string matching algorithm

Authors:
Domenico Cantone;Simone Faro
Affiliations:
Università di Catania, Dipartimento di Matematica e Informatica, Catania, Italy;Università di Catania, Dipartimento di Matematica e Informatica, Catania, Italy
Venue:
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Year:
2003

Citing 4
Cited 4

A very fast substring search algorithm

Communications of the ACM
Average running time of the Boyer-Moore-Horspool algorithm

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Fast string searching

Software—Practice & Experience
A fast string searching algorithm

Communications of the ACM

Fast exact string matching algorithms

Information Processing Letters
An aggressive algorithm for multiple string matching

Information Processing Letters
RSMA matching algorithm for searching biological sequences

IIT'09 Proceedings of the 6th international conference on Innovations in information technology
The exact online string matching problem: A review of the most recent results

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new variant of the Boyer-Moore string matching algorithm which, though not linear, is very fast in practice. We compare our algorithm with the Horspool, Quick Search, Tuned Boyer-Moore, and Reverse Factor algorithms, which are among the fastest string matching algorithms for practical uses. It turns out that our algorithm achieve very good results in terms of both time efficiency and number of character inspections, especially in the cases in which the patterns are very short.