Reverse-Factor

Combination of Deterministic-Finite-Automaton and Boyer-Moore. It uses the suffix automaton of the reverse of the pattern. It works in $O(nm)$ worst case time.

Appeared in:

• [77]: Lecroq, T.: A variation on the boyer-moore algorithm. Theor. Comput. Sci. 92(1), 119–144 (1992), http://dx.doi.org/10.1016/0304-3975(92)90139-7 ↗