Suffix trees on words
From MaRDI portal
Recommendations
Cited in
(26)- Structural properties of the string statistics problem
- Time optimal left to right construction of position trees
- The suffix binary search tree and suffix AVL tree
- A linear time lower bound on McCreight and general updating algorithms for suffix trees
- On-line construction of suffix trees
- Distributed suffix trees
- Suffix tree of alignment: an efficient index for similar data
- Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
- Linear-size suffix tries
- Sparse and truncated suffix trees on variable-length codes
- Fast construction of generalized suffix trees over a very large alphabet
- Faster suffix tree construction with missing suffix links
- Suffix Arrays on Words
- The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
- The virtual suffix tree
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- Reverse engineering of compact suffix trees and links: a novel algorithm
- On-line suffix tree construction with reduced branching
- Faster Suffix Tree Construction with Missing Suffix Links
- scientific article; zbMATH DE number 2052919 (Why is no real title available?)
- Constructing the suffix tree of a tree with a large alphabet
- Balanced suffix trees. (Invited lecture)
- Suffix trees for partial words and the longest common compatible prefix problem
- On-Line Linear-Time Construction of Word Suffix Trees
- On the sorting-complexity of suffix tree construction
- Missing pattern discovery
This page was built for publication: Suffix trees on words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283934)
