Boyer–Moore string search algorithm
Algoritmo de búsqueda de cadenas Boyer-Moore
- Date
- 1977 · confidence high
- Place
- Menlo Park, California, United States
- Credited to
- Robert S. Boyer y J Strother Moore
- Field
- Knowledge & symbols
What it is
A substring search algorithm that preprocesses the search pattern to skip over sections of the text, matching from the tail of the pattern toward its head; a practical benchmark for text search.
What it led to
- a practical benchmark for text search for decades
- later variants and corrections (Rytter, 1980)
- widespread use in text editors and tools such as grep
- influence on later pattern-search algorithms