Improved dynamic rank-select entropy-bound structures

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

Volumn 4957 LNCS, Issue , 2008, Pages 374-386

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

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; ENTROPY; TREES (MATHEMATICS); DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

BINARY RELATION; BURROWS WHEELER TRANSFORM; COMPRESSED DATA STRUCTURES; INSERTIONS AND DELETIONS; SEQUENCE LENGTHS; STRUCTURED TEXT; TEXT COLLECTION; ZERO-ORDER ENTROPY; BINARY RELATIONS; COMPRESSED SPACE; CURRENT SOLUTIONS; ENTROPY-BOUND STRUCTURES;

INFORMATION MANAGEMENT; CODES (SYMBOLS);

EID: 43049136244     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78773-0_33     Document Type: Conference Paper

References (18)

1. Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)
2. Chan, H., Hon, W., Lam, T., Sadakane, K.: Compressed indexes for dynamic text collections. ACM TALG 3(2), 21 (2007)
3. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM TALG 3(2) (2007) (article 20)
4. Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theoretical Computer Science 372(1), 115-121 (2007)
5. Foschini, L., Grossi, R., Gupta, A., Vitter, J.: When indexing equals compression: Experiments with compressing suffix arrays and applications. ACM TALG 2(4), 611-639 (2006)
6. González, R., Navarro, G.: Statistical encoding of succinct data structures. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 295-306. Springer, Heidelberg (2006)
7. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th SODA, pp. 841-850 (2003)
8. Hon, W.-K., Sadakane, K., Sung, W.-K.: Succinct data structures for searchable partials sums. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 505-516. Springer, Heidelberg (2003)
9. Lee, S., Park, K.: Dynamic rank-select structures with applications to run-length encoded texts. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 95-106. Springer, Heidelberg (2007)
10. Mäkinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 307-318. Springer, Heidelberg (2006), ftp://ftp.dcc.uchile.cl/pub/ users/ gnavarro/dynamic.ps.gz
11. Mäkinen, V., Navarro, G.: Implicit compression boosting with applications to self-indexing. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 214-226. Springer, Heidelberg (2007)
12. Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. SIAM Journal of Computing 22, 935-948 (1993)
13. Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM 48(3), 407-430 (2001)
14. Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37-42. Springer, Heidelberg (1996)
15. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1) (2007) (article 2)
16. Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th SODA, pp. 233-242 (2002)
17. Raman, R., Rao, S.S.: Succinct dynamic dictionaries and trees. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 357-368. Springer, Heidelberg (2003)
18. Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: Proc. 17th SODA, pp. 1230-1239 (2006)