Rank/select on dynamic compressed sequences and applications

Theoretical Computer Science

Volumn 410, Issue 43, 2009, Pages 4414-4422

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

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Compressed data structures; Empirical entropy; Text indexing

Indexed keywords

ALPHABET SIZE; AMORTIZED TIME; BINARY RELATION; BURROWS WHEELER TRANSFORM; COMPRESSED DATA STRUCTURES; EMPIRICAL ENTROPY; INSERTIONS AND DELETIONS; ON DYNAMICS; PARTIAL SUMS; SEQUENCE LENGTHS; STRUCTURED TEXT; SUFFIX ARRAYS; TEXT COLLECTION; TEXT INDEXING; ZERO-ORDER ENTROPY;

BINARY TREES; ENTROPY; GRAPH THEORY;

INDEXING (OF INFORMATION);

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

References (30)

1. J. Barbay, A. Golynski, I. Munro, S. Rao, Adaptive searching in succinctly encoded binary relations and tree-structured documents, in: Proc. 17th CPM, 2006, pp. 24-35
2. J. Barbay, M. He, I. Munro, S. Rao, Succinct indexes for strings, binary relations and multi-labeled trees, in: Proc. 18th SODA, 2007, pp. 680-689
3. D. Blandford, G. Blelloch, Compact representations of ordered sets, in: Proc. 15th SODA, 2004, pp. 11-19
4. M. Burrows, D. Wheeler, A block sorting lossless data compression algorithm, Tech. Rep. 124, Digital Equipment Corporation, 1994
5. Chan H., Hon W., Lam T., and Sadakane K. Compressed indexes for dynamic text collections. ACM Transactions on Algorithms 3 2 (2007) 21
6. Chan H.-L., Hon W.-K., and Lam T.-W. Compressed index for a dynamic collection of texts. Proc. 15th Annual Symposium on Combinatorial Pattern Matching. CPM. LNCS vol. 3109 (2004) 445-456
7. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. vol. second ed. (2001), MIT Press and McGraw-Hill
8. Ferragina P., Manzini G., Mäkinen V., and Navarro G. Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms 3 2 (2007) article 20
9. Ferragina P., and Venturini R. A simple storage scheme for strings achieving entropy bounds. Theoretical Computer Science 372 1 (2007) 115-121
10. Foschini L., Grossi R., Gupta A., and Vitter J. When indexing equals compression: Experiments with compressing suffix arrays and applications. ACM Transactions on Algorithms 2 4 (2006) 611-639
11. M. Fredman, M. Saks, The cell probe complexity of dynamic data structures, in: Proc. 43th ACM STOC, 1989, pp. 345-354
12. A. Golynski, I. Munro, S. Rao, Rank/select operations on large alphabets: A tool for text indexing, in: Proc. 17th SODA, 2006, pp. 368-373
13. González R., and Navarro G. Statistical encoding of succinct data structures. Proc. 17th CPM. LNCS vol. 4009 (2006) 295-306
14. R. Grossi, A. Gupta, J. Vitter, High-order entropy-compressed text indexes, in: Proc. 14th SODA, 2003, pp. 841-850
15. A. Gupta, W.-K. Hon, R. Shah, J.S. Vitter, A framework for dynamizing succinct data structures, in: Proc. 34th ICALP, 2007, pp. 521-532
16. W.-K. Hon, T.-W. Lam, K. Sadakane, W.-K. Sung, S.-M. Yiu, A space and time efficient algorithm for constructing compressed suffix arrays, Algorithmica 48 (1)
17. Hon W.-K., Sadakane K., and Sung W.-K. Succinct data structures for searchable partials sums. Proc. 14th ISAAC. LNCS vol. 2906 (2003) 505-516
18. J. Kärkkäinen, Fast BWT in small space by blockwise suffix sorting, in: Proc. DIMACS Workshop on the Burrows-Wheeler Transform: Ten Years Later, 2004
19. Lee S., and Park K. Dynamic rank-select structures with applications to run-length encoded texts. Proc. 18th CPM. LNCS vol. 4580 (2007) 95-106
20. Mäkinen V., and Navarro G. Dynamic entropy-compressed sequences and full-text indexes. ACM Transactions on Algorithms 4 3 (2008) article 32
21. Mäkinen V., and Navarro G. Implicit compression boosting with applications to self-indexing. Proc. 14th SPIRE. LNCS vol. 4726 (2007) 214-226
22. Manber U., and Myers G. Suffix arrays: A new method for on-line string searches. SIAM Journal of Computing 22 (1993) 935-948
23. Manzini G. An analysis of the Burrows-Wheeler transform. Journal of the ACM 48 3 (2001) 407-430
24. Munro I. Tables. Proc. 16th FSTTCS. LNCS vol. 1180 (1996) 37-42
25. Navarro G., and Mäkinen V. Compressed full-text indexes. ACM Computing Surveys 39 1 (2007) article 2
26. Patrascu M., and Demaine E. Logarithmic lower bounds in the cell probe model. SIAM Journal on Computing 35 4 (2006) 932-963
27. Puglisi S., Smyth W., and Turpin A. A taxonomy of suffix array construction algorithms. ACM Computing Surveys 39 2 (2007) article 4
28. R. Raman, V. Raman, S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: Proc. 13th SODA, 2002, pp. 233-242
29. Raman R., and Rao S.S. Succinct dynamic dictionaries and trees. Proc. 30th ICALP. LNCS vol. 2719 (2003) 357-368
30. K. Sadakane, R. Grossi, Squeezing succinct data structures into entropy bounds, in: Proc. 17th SODA, 2006, pp. 1230-1239