Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Zhu–Takaoka_string_matching_algorithm> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples 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 wikiPageExternalLink citation.cfm?id=50808.
- Zhu–Takaoka_string_matching_algorithm wikiPageExternalLink node20.html.
- Zhu–Takaoka_string_matching_algorithm wikiPageID "3872859".
- Zhu–Takaoka_string_matching_algorithm wikiPageLength "881".
- Zhu–Takaoka_string_matching_algorithm wikiPageOutDegree "5".
- Zhu–Takaoka_string_matching_algorithm wikiPageRevisionID "703459297".
- Zhu–Takaoka_string_matching_algorithm wikiPageWikiLink Boyer–Moore_string_search_algorithm.
- Zhu–Takaoka_string_matching_algorithm wikiPageWikiLink Category:String_matching_algorithms.
- Zhu–Takaoka_string_matching_algorithm wikiPageWikiLink Computer_science.
- Zhu–Takaoka_string_matching_algorithm wikiPageWikiLink Preprocessor.
- Zhu–Takaoka_string_matching_algorithm wikiPageWikiLink Skip_table.
- Zhu–Takaoka_string_matching_algorithm wikiPageWikiLinkText "Zhu–Takaoka string matching algorithm".
- Zhu–Takaoka_string_matching_algorithm wikiPageUsesTemplate Template:Cite_journal.
- Zhu–Takaoka_string_matching_algorithm wikiPageUsesTemplate Template:DADS.
- Zhu–Takaoka_string_matching_algorithm subject Category:String_matching_algorithms.
- Zhu–Takaoka_string_matching_algorithm hypernym Variant.
- Zhu–Takaoka_string_matching_algorithm type Algorithm.
- Zhu–Takaoka_string_matching_algorithm type Redirect.
- 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 Q8071262.
- Zhu–Takaoka_string_matching_algorithm sameAs m.0b4c5l.
- Zhu–Takaoka_string_matching_algorithm sameAs Q8071262.
- Zhu–Takaoka_string_matching_algorithm wasDerivedFrom Zhu–Takaoka_string_matching_algorithm?oldid=703459297.
- Zhu–Takaoka_string_matching_algorithm isPrimaryTopicOf Zhu–Takaoka_string_matching_algorithm.