Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Suffix_automaton> ?p ?o }
Showing triples 1 to 42 of
42
with 100 triples per page.
- Suffix_automaton abstract "In computer science, a suffix automaton or directed acyclic word graph is a finite automaton that recognizes the set of suffixes of a given string. It can be thought of as a compressed form of the suffix tree, a data structure that efficiently represents the suffixes of the string. For example, a suffix automaton for the string \"suffix\" can be queried for other strings; it will report \"true\" for any of the strings \"suffix\", \"uffix\", \"ffix\", \"fix\", \"ix\" and \"x\", and \"false\" for any other string.The suffix automaton of a set of strings U has at most 2Q − 2 states, where Q is the number of nodes of a prefix-tree representing the strings in U.Suffix automata have applications in approximate string matching.".
- Suffix_automaton thumbnail Suffix_automaton.svg?width=300.
- Suffix_automaton wikiPageID "44050791".
- Suffix_automaton wikiPageLength "3732".
- Suffix_automaton wikiPageOutDegree "14".
- Suffix_automaton wikiPageRevisionID "706186025".
- Suffix_automaton wikiPageWikiLink Approximate_string_matching.
- Suffix_automaton wikiPageWikiLink Category:Finite_automata.
- Suffix_automaton wikiPageWikiLink Category:String_data_structures.
- Suffix_automaton wikiPageWikiLink Computer_science.
- Suffix_automaton wikiPageWikiLink Finite-state_machine.
- Suffix_automaton wikiPageWikiLink GADDAG.
- Suffix_automaton wikiPageWikiLink Lecture_Notes_in_Computer_Science.
- Suffix_automaton wikiPageWikiLink Springer_Science+Business_Media.
- Suffix_automaton wikiPageWikiLink String_(computer_science).
- Suffix_automaton wikiPageWikiLink Substring.
- Suffix_automaton wikiPageWikiLink Suffix_array.
- Suffix_automaton wikiPageWikiLink Suffix_tree.
- Suffix_automaton wikiPageWikiLink File:Suffix_automaton.svg.
- Suffix_automaton wikiPageWikiLinkText "Suffix automaton".
- Suffix_automaton wikiPageWikiLinkText "related data structure".
- Suffix_automaton wikiPageWikiLinkText "suffix automata".
- Suffix_automaton wikiPageWikiLinkText "suffix automaton".
- Suffix_automaton wikiPageUsesTemplate Template:Citation.
- Suffix_automaton wikiPageUsesTemplate Template:Comp-sci-stub.
- Suffix_automaton wikiPageUsesTemplate Template:Math.
- Suffix_automaton wikiPageUsesTemplate Template:Mvar.
- Suffix_automaton wikiPageUsesTemplate Template:Refbegin.
- Suffix_automaton wikiPageUsesTemplate Template:Refend.
- Suffix_automaton wikiPageUsesTemplate Template:Reflist.
- Suffix_automaton subject Category:Finite_automata.
- Suffix_automaton subject Category:String_data_structures.
- Suffix_automaton hypernym Automaton.
- Suffix_automaton comment "In computer science, a suffix automaton or directed acyclic word graph is a finite automaton that recognizes the set of suffixes of a given string. It can be thought of as a compressed form of the suffix tree, a data structure that efficiently represents the suffixes of the string.".
- Suffix_automaton label "Suffix automaton".
- Suffix_automaton sameAs Q19599738.
- Suffix_automaton sameAs 接尾辞オートマトン.
- Suffix_automaton sameAs m.0121svzq.
- Suffix_automaton sameAs Q19599738.
- Suffix_automaton wasDerivedFrom Suffix_automaton?oldid=706186025.
- Suffix_automaton depiction Suffix_automaton.svg.
- Suffix_automaton isPrimaryTopicOf Suffix_automaton.
