A simple fast hybrid pattern-matching algorithm

Authors:
Frantisek Franek;Christopher G. Jennings;William F. Smyth
Affiliations:
Algorithms Research Group, Department of Computing & Software, McMaster University, Hamilton, ON, Canada;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada;Algorithms Research Group, Department of Computing & Software, McMaster University, Hamilton, ON, Canada
Venue:
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Year:
2005

Citing 11
Cited 3

A very fast substring search algorithm

Communications of the ACM
On the exact complexity of string matching: lower bounds

SIAM Journal on Computing
Correctness and efficiency of pattern matching algorithms

Information and Computation
On the exact complexity of string matching: upper bounds

SIAM Journal on Computing
Fast string searching

Software—Practice & Experience
Fastest pattern matching in strings

Journal of Algorithms
Tighter Lower Bounds on the Exact Complexity of String Matching

SIAM Journal on Computing
Experimental results on string matching algorithms

Software—Practice & Experience
A fast string searching algorithm

Communications of the ACM
On the exact complexity of string matching

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Tighter bounds on the exact complexity of string matching

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

A simple fast hybrid pattern-matching algorithm

Journal of Discrete Algorithms
Efficient Exact Pattern-Matching in Proteomic Sequences

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Fast matching method for DNA sequences

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the other hand, the Boyer-Moore (BM) algorithm provides near-optimal average-case and best-case behaviour, as well as executing very fast in practice. We describe a simple algorithm that employs the main ideas of KMP and BM (with a little help from Sunday) in an effort to combine these desirable features. Experiments indicate that in practice the new algorithm is among the fastest exact pattern-matching algorithms discovered to date, perhaps dominant for alphabet size 8 or more.