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 grows quickly, slowing the pre-processing phase.
- Comment
- enIn 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 grows quickly, slowing the pre-processing phase.
- Has abstract
- enIn 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 grows quickly, slowing the pre-processing phase.
- Hypernym
- Variant
- Is primary topic of
- Zhu–Takaoka string matching algorithm
- Label
- enZhu–Takaoka string matching algorithm
- Link from a Wikipage to an external page
- portal.acm.org/citation.cfm%3Fid=50808
- www-igm.univ-mlv.fr/~lecroq/string/node20.html
- Link from a Wikipage to another Wikipage
- Boyer–Moore string search algorithm
- Category:String matching algorithms
- Computer science
- Pre-processing
- Skip table
- SameAs
- 4xcwN
- m.0b4c5l
- Q8071262
- Subject
- Category:String matching algorithms
- WasDerivedFrom
- Zhu–Takaoka string matching algorithm?oldid=703459297&ns=0
- WikiPageLength
- 881
- Wikipage page ID
- 3872859
- Wikipage revision ID
- 703459297
- WikiPageUsesTemplate
- Template:Cite journal
- Template:DADS