A simple storage scheme for strings achieving entropy bounds

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 690-696

  Ferragina, Paolo ^a   Venturini, Rossano ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS;

BINARY ENCODINGS; BURROWS WHEELER TRANSFORM; ENTROPY BOUND; STORAGE SCHEMES; SUBSTRING; TRADE OFF;

ENTROPY;

EID: 84969264267     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. P. Bro Miltersen. Lower bounds on the size of selection and rank indexes. In Procs ACM-SIAM SODA, 11-12, 2005.
2. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, 1994.
3. J. Barbay, J. I. Munro, M. He and S. S. Rao. Succinct indexes for strings, binary relations and multi-labeled trees. In Procs ACM-SIAM SODA, 2007 (this volume).
4. P. Ferragina, R. Giancarlo, G. Manzini, and M. Sciortino. Boosting textual compression in optimal linear time. Journal of the ACM, 52(4):688-713, 2005.
5. P. Ferragina and G. Manzini. Indexing compressed text. Journal of the ACM, 52(4):552-581, 2005.
6. A. Golynski. Optimal lower bounds for rank and select indexes. In Procs ICALP, LNCS 4051, 370-381, 2006.
7. R. González and G. Navarro. Statistical encoding of succinct data structures. In Procs CPM, LNCS 4009, 295-306, 2006.
8. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Procs ACMSIAM SODA, 841-850, 2003.
9. J. Jansson, K. Sadakane, and K.K. Sung. Ultrasuccinct representation of ordered trees. In Procs ACM-SIAM SODA, 2007 (this volume).
10. G. Manzini. An analysis of the Burrows-Wheeler transform. Journal of the ACM, 48(3):407-430, 2001.
11. I. Munro. Tables. In Procs FST-TCS, LNCS 1180, 37-42, 1996.
12. G. Navarro and V. Mäkinen. Compressed full-text indexes. Technical Report TR/DCC-2006-6, Dept. of Computer Science, University of Chile, April 2006.
13. R. Raman, V. Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding kary trees and multisets. In Procs ACM-SIAM SODA, 233-242, 2002.
14. K. Sadakane and R. Grossi. Squeezing succinct data structures into entropy bounds. In Procs ACM-SIAM SODA, 1230-1239, 2006.
15. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, Los Altos, CA 94022, USA, second edition, 1999.
16. J. Ziv and A. Lempel. Compression of individual sequences via variable length coding. IEEE Transaction on Information Theory, 24:530-536, 1978.