On improving the worst case running time of the Boyer-Moore string matching algorithm

Authors:
Zvi Galil
Affiliations:
Tel-Aviv Univ., Tel-Aviv, Israel
Venue:
Communications of the ACM
Year:
1979

Citing 2
Cited 22

A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
A fast string searching algorithm

Communications of the ACM

A technique for two-dimensional pattern matching

Communications of the ACM - Special issue: multiprocessing
Algorithms for string searching

ACM SIGIR Forum
Two-way string-matching

Journal of the ACM (JACM)
Tight bounds on the complexity of the Boyer-Moore string matching algorithm

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
The Suffix of a square matrix, with applications

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Analysis of Boyer-Moore-type string searching algorithms

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Approximate String Matching

ACM Computing Surveys (CSUR)
Technical correspondence

Communications of the ACM
Content management on server farm with layer-7 routing

Proceedings of the 2002 ACM symposium on Applied computing
Unstructured data bases or very efficient text searching

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
The Design of Efficient Algorithms for Two-Dimensional Pattern Matching

IEEE Transactions on Knowledge and Data Engineering
On the Complexity of Determining the Period of a String

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Time-space-optimal string matching (Preliminary Report)

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A unifying look at the Apostolico--Giancarlo string-matching algorithm

Journal of Discrete Algorithms
Polymorphic string matching

Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
System support for web hosting services on server clusters

Computers and Electrical Engineering
A simple fast hybrid pattern-matching algorithm

Journal of Discrete Algorithms
Periodicity and repetitions in parameterized strings

Discrete Applied Mathematics
New Perspectives on the Prefix Array

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
On the size of Boyer-Moore automata

Theoretical Computer Science
Realizing a sub-linear time string-matching algorithm with a hardware accelerator using bloom filters

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Improving Boyer-Moore-Horspool using machine-words for comparison

Proceedings of the 48th Annual Southeast Regional Conference

Quantified Score

Hi-index	48.24

Visualization

Abstract

It is shown how to modify the Boyer-Moore string matching algorithm so that its worst case running time is linear even when multiple occurrences of the pattern are present in the text.