Zhu–Takaoka String Matching Algorithm
   HOME

TheInfoList



OR:

In
computer science Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to practical disciplines (includi ...
, 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

* * *http://www-igm.univ-mlv.fr/~lecroq/string/node20.html {{Strings String matching algorithms