Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Boyer–Moore–Horspool_algorithm> ?p ?o }
Showing triples 1 to 40 of
40
with 100 triples per page.
- Boyer–Moore–Horspool_algorithm abstract "In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings. It was published by Nigel Horspool in 1980.It is a simplification of the Boyer–Moore string search algorithm which is related to the Knuth–Morris–Pratt algorithm. The algorithm trades space for time in order to obtain an average-case complexity of O(N) on random text, although it has O(MN) in the worst case, where the length of the pattern is M and the length of the search string is N.".
- Boyer–Moore–Horspool_algorithm wikiPageExternalLink node18.html.
- Boyer–Moore–Horspool_algorithm wikiPageID "1753472".
- Boyer–Moore–Horspool_algorithm wikiPageLength "4391".
- Boyer–Moore–Horspool_algorithm wikiPageOutDegree "16".
- Boyer–Moore–Horspool_algorithm wikiPageRevisionID "670911314".
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Algorithm.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Alphabet_(formal_languages).
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Average-case_complexity.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Best,_worst_and_average_case.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Big_O_notation.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Boyer–Moore_string_search_algorithm.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Category:Articles_with_example_C_code.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Category:String_matching_algorithms.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Computer_science.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Knuth–Morris–Pratt_algorithm.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Nigel_Horspool.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink String_(computer_science).
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Substring.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLink Worst_case.
- Boyer–Moore–Horspool_algorithm wikiPageWikiLinkText "Boyer–Moore–Horspool algorithm".
- Boyer–Moore–Horspool_algorithm wikiPageWikiLinkText "Boyer–Moore–Horspool string search algorithm".
- Boyer–Moore–Horspool_algorithm hasPhotoCollection Boyer–Moore–Horspool_algorithm.
- Boyer–Moore–Horspool_algorithm wikiPageUsesTemplate Template:Disputed_inline.
- Boyer–Moore–Horspool_algorithm wikiPageUsesTemplate Template:Merge_from.
- Boyer–Moore–Horspool_algorithm wikiPageUsesTemplate Template:Mono.
- Boyer–Moore–Horspool_algorithm wikiPageUsesTemplate Template:Reflist.
- Boyer–Moore–Horspool_algorithm subject Category:Articles_with_example_C_code.
- Boyer–Moore–Horspool_algorithm subject Category:String_matching_algorithms.
- Boyer–Moore–Horspool_algorithm comment "In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings. It was published by Nigel Horspool in 1980.It is a simplification of the Boyer–Moore string search algorithm which is related to the Knuth–Morris–Pratt algorithm.".
- Boyer–Moore–Horspool_algorithm label "Boyer–Moore–Horspool algorithm".
- Boyer–Moore–Horspool_algorithm sameAs Algorithme_de_Boyer-Moore-Horspool.
- Boyer–Moore–Horspool_algorithm sameAs m.05t8fw.
- Boyer–Moore–Horspool_algorithm sameAs Алгоритм_Бойера_—_Мура_—_Хорспула.
- Boyer–Moore–Horspool_algorithm sameAs Bojer-Mur-Horspolov_algoritam.
- Boyer–Moore–Horspool_algorithm sameAs Алгоритм_Бойєра_—_Мура_—_Хорспула.
- Boyer–Moore–Horspool_algorithm sameAs Q4060665.
- Boyer–Moore–Horspool_algorithm sameAs Q4060665.
- Boyer–Moore–Horspool_algorithm wasDerivedFrom Boyer–Moore–Horspool_algorithm?oldid=670911314.
- Boyer–Moore–Horspool_algorithm isPrimaryTopicOf Boyer–Moore–Horspool_algorithm.