Asymptotic properties of data compression and suffix trees

DOI10.1109/18.259648MaRDI QIDQ4307377zbMATH OpenOpenAlexFDO

Authors Wojciech Szpankowski

Publication date 3 October 1994

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic analysissuffix treeuniversal data compressionLempel-Ziv parsing algorithmrepeated subwords

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 742990
• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
• scientific article; zbMATH DE number 177551
• A Note on the Height of Suffix Trees

Cited in

(13)

• Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
• A new method for approximate indexing and dictionary lookup with one error
• scientific article; zbMATH DE number 2127733 (Why is no real title available?)
• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
• Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
• The asymptotics of waiting times between stationary processes, allowing distortion
• Suffix-sorting via Shannon-Fano-Elias codes
• Uncommon suffix tries
• Stochastic sub-additivity approach to the conditional large deviation principle
• Disk compression of \(k\)-mer sets
• Optimal encoding of non-stationary sources
• Text indexing with errors
• A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors

This page was built for publication: Asymptotic properties of data compression and suffix trees

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