Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q19599738> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- Q19599738 subject Q8819517.
- Q19599738 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.".
- Q19599738 thumbnail Suffix_automaton.svg?width=300.
- Q19599738 wikiPageWikiLink Q1426863.
- Q19599738 wikiPageWikiLink Q176452.
- Q19599738 wikiPageWikiLink Q176916.
- Q19599738 wikiPageWikiLink Q1798621.
- Q19599738 wikiPageWikiLink Q184754.
- Q19599738 wikiPageWikiLink Q21198.
- Q19599738 wikiPageWikiLink Q2626534.
- Q19599738 wikiPageWikiLink Q281472.
- Q19599738 wikiPageWikiLink Q5512804.
- Q19599738 wikiPageWikiLink Q8819517.
- Q19599738 wikiPageWikiLink Q924044.
- Q19599738 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.".
- Q19599738 label "Suffix automaton".
- Q19599738 depiction Suffix_automaton.svg.