Pages that link to "Item:Q3990100"
From MaRDI portal
The following pages link to A Note on the Height of Suffix Trees (Q3990100):
Displaying 10 items.
- Efficient pattern matching for RNA secondary structures (Q500967) (← links)
- On the height of digital trees and related problems (Q922689) (← links)
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach (Q1328400) (← links)
- Geometry-based symbolic approximation for fast sequence matching on manifolds (Q1800026) (← links)
- \(p\)-suffix sorting as arithmetic coding (Q1932361) (← links)
- An Analysis of the Height of Tries with Random Weights on the Edges (Q3512599) (← links)
- Random suffix search trees (Q4446869) (← links)
- Optimization Problems Associated with Manifold-Valued Curves with Applications in Computer Vision (Q4556988) (← links)
- (Q4763430) (← links)
- Uncommon suffix tries (Q5175232) (← links)