Jump to content

Zhu–Takaoka string matching algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ruud Koot (talk | contribs) at 00:43, 5 December 2011 (copyedit). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

References

  • Public Domain This article incorporates public domain material from Paul E. Black. "Zhu–Takaoka". Dictionary of Algorithms and Data Structures. NIST.
  • Zhu, Rui Feng (1987). "On improving the average case of the Boyer-Moore string matching algorithm". Journal of Information Processing. 10 (3): 173–177. ISSN 0387-6101. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
  • http://www-igm.univ-mlv.fr/~lecroq/string/node20.html
Retrieved from "https://en.wikipedia.org/w/index.php?title=Zhu–Takaoka_string_matching_algorithm&oldid=464132301"