What can we learn about suffix trees from independent tries!

DOI10.1007/BFB0028265MaRDI QIDQ4037422zbMATH OpenFDO

Authors Wojciech Szpankowski, Philippe Jacquet

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028265

zbMATH Keywords

asymptotic properties of compression schemesdepthsdigital treerandom sequencessuffix tree

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Information theory (general) (94A15)

Recommendations

• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
• Random suffix search trees
• A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
• A Note on the Height of Suffix Trees
• Compact suffix trees resemble PATRICIA tries: limiting distribution of the depth

Cited in

(14)

• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
• Compact suffix trees resemble PATRICIA tries: limiting distribution of the depth
• A Note on the Height of Suffix Trees
• Digital data structures and order statistics
• A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
• Asymptotic properties of data compression and suffix trees
• scientific article; zbMATH DE number 1984548 (Why is no real title available?)
• Random suffix search trees
• Average size of a suffix tree for Markov sources
• On suffix tree breadth
• Uncommon suffix tries
• The average profile of suffix trees
• Analysis of the average depth in a suffix tree under a Markov model
• On the height of digital trees and related problems

This page was built for publication: What can we learn about suffix trees from independent tries!

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037422)