Improving Boyer-Moore-Horspool using machine-words for comparison

Authors:
Ateeq Sharfuddin;Xiaofan Feng
Affiliations:
The George Washington University, Washington, DC;The George Washington University, Washington, DC
Venue:
Proceedings of the 48th Annual Southeast Regional Conference
Year:
2010

Citing 11
Cited 0

Algorithms for string searching

ACM SIGIR Forum
A very fast substring search algorithm

Communications of the ACM
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
Predicting string search speed

Journal of Experimental Algorithmics (JEA)
Analysis of Boyer-Moore-Horspool string-matching heuristic

Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Analysis of Boyer-Moore-type string searching algorithms

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A new string-pattern matching algorithm using partitioning and hashing efficiently

Journal of Experimental Algorithmics (JEA)
Research on a faster algorithm for pattern matching

IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
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
Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe an approach to improve the performance of the Boyer-Moore-Horspool algorithm. Instead of comparing the pattern to the text character by character, we compare the pattern to the text machine-word by machine-word. We show that by comparing machine-words, we can significantly improve performance, particularly for large patterns.