A very fast substring search algorithm

1 August 1990

journal article
Published by Association for Computing Machinery (ACM) in Communications of the ACM

Vol. 33 (8), 132-142
https://doi.org/10.1145/79173.79184

Abstract

This article describes a substring search algorithm that is faster than the Boyer-Moore algorithm. This algorithm does not depend on scanning the pattern string in any particular order. Three variations of the algorithm are given that use three different pattern scan orders. These include: (1) a “Quick Search” algorithm; (2) a “Maximal Shift” and (3) an “Optimal Mismatch” algorithm.

Keywords

OPTIMAL
SUBSTRING SEARCH
SEARCH ALGORITHM
SCAN ORDERS
MAXIMAL SHIFT
MOORE ALGORITHM
PATTERN STRING
BOYER MOORE
FASTER THAN

This publication has 1 reference indexed in Scilit:

A fast string searching algorithm
Communications of the ACM, 1977

Cited by 219 articles