A Note on the Height of Suffix Trees

DOI10.1137/0221005zbMath0743.68073OpenAlexW1966552686MaRDI QIDQ3990100

Bonita Rais, Wojciech Szpankowski, Luc P. Devroye

Publication date: 28 June 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e94fb4c26bc1325c8421a27af66e9af14d0c7a4e

zbMATH Keywords

suffix treetrie hashingstrong convergence algorithms on words

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (7)

Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach ⋮ Optimization Problems Associated with Manifold-Valued Curves with Applications in Computer Vision ⋮ \(p\)-suffix sorting as arithmetic coding ⋮ An Analysis of the Height of Tries with Random Weights on the Edges ⋮ Efficient pattern matching for RNA secondary structures ⋮ Uncommon suffix tries ⋮ Geometry-based symbolic approximation for fast sequence matching on manifolds

This page was built for publication: A Note on the Height of Suffix Trees