A Note on the Height of Suffix Trees

DOI10.1137/0221005MaRDI QIDQ3990100zbMATH OpenOpenAlexFDO

Authors Wojciech Szpankowski, Bonita Rais, Luc 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)

Recommendations

• scientific article; zbMATH DE number 177551
• On the height of digital trees and related problems
• Random suffix search trees
• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach

Cited in

(15)

• scientific article; zbMATH DE number 742990 (Why is no real title available?)
• Random suffix search trees
• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
• Uncommon suffix tries
• scientific article; zbMATH DE number 177551 (Why is no real title available?)
• scientific article; zbMATH DE number 1984548 (Why is no real title available?)
• p-suffix sorting as arithmetic coding
• An Analysis of the Height of Tries with Random Weights on the Edges
• Analysis of the average depth in a suffix tree under a Markov model
• Optimization Problems Associated with Manifold-Valued Curves with Applications in Computer Vision
• Geometry-based symbolic approximation for fast sequence matching on manifolds
• On the height of digital trees and related problems
• Variance of the internal profile in suffix trees
• Efficient pattern matching for RNA secondary structures
• The height of the Lyndon tree

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)