Boyer-Moore

Introduces the sliding window approach and the scanning of the window from right to left. It works in $O(nm)$-time. It uses the occurrence and the good-suffix heuristics. It derives from Brute-Force

Appeared in:

• [18]: Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762–772 (1977), http://doi.acm.org/10.1145/359842.359859 ↗