scientific article; zbMATH DE number 177551

MaRDI QIDQ4037422zbMATH OpenFDO

Authors Wojciech Szpankowski, Philippe Jacquet

Publication date 18 May 1993

zbMATH Keywords

random sequencessuffix treedepthsdigital treeasymptotic properties of compression schemes

Mathematics Subject Classification ID

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

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

(12)

• On suffix tree breadth
• 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 1984548 (Why is no real title available?)
• scientific article; zbMATH DE number 140470 (Why is no real title available?)
• The average profile of suffix trees
• Analysis of the average depth in a suffix tree under a Markov model
• Compact suffix trees resemble PATRICIA tries: limiting distribution of the depth
• A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
• On the height of digital trees and related problems
• Average size of a suffix tree for Markov sources

This page was built for publication:

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