Skip to content


Combination of Quick-Search and Zhu-Takaoka. It uses the two consecutive characters, after the current window, for computing the occurrence heuristics

Appeared in:

  • [15]: Berry, T., Ravindran, S.: A fast string matching algorithm and experimental results. In: Holub, J., Sim´anek, M. (eds.) Proceedings of the Prague Stringology Club Workshop 1999, Prague, Czech Republic, July 8-9, 1999. pp. 16–28. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University (1999),