Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Zhu–Takaoka_string_matching_algorithm> ?p ?o. }
Showing items 1 to 10 of
10
with 100 items per page.
- Zhu–Takaoka_string_matching_algorithm abstract "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.".
- Zhu–Takaoka_string_matching_algorithm wikiPageID "3872859".
- Zhu–Takaoka_string_matching_algorithm wikiPageRevisionID "551307556".
- Zhu–Takaoka_string_matching_algorithm subject Category:String_matching_algorithms.
- Zhu–Takaoka_string_matching_algorithm comment "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.".
- Zhu–Takaoka_string_matching_algorithm label "Zhu–Takaoka string matching algorithm".
- Zhu–Takaoka_string_matching_algorithm sameAs Zhu%E2%80%93Takaoka_string_matching_algorithm.
- Zhu–Takaoka_string_matching_algorithm sameAs Q8071262.
- Zhu–Takaoka_string_matching_algorithm sameAs Q8071262.
- Zhu–Takaoka_string_matching_algorithm wasDerivedFrom Zhu–Takaoka_string_matching_algorithm?oldid=551307556.