Bounded Boyer-Moore

Improvement of Boyer-Moore using a bounded good-suffix heuristics with constant extra space.

Appeared in:

• [20]: Cantone, D., Cristofaro, S., Faro, S.: A space-efficient implementation of the goodsuffix heuristic. In: Holub, J., Zd´arek, J. (eds.) Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010. pp. 63–75. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague (2010), http://www.stringology.org/event/2010/p06.html ↗