Zhu–Takaoka string matching algorithm
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
- {{DADS|Zhu–Takaoka|zhuTakaoka}}
- {{cite journal
| first = Rui Feng
| last = Zhu
|author2=T. Takaoka
| year = 1987
| title = On improving the average case of the Boyer-Moore string matching algorithm
| journal = Journal of Information Processing
| volume = 10
| issue = 3
| pages = 173–177
| issn = 0387-6101
| url = http://portal.acm.org/citation.cfm?id=50808
}}
- http://www-igm.univ-mlv.fr/~lecroq/string/node20.html
{{DEFAULTSORT:Zhu-Takaoka string matching algorithm}}
{{Strings}}