Zhu–Takaoka string matching algorithm

On this page

Variant of the Boyer–Moore string search algorithm

We don't have any images related to Zhu–Takaoka string matching algorithm yet.

You can add one yourself here.

We don't have any YouTube videos related to Zhu–Takaoka string matching algorithm yet.

You can add one yourself here.

We don't have any PDF documents related to Zhu–Takaoka string matching algorithm yet.

You can add one yourself here.

We don't have any Books related to Zhu–Takaoka string matching algorithm yet.

You can add one yourself here.

We don't have any archived web articles related to Zhu–Takaoka string matching algorithm yet.

You can submit a link to a page to archive here.

In computer science, the Zhu–Takaoka string matching algorithm is a variant of the Boyer–Moore string-search algorithm. It uses two consecutive text characters to compute the bad-character shift. It is faster when the alphabet or pattern is small, but the skip table grows quickly, slowing the pre-processing phase.

This article incorporates public domain material from Paul E. Black. "Zhu–Takaoka". Dictionary of Algorithms and Data Structures. NIST.
Zhu, Rui Feng; T. Takaoka (1987). "On improving the average case of the Boyer-Moore string matching algorithm". Journal of Information Processing. 10 (3): 173–177. ISSN 0387-6101.
http://www-igm.univ-mlv.fr/~lecroq/string/node20.html