Dynamic compressed strings with random access

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

Volumn 7965 LNCS, Issue PART 1, 2013, Pages 504-515

  Grossi, Roberto ^a   Raman, Rajeev ^b   Rao, Satti Srinivasa ^c   Venturini, Rossano ^a  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

^c Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM ACCESS; SPACE BOUNDS; SUBSTRING; TIME COMPLEXITY;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

AUTOMATA THEORY;

EID: 84880256192     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39206-1_43     Document Type: Conference Paper

References (21)

1. Barbay, J., He, M., Munro, J.I., Satti, S.R.: Succinct indexes for strings, binary relations and multilabeled trees. ACM Transactions on Algorithms 7, 52 (2011)
2. Brodnik, A., Carlsson, S., Demaine, E.D., Munro, J.I., Sedgewick, R.: Resizable arrays in optimal time and space. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 37-48. Springer, Heidelberg (1999)
3. Dietzfelbinger, M., Karlin, A.R., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput. 23, 738-761 (1994)
4. Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM 57 (2009)
5. Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52, 552-581 (2005)
6. Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theor. Comput. Sci. 372, 115-121 (2007)
7. Fredman, M.L., Saks, M.E.: The cell probe complexity of dynamic data structures. In: STOC, pp. 345-354 (1989)
8. González, R., Navarro, G.: Compressed text indexes with fast locate. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 216-227. Springer, Heidelberg (2007)
9. Grossi, R., Orlandi, A., Raman, R.:Optimal trade-offs for succinct string indexes. In: Abramsky, S.,Gavoille,C.,Kirchner, C.,Meyer auf derHeide, F., Spirakis,P.G. (eds.) ICALP 2010, Part I. LNCS, vol. 6198, pp. 678-689. Springer, Heidelberg (2010)
10. Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Computing 35, 378-407 (2005)
11. Jansson, J., Sadakane, K., Sung, W.-K.: CRAM: Compressed random access memory. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 510-521. Springer, Heidelberg (2012)
12. Manzini, G.: An analysis of the Burrows-Wheeler transform. J. ACM 48, 407-430 (2001)
13. Navarro, G., Nekrich, Y.: Optimal dynamic sequence representations. In: Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (2013)
14. Pagh, R.: A new trade-off for deterministic dictionaries. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 22-31. Springer, Heidelberg (2000)
15. Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51, 122-144 (2004)
16. Pǎtraşcu, M., Demaine, E.D.: Logarithmic lower bounds in the cell-probe model. SIAM J. Comput. 35, 932-963 (2006)
17. Patrascu, M., Viola, E.: Cell-probe lower bounds for succinct partial sums. In: Charikar, M. (ed.) SODA, pp. 117-122. SIAM (2010)
18. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM TALG 3 (2007)
19. Raman, R., Raman, V., Rao, S.S.: Succinct Dynamic Data Structures. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 426-437. Springer, Heidelberg (2001)
20. Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: SODA, pp. 1230-1239. ACM Press (2006)
21. Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: SODA, pp. 134-149 (2010)