Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Boyer–Moore_string_search_algorithm> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Boyer–Moore_string_search_algorithm abstract "In computer science, the Boyer–Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical string search literature. It was developed by Robert S. Boyer and J Strother Moore in 1977. The algorithm preprocesses the string being searched for (the pattern), but not the string being searched in (the text). It is thus well-suited for applications in which the pattern is much shorter than the text or does persist across multiple searches. The Boyer-Moore algorithm uses information gathered during the preprocess step to skip sections of the text, resulting in a lower constant factor than many other string algorithms. In general, the algorithm runs faster as the pattern length increases. The key feature of the algorithm is to match on the tail of the pattern rather than the head, and to skip along the text in jumps of multiple characters rather than searching every single character in the text.".
- Boyer–Moore_string_search_algorithm wikiPageID "684709".
- Boyer–Moore_string_search_algorithm wikiPageRevisionID "604004635".
- Boyer–Moore_string_search_algorithm subject Category:Algorithms_on_strings.
- Boyer–Moore_string_search_algorithm subject Category:Articles_with_example_C_code.
- Boyer–Moore_string_search_algorithm subject Category:Articles_with_example_Java_code.
- Boyer–Moore_string_search_algorithm subject Category:Articles_with_example_Python_code.
- Boyer–Moore_string_search_algorithm subject Category:String_matching_algorithms.
- Boyer–Moore_string_search_algorithm comment "In computer science, the Boyer–Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical string search literature. It was developed by Robert S. Boyer and J Strother Moore in 1977. The algorithm preprocesses the string being searched for (the pattern), but not the string being searched in (the text). It is thus well-suited for applications in which the pattern is much shorter than the text or does persist across multiple searches.".
- Boyer–Moore_string_search_algorithm label "Algorithme de Boyer-Moore".
- Boyer–Moore_string_search_algorithm label "Algoritmo de búsqueda de cadenas Boyer-Moore".
- Boyer–Moore_string_search_algorithm label "Algorytm Boyera i Moore'a".
- Boyer–Moore_string_search_algorithm label "Boyer-Moore-Algorithmus".
- Boyer–Moore_string_search_algorithm label "Boyer-Moore字符串搜索算法".
- Boyer–Moore_string_search_algorithm label "Boyer–Moore string search algorithm".
- Boyer–Moore_string_search_algorithm label "Алгоритм Бойера — Мура".
- Boyer–Moore_string_search_algorithm label "ボイヤー-ムーア文字列検索アルゴリズム".
- Boyer–Moore_string_search_algorithm sameAs Boyer%E2%80%93Moore_string_search_algorithm.
- Boyer–Moore_string_search_algorithm sameAs Boyer-Moore-Algorithmus.
- Boyer–Moore_string_search_algorithm sameAs Algoritmo_de_búsqueda_de_cadenas_Boyer-Moore.
- Boyer–Moore_string_search_algorithm sameAs Algorithme_de_Boyer-Moore.
- Boyer–Moore_string_search_algorithm sameAs Algoritma_Boyer-Moore.
- Boyer–Moore_string_search_algorithm sameAs ボイヤー-ムーア文字列検索アルゴリズム.
- Boyer–Moore_string_search_algorithm sameAs Algorytm_Boyera_i_Moore'a.
- Boyer–Moore_string_search_algorithm sameAs Q895984.
- Boyer–Moore_string_search_algorithm sameAs Q895984.
- Boyer–Moore_string_search_algorithm wasDerivedFrom Boyer–Moore_string_search_algorithm?oldid=604004635.