Dynamic rank/select structures with applications to run-length encoded texts

Theoretical Computer Science

Volumn 410, Issue 43, 2009, Pages 4402-4413

  Lee, Sunho ^a   Park, Kunsoo ^a  

^a Seoul National University   (South Korea)

Author keywords

Dynamic rank select structures; Full text index; Run length encoding; Succinct data structures

Indexed keywords

AMORTIZED TIME; E-OPERATIONS; FULL-TEXT INDEX; LARGE ALPHABETS; LEVEL STRUCTURE; RUN LENGTH; RUN-LENGTH ENCODING; SUCCINCT DATA STRUCTURES;

DATA STRUCTURES;

ENCODING (SYMBOLS);

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

References (26)

1. Grossi R., and Vitter J.S. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing 35 2 (2005) 378-407
2. Sadakane K. New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms 48 2 (2003) 294-313
3. P. Ferragina, G. Manzini, Opportunistic data structures with applications, in: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 390-398
4. K. Sadakane, R. Grossi, Squeezing succinct data structures into entropy bounds, in: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 1230-1239
5. Ferragina P., and Venturini R. A simple storage scheme for string achieving entropy bounds. Theoretical Computer Science 372 (2007) 115-121
6. Manzini G. An analysis of the Burrows-Wheeler transform. Journal of ACM 48 3 (2001) 407-430
7. G. Jacobson, Space-efficient static trees and graphs, in: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 549-554
8. D.R. Clark, Compact pat trees, Ph.D. Thesis, Univ. Waterloo, 1998
9. J.I. Munro, Tables, in: Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science, 1996, pp. 37-42
10. R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 233-242
11. A. Golynski, R. Grossi, A. Gupta, R. Raman, S.S. Rao, On the size of succinct indexes, in: Proceedings of the 15th Annual European Symposium on Algorithms, 2007, pp. 371-382
12. M. Patrascu, Succincter, in: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, pp. 305-313
13. 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)
14. R. Grossi, A. Gupta, J.S. Vitter, High-order entropy-compressed text indexes, in: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 841-850
15. W.-K. Hon, K. Sadakane, W.-K. Sung, Breaking a time-and-space barrier in constructing full-text indices, in: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 251-260
16. A. Golynski, J.I. Munro, S.S. Rao, Rank/select operations on large alphabets: a tool for text indexing, in: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 368-373
17. J. Barbay, M. He, J.I. Munro, S.S. Rao, Succinct indexes for strings, binary relations and multi-labeled tree, in: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 680-689
18. V. Mäkinen, G. Navarro, Succinct suffix arrays based on run-length encoding, in: Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching, 2005, pp. 45-56
19. R. Raman, V. Raman, S.S. Rao, Succinct dynamic data structures, in: Proceedings of the 7th International Workshop on Algorithms and Data Structures, 2001, pp. 426-437
20. W.-K. Hon, K. Sadakane, W.-K. Sung, Succinct data structures for searchable partial sums, in: Proceedings of the 14th Annual Symposium on Algorithms and Computation, 2003, pp. 505-516
21. V. Mäkinen, G. Navarro, Dynamic entropy-compressed sequences and full-text indexes, in: Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching, 2006, pp. 306-317
22. A. Gupta, W.-K. Hon, R. Shah, J.S. Vitter, A framework for dynamizing succinct data structures, in: Proceedings of the 34th International Colloquium on Automata, Languages and Programming, 2007, pp. 521-532
23. R. González, G. Navarro, Improved dynamic rank-select entropy-bound structures, in: Proceedings of the 8th Latin American Symposium on Theoretical Informatics, 2008, pp. 374-386
24. S. Lee, K. Park, Dynamic compressed representation of texts with rank/select, in: Proceedings of the 11th Korea-Japan Joint Workshop on Algorithms and Computation, 2008, pp. 131-138
25. H.-L. Chan, W.-K. Hon, T.-W. Lam, Compressed index for a dynamic collection of texts, in: Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, 2004, pp. 445-456
26. Mäkinen V., and Navarro G. Dynamic entropy-compressed sequences and full-text indexes. ACM Transactions on Algorithms 4 3 (2008)