Jump to content
Wikipedia The Free Encyclopedia

Zhu–Takaoka string matching algorithm

From Wikipedia, the free encyclopedia

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

[edit ]


String metric
String-searching algorithm
Multiple string searching
Regular expression
Sequence alignment
Data structure
Other

AltStyle によって変換されたページ (->オリジナル) /