A Note on the Height of Suffix Trees
From MaRDI portal
Recommendations
Cited in
(17)- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
- Geometry-based symbolic approximation for fast sequence matching on manifolds
- p-suffix sorting as arithmetic coding
- An Analysis of the Height of Tries with Random Weights on the Edges
- scientific article; zbMATH DE number 177551 (Why is no real title available?)
- scientific article; zbMATH DE number 503334 (Why is no real title available?)
- Asymptotic properties of data compression and suffix trees
- scientific article; zbMATH DE number 1984548 (Why is no real title available?)
- Random suffix search trees
- Optimization Problems Associated with Manifold-Valued Curves with Applications in Computer Vision
- Variance of the internal profile in suffix trees
- scientific article; zbMATH DE number 742990 (Why is no real title available?)
- Efficient pattern matching for RNA secondary structures
- Uncommon suffix tries
- Analysis of the average depth in a suffix tree under a Markov model
- The height of the Lyndon tree
- On the height of digital trees and related problems
This page was built for publication: A Note on the Height of Suffix Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990100)