Tuning the boyer‐moore‐horspool string searching algorithm
Timo Raita · Software Practice and Experience · 1992
Abstract Substring search is a common activity in computing. The fastest known search method is that of Boyer and Moore with the improvements introduced by Horspool. This paper presents a new implementation which takes advantage of the dependencies between the characters. The resulting code runs 25 per cent faster than the best currently‐known routine.