A simple storage scheme for strings achieving entropy bounds

Theoretical Computer Science

Volumn 372, Issue 1, 2007, Pages 115-121

  Ferragina, Paolo ^a   Venturini, Rossano ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Data compression; Data structures for strings

Indexed keywords

ALGORITHMS; DATA COMPRESSION; DATA STRUCTURES; ENCODING (SYMBOLS); ENTROPY;

BLOCK SORTING; BURROWS-WHEELER TRANSFORM; EMPIRICAL ENTROPY;

SET THEORY;

EID: 33846895874     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.12.012     Document Type: Article

References (16)

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