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

This article incorporates public domain material from Paul E. Black. "Zhu–Takaoka". Dictionary of Algorithms and Data Structures. NIST.
Zhu, Rui Feng; T. Takaoka (1987). "On improving the average case of the Boyer-Moore string matching algorithm". Journal of Information Processing. 10 (3): 173–177. ISSN 0387-6101.
http://www-igm.univ-mlv.fr/~lecroq/string/node20.html

v t e Strings
String metric	Approximate string matching Bitap algorithm Damerau–Levenshtein distance Edit distance Gestalt pattern matching Hamming distance Jaro–Winkler distance Lee distance Levenshtein automaton Levenshtein distance Wagner–Fischer algorithm
String-searching algorithm	Apostolico–Giancarlo algorithm Boyer–Moore string-search algorithm Boyer–Moore–Horspool algorithm Knuth–Morris–Pratt algorithm Rabin–Karp algorithm Raita algorithm Trigram search Two-way string-matching algorithm Zhu–Takaoka string matching algorithm
Multiple string searching	Aho–Corasick Commentz-Walter algorithm
Regular expression	Comparison of regular-expression engines Regular grammar Thompson's construction Nondeterministic finite automaton
Sequence alignment	BLAST Hirschberg's algorithm Needleman–Wunsch algorithm Smith–Waterman algorithm
Data structure	DAFSA Suffix array Suffix automaton Suffix tree Generalized suffix tree Rope Ternary search tree Trie
Other	Parsing Pattern matching Compressed pattern matching Longest common subsequence Longest common substring Sequential pattern mining Sorting String rewriting systems String operations

This page was last edited on 28 May 2023, at 09:08

From Wikipedia, the free encyclopedia

References