Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Aho–Corasick_algorithm> ?p ?o }
Showing triples 1 to 53 of
53
with 100 triples per page.
- Aho–Corasick_algorithm abstract "In computer science, the Aho–Corasick algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick. It is a kind of dictionary-matching algorithm that locates elements of a finite set of strings (the "dictionary") within an input text. It matches all patterns simultaneously. The complexity of the algorithm is linear in the length of the patterns plus the length of the searched text plus the number of output matches. Note that because all matches are found, there can be a quadratic number of matches if every substring matches (e.g. dictionary = a, aa, aaa, aaaa and input string is aaaa).Informally, the algorithm constructs a finite state machine that resembles a trie with additional links between the various internal nodes. These extra internal links allow fast transitions between failed pattern matches (e.g. a search for cat in a trie that does not contain cat, but contains cart, and thus would fail at the node prefixed by ca), to other branches of the trie that share a common prefix (e.g., in the previous case, a branch for attribute might be the best lateral transition). This allows the automaton to transition between pattern matches without the need for backtracking. When the pattern dictionary is known in advance (e.g. a computer virus database), the construction of the automaton can be performed once off-line and the compiled automaton stored for later use. In this case, its run time is linear in the length of the input plus the number of matched entries.The Aho–Corasick string matching algorithm formed the basis of the original Unix command fgrep.".
- Aho–Corasick_algorithm thumbnail Ahocorasick.svg?width=300.
- Aho–Corasick_algorithm wikiPageExternalLink slides04.pdf.
- Aho–Corasick_algorithm wikiPageExternalLink ahoCorasick.html.
- Aho–Corasick_algorithm wikiPageExternalLink aho_corasick.
- Aho–Corasick_algorithm wikiPageID "184607".
- Aho–Corasick_algorithm wikiPageLength "6599".
- Aho–Corasick_algorithm wikiPageOutDegree "14".
- Aho–Corasick_algorithm wikiPageRevisionID "681063502".
- Aho–Corasick_algorithm wikiPageWikiLink Alfred_Aho.
- Aho–Corasick_algorithm wikiPageWikiLink Alfred_V._Aho.
- Aho–Corasick_algorithm wikiPageWikiLink Category:String_matching_algorithms.
- Aho–Corasick_algorithm wikiPageWikiLink Commentz-Walter_algorithm.
- Aho–Corasick_algorithm wikiPageWikiLink Computational_complexity_theory.
- Aho–Corasick_algorithm wikiPageWikiLink Computer_science.
- Aho–Corasick_algorithm wikiPageWikiLink Computer_virus.
- Aho–Corasick_algorithm wikiPageWikiLink Dictionary_of_Algorithms_and_Data_Structures.
- Aho–Corasick_algorithm wikiPageWikiLink Finite-state_machine.
- Aho–Corasick_algorithm wikiPageWikiLink Finite_state_machine.
- Aho–Corasick_algorithm wikiPageWikiLink Grep.
- Aho–Corasick_algorithm wikiPageWikiLink List_of_Unix_commands.
- Aho–Corasick_algorithm wikiPageWikiLink List_of_Unix_programs.
- Aho–Corasick_algorithm wikiPageWikiLink Rabin–Karp_algorithm.
- Aho–Corasick_algorithm wikiPageWikiLink String_searching_algorithm.
- Aho–Corasick_algorithm wikiPageWikiLink Trie.
- Aho–Corasick_algorithm wikiPageWikiLink File:Ahocorasick.svg.
- Aho–Corasick_algorithm wikiPageWikiLinkText "Aho–Corasick algorithm".
- Aho–Corasick_algorithm wikiPageWikiLinkText "Aho–Corasick".
- Aho–Corasick_algorithm hasPhotoCollection Aho–Corasick_algorithm.
- Aho–Corasick_algorithm wikiPageUsesTemplate Template:Clear.
- Aho–Corasick_algorithm wikiPageUsesTemplate Template:Mono.
- Aho–Corasick_algorithm wikiPageUsesTemplate Template:No_footnotes.
- Aho–Corasick_algorithm wikiPageUsesTemplate Template:Reflist.
- Aho–Corasick_algorithm subject Category:String_matching_algorithms.
- Aho–Corasick_algorithm comment "In computer science, the Aho–Corasick algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick. It is a kind of dictionary-matching algorithm that locates elements of a finite set of strings (the "dictionary") within an input text. It matches all patterns simultaneously. The complexity of the algorithm is linear in the length of the patterns plus the length of the searched text plus the number of output matches.".
- Aho–Corasick_algorithm label "Aho–Corasick algorithm".
- Aho–Corasick_algorithm sameAs Algoritmus_Aho-Corasick.
- Aho–Corasick_algorithm sameAs Aho-Corasick-Algorithmus.
- Aho–Corasick_algorithm sameAs Algoritmo_de_búsqueda_de_cadenas_Aho-Corasick.
- Aho–Corasick_algorithm sameAs الگوریتم_تطابق_رشته_آهو-کوراسیک.
- Aho–Corasick_algorithm sameAs Algorithme_dAho-Corasick.
- Aho–Corasick_algorithm sameAs エイホ-コラシック法.
- Aho–Corasick_algorithm sameAs 아호_코라식_알고리즘.
- Aho–Corasick_algorithm sameAs Algorytm_Aho-Corasick.
- Aho–Corasick_algorithm sameAs Algoritmo_de_Aho-Corasick.
- Aho–Corasick_algorithm sameAs Алгоритм_Ахо_—_Корасик.
- Aho–Corasick_algorithm sameAs Ахо-Коразик_алгоритам_подударности_ниски.
- Aho–Corasick_algorithm sameAs Алгоритм_Ахо_—_Корасік.
- Aho–Corasick_algorithm sameAs Q402342.
- Aho–Corasick_algorithm sameAs Q402342.
- Aho–Corasick_algorithm wasDerivedFrom Aho–Corasick_algorithm?oldid=681063502.
- Aho–Corasick_algorithm depiction Ahocorasick.svg.
- Aho–Corasick_algorithm isPrimaryTopicOf Aho–Corasick_algorithm.