Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Boyer–Moore–Horspool_algorithm> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items 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 wikiPageID "1753472".
- Boyer–Moore–Horspool_algorithm wikiPageRevisionID "585183701".
- 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 label "Алгоритм Бойера — Мура — Хорспула".
- Boyer–Moore–Horspool_algorithm sameAs Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm.
- Boyer–Moore–Horspool_algorithm sameAs Q4060665.
- Boyer–Moore–Horspool_algorithm sameAs Q4060665.
- Boyer–Moore–Horspool_algorithm wasDerivedFrom Boyer–Moore–Horspool_algorithm?oldid=585183701.