CRAM: Compressed Random Access Memory

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

Volumn 7391 LNCS, Issue PART 1, 2012, Pages 510-521

  Jansson, Jesper ^a   Sadakane, Kunihiko ^b   Sung, Wing Kin ^c  

^a KYOTO UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY POSITIONS; COMPRESSED FILES; INSERTIONS AND DELETIONS; RANDOM ACCESS MEMORY; SUB-STRINGS; TIME SPENT;

COMPRESSION RATIO (MACHINERY); DATA COMPRESSION; ENTROPY;

AUTOMATA THEORY;

EID: 84880299053     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31594-7_43     Document Type: Conference Paper

References (19)

1. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Interscience (1991)
2. Ferragina, P., Manzini, G.: Indexing compressed text. Journal of the ACM 52(4), 552-581 (2005)
3. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms 3(2), article No. 20 (2007)
4. Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theoretical Computer Science 372(1), 115-121 (2007)
5. Fredman, M.L., Saks, M.E.: The cell probe complexity of dynamic data structures. In: Proceedings of ACM STOC, pp. 345-354 (1989)
6. González, R., Navarro, G.: Statistical Encoding of Succinct Data Structures. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 294-305. Springer, Heidelberg (2006) (Pubitemid 44071995)
7. González, R., Navarro, G.: Rank/select on dynamic compressed sequences and applications. Theoretical Computer Science 410(43), 4414-4422 (2009)
8. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of ACM-SIAM SODA, pp. 841-850 (2003)
9. Hagerup, T.: Sorting and searching on the word RAM. In: Proceedings of Symposium on Theory Aspects of Computer Science (STACS 1998), pp. 366-398 (1998)
10. Hagerup, T., Raman, R.: An Efficient Quasidictionary. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 1-18. Springer, Heidelberg (2002)
11. He, M., Munro, J.I.: Succinct Representations of Dynamic Strings. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 334-346. Springer, Heidelberg (2010)
12. Kosaraju, S.R., Manzini, G.: Compression of low entropy strings with Lempel-Ziv algorithms. SIAM Journal on Computing 29(3), 893-911 (1999)
13. Mäkinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. ACM Transactions on Algorithms 4(3), article No. 32 (2008)
14. Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM 48(3), 407-430 (2001)
15. Navarro, G., Sadakane, K.: Fully-functional static and dynamic succinct trees. Submitted for Journal Publication (2010), http://arxiv.org/abs/0905.0768;
16. A preliminary version appeared in Proc. ACM-SIAM SODA, pp. 134-149 (2010)
17. 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)
18. Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: Proceedings of ACM-SIAM SODA, pp. 1230-1239 (2006)
19. Simpson, J.T., Wong, K., Jackman, S.D., Schein, J.E., Jones, S.J.M., Birol, İ.: ABySS: A parallel assembler for short read sequence data. Genome Research 19(6), 1117-1123 (2009), http://dx.doi.org/10.1101/gr.089532.108