A simple fast hybrid pattern-matching algorithm

Authors:
Frantisek Franek;Christopher G. Jennings;W. F. Smyth
Affiliations:
Algorithms Research Group, Department of Computing & Software, McMaster University, Hamilton ON L8S 4K1, Canada;School of Computing Science, Simon Fraser University, 8888 University Drive, Burnaby BC V5A 1S6, Canada;Algorithms Research Group, Department of Computing & Software, McMaster University, Hamilton ON L8S 4K1, Canada and School of Computing, Curtin University, GPO Box U1987, Perth WA 6845, Australia
Venue:
Journal of Discrete Algorithms
Year:
2007

Citing 17
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
A new approach to text searching

Communications of the ACM
Fast text searching: allowing errors

Communications of the ACM
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
On improving the worst case running time of the Boyer-Moore string matching algorithm

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 pattern-matching on indeterminate strings

Journal of Discrete Algorithms
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

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching

Fast pattern-matching on indeterminate strings

Journal of Discrete Algorithms
Assessment of advanced cryptographic antiviral techniques

International Journal of Electronic Security and Digital Forensics
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

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, apparently dominant for alphabet size above 15-20.