Worst Occurrence Heuristics

Improvement of Horspool. It computes the occurrence heuristics on the positions which leads to the average maximal shift.

Appeared in:

• [23]: Cantone, D., Faro, S.: Improved and self-tuned occurrence heuristics. In: Holub, J., Zd´arek, J. (eds.) Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, September 2-4, 2013. pp. 92–106. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague (2013), http://www.stringology.org/event/2013/p09.html ↗
• [24]: Cantone, D., Faro, S.: Improved and self-tuned occurrence heuristics. J. Discrete Algorithms 28, 73–84 (2014), http://dx.doi.org/10.1016/j.jda.2014.07.006 ↗