Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7878334> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Q7878334 subject Q7019665.
- Q7878334 subject Q8235223.
- Q7878334 subject Q8823550.
- Q7878334 abstract "In computer science, Ukkonen's algorithm is a linear-time, online algorithm for constructing suffix trees, proposed by Esko Ukkonen in 1995.The algorithm begins with an implicit suffix tree containing the first character of the string. Then it steps through the string adding successive characters until the tree is complete. This order addition of characters gives Ukkonen's algorithm its "on-line" property. The original algorithm presented by Peter Weiner proceeded backward from the last character to the first one from the shortest to the longest suffix. A simpler algorithm was found by Edward M. McCreight, going from the longest to the shortest suffix.The naive implementation for generating a suffix tree going forward requires O(n2) or even O(n3) time complexity in big O notation, where n is the length of the string. By exploiting a number of algorithmic techniques, Ukkonen reduced this to O(n) (linear) time, for constant-size alphabets, and O(n log n) in general, matching the runtime performance of the earlier two algorithms.".
- Q7878334 wikiPageExternalLink text-indexing.
- Q7878334 wikiPageExternalLink suffix-trees.
- Q7878334 wikiPageExternalLink ukkonens-suffix-tree-algorithm.html.
- Q7878334 wikiPageExternalLink 414272.
- Q7878334 wikiPageExternalLink suffix.ppt.
- Q7878334 wikiPageExternalLink ukkonen.
- Q7878334 wikiPageExternalLink ukkonens-suffix-tree-construction-part-1.
- Q7878334 wikiPageExternalLink ukkonens-suffix-tree-construction-part-2.
- Q7878334 wikiPageExternalLink ukkonens-suffix-tree-construction-part-3.
- Q7878334 wikiPageExternalLink ukkonens-suffix-tree-construction-part-4.
- Q7878334 wikiPageExternalLink ukkonens-suffix-tree-construction-part-5.
- Q7878334 wikiPageExternalLink ukkonens-suffix-tree-construction-part-6.
- Q7878334 wikiPageWikiLink Q10270906.
- Q7878334 wikiPageWikiLink Q1426863.
- Q7878334 wikiPageWikiLink Q21198.
- Q7878334 wikiPageWikiLink Q269878.
- Q7878334 wikiPageWikiLink Q7019665.
- Q7878334 wikiPageWikiLink Q786431.
- Q7878334 wikiPageWikiLink Q8235223.
- Q7878334 wikiPageWikiLink Q8823550.
- Q7878334 comment "In computer science, Ukkonen's algorithm is a linear-time, online algorithm for constructing suffix trees, proposed by Esko Ukkonen in 1995.The algorithm begins with an implicit suffix tree containing the first character of the string. Then it steps through the string adding successive characters until the tree is complete. This order addition of characters gives Ukkonen's algorithm its "on-line" property.".
- Q7878334 label "Ukkonen's algorithm".