Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Boyer%E2%80%93Moore_string_search_algorithm> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Boyer%E2%80%93Moore_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 where it persists 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%E2%80%93Moore_string_search_algorithm wikiPageExternalLink the_boost_algorithm_library.Searching.BoyerMoore.
- Boyer%E2%80%93Moore_string_search_algorithm wikiPageExternalLink CHPZ95.ps.
- Boyer%E2%80%93Moore_string_search_algorithm wikiPageExternalLink fstrpos-example.html.
- Boyer%E2%80%93Moore_string_search_algorithm wikiPageExternalLink fstrpos.pdf.
- Boyer%E2%80%93Moore_string_search_algorithm wikiPageID "684709".
- Boyer%E2%80%93Moore_string_search_algorithm wikiPageRevisionID "644719744".
- Boyer%E2%80%93Moore_string_search_algorithm hasPhotoCollection Boyer–Moore_string_search_algorithm.
- Boyer%E2%80%93Moore_string_search_algorithm subject Category:Algorithms_on_strings.
- Boyer%E2%80%93Moore_string_search_algorithm subject Category:Articles_with_example_C_code.
- Boyer%E2%80%93Moore_string_search_algorithm subject Category:Articles_with_example_Java_code.
- Boyer%E2%80%93Moore_string_search_algorithm subject Category:Articles_with_example_Python_code.
- Boyer%E2%80%93Moore_string_search_algorithm subject Category:String_matching_algorithms.
- Boyer%E2%80%93Moore_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 where it persists across multiple searches.".
- Boyer%E2%80%93Moore_string_search_algorithm label "Algorithme de Boyer-Moore".
- Boyer%E2%80%93Moore_string_search_algorithm label "Algoritma Boyer-Moore".
- Boyer%E2%80%93Moore_string_search_algorithm label "Algoritmo de búsqueda de cadenas Boyer-Moore".
- Boyer%E2%80%93Moore_string_search_algorithm label "Algoritmo di Boyer-Moore".
- Boyer%E2%80%93Moore_string_search_algorithm label "Algorytm Boyera i Moore'a".
- Boyer%E2%80%93Moore_string_search_algorithm label "Boyer-Moore-Algorithmus".
- Boyer%E2%80%93Moore_string_search_algorithm label "Boyer–Moore string search algorithm".
- Boyer%E2%80%93Moore_string_search_algorithm label "Алгоритм Бойера — Мура".
- Boyer%E2%80%93Moore_string_search_algorithm label "ボイヤー-ムーア文字列検索アルゴリズム".
- Boyer%E2%80%93Moore_string_search_algorithm sameAs m.032scq.
- Boyer%E2%80%93Moore_string_search_algorithm wasDerivedFrom Boyer–Moore_string_search_algorithm?oldid=644719744.
- Boyer%E2%80%93Moore_string_search_algorithm isPrimaryTopicOf Boyer–Moore_string_search_algorithm.