Asymptotic properties of data compression and suffix trees

DOI10.1109/18.259648zbMATH Open0802.94007OpenAlexW2035281110MaRDI QIDQ4307377FDOQ4307377

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

Recommendations

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

zbMATH Keywords

asymptotic analysissuffix treeuniversal data compressionLempel-Ziv parsing algorithmrepeated subwords

Mathematics Subject Classification ID

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

Cited In (13)

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

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)