Relative lempel-ziv with constant-time random access

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

Volumn 8799, Issue , 2014, Pages 13-17

  Ferrada, Héctor ^a   Gagie, Travis ^b   Gog, Simon ^c   Puglisi, Simon J ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF HELSINKI   (Finland)

^c KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL;

CONSTANT TIME; RANDOM ACCESS; S.CEREVISIAE; SUB-STRINGS; SUBLINEAR;

GENES;

EID: 84908663914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-11918-2     Document Type: Conference Paper

References (14)

1. Deorowicz, S., Danek, A., Grabowski, S.: Genome compression: A novel approach for large collections. Bioinformatics 29(20), 2572-2578 (2013).
2. Deorowicz, S., Grabowski, S.: Robust relative compression of genomes with random access. Bioinformatics 27(21), 2979-2986 (2011).
3. Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM52(4), 552-581 (2005).
4. Gagie, T., Gawrychowski, P., Puglisi, S. J.: Faster approximate pattern matching in compressed repetitive texts. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 653-662. Springer, Heidelberg (2011).
5. Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: Plug and play with succinct data structures. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 326-337. Springer, Heidelberg (2014).
6. Kärkkäinen, J., Kempa, D., Puglisi, S. J.: Lightweight Lempel-Ziv parsing. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 139-150. Springer, Heidelberg (2013).
7. Kreft, S., Navarro, G.: On compressing and indexing repetitive sequences. Theor. Comp. Sci. 483, 115-133 (2013).
8. Kuruppu, S., Puglisi, S. J., Zobel, J.: Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 201-206. Springer, Heidelberg (2010).
9. Kuruppu, S., Puglisi, S. J., Zobel, J.: Optimized relative Lempel-Ziv compression of genomes. In: Proc. ACSC, pp. 91-98 (2011).
10. Maruyama, S., Tabei, Y., Sakamoto, H., Sadakane, K.: Fully-online grammar compression. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) SPIRE 2013. LNCS, vol. 8214, pp. 218-229. Springer, Heidelberg (2013).
11. Pătrascu, M.: Succincter. In: Proc. FOCS, pp. 305-313 (2008).
12. Verbin, E., Yu, W.: Data structure lower bounds on random access to grammarcompressed strings. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 247-258. Springer, Heidelberg (2013).
13. Wandelt, S., Leser, U.: FRESCO: Referential compression of highly-similar sequences. IEEE Trans. Comp. Bio. Bioinf. 10(5), 1275-1288 (2013).
14. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theor. 23(3), 337-343 (1977).