Zhu-Takaoka

From Wikipedia, the free encyclopedia

Zhu-Takaoka is a string matching algorithm that 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.

[edit] References

• Paul E. Black, Zhu-Takaoka at the NIST Dictionary of Algorithms and Data Structures.
• 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