Apostolico-Crochemore

Modification of Knuth-Morris-Prat. It performs at most $3n/2$ characters inspections in the worst case.

Appeared in:

• [6]: Apostolico, A., Crochemore, M.: Optimal canonization of all substrings of a string. Inf. Comput. 95(1), 76–95 (1991), http://dx.doi.org/10.1016/0890-5401(91)90016-U ↗