Statistical encoding of succinct data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4009 LNCS, Issue , 2006, Pages 294-305

  González, Rodrigo ^a   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); INDEXING (OF INFORMATION); MATHEMATICAL MODELS; RANDOM ACCESS STORAGE; STATISTICAL METHODS;

SELF-INDEXING; STATISTICAL ENCODING; ZIV-LEMPEL COMPRESSION;

DATA STRUCTURES;

EID: 33746093310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780441_27     Document Type: Conference Paper

References (19)

1. T. Bell, J. Cleary, and I. Witten. Text compression. Prentice Hall, 1990.
2. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, 1994.
3. P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan. Structuring labeled trees for optimal succinctness, and beyond. In Proc. 46st FOCS, 2005.
4. P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan. Compressing and searching XML data via two zips. In Proc. 15th WWW'06, 2006.
5. P. Ferragina and G. Manzini. Opportunistic data structures with applications. In Proc. 41st FOCS, pages 390-398, 2000.
6. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. An alphabet-friendly FM-index. In Proc. 11th SPIRE, LNCS 3246, pages 150-160. Springer, 2004.
7. Extended version to appear in ACM TALG.
8. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. 14th SODA, pages 841-850, 2003.
9. R. Kosaraju and G. Manzini. Compression of low entropy strings with Lempel-Ziv algorithms. SIAM Journal on Computing, 29(3):893-911, 1999.
10. V. Mäkinen and G. Navarro. Succinct suffix arrays based on run-length encoding, Nordic Journal of Computing, 12(1):40-66, 2005.
11. G. Manzini. An analysis of the Burrows-Wheeler transform. Journal of the ACM, 48(3):407-430, 2001.
12. I. Munro. Tables. In Proc. 16th FSTTCS, LNCS v. 1180, pages 37-42, 1996.
13. I. Munro, R. Raman, V. Raman, and S. Rao. Succinct representations of permutations. In Proc. 30th ICALP, pages 345-356, 2003.
14. I. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In Proc. 38th FOCS, pages 118-126, 1997.
15. I. Munro and S. S. Rao. Succinct representations of functions. In Proc. 31th ICALP, pages 1006-1015, 2004.
16. G. Navarro. Indexing text using the Ziv-Lempel trie. Journal of Discrete Algorithms (JDA), 2(1):87-114, 2004.
17. R. Raman, V. Raman, and S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. 13th SODA, pages 233-242, 2002.
18. K. Sadakane and R. Grossi, Personal communication, 2005.
19. K. Sadakane and R. Grossi. Squeezing succinct data structures into entropy bounds. In Proc. 17th SODA, pages 1230-1239, 2006.