Block graphs in practice

CEUR Workshop Proceedings

Volumn 1146, Issue , 2014, Pages 30-36

  Gagie, Travis ^a   Hoobin, Christopher ^b   Puglisi, Simon J ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

^b RMIT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK GRAPHS;

EID: 84908270873     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. P. Bille, G. M. Landau, R. Raman, K. Sadakane, S. R. Satti, and O. Weimann. Random access to grammar-compressed strings. In Proceedings of the 22nd Symposium on Discrete Algorithms (SODA), pages 373-389, 2011.
2. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and A. Shelat. The smallest grammar problem. IEEE Transactions on Information Theory, 51(7):2554-2576, 2005.
3. S. Deorowicz, A. Danek, and S. Grabowski. Genome compression: a novel approach for large collections. Bioinformatics, 29(20):2572-2578, 2013.
4. S. Deorowicz and S. Grabowski. Robust relative compression of genomes with random access. Bioinformatics, 27(21):2979-2986, 2011.
5. T. Gagie, P. Gawrychowski, and S. J. Puglisi. Faster approximate pattern matching in compressed repetitive texts. In Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC), pages 653-662, 2011.
6. R. Grossi. Random access to high-order entropy compressed text. In A. Brodnik, A. López-Ortiz, V. Raman, and A. Viola, editors, Space-Efficient Data Structures, Streams, and Algorithms, pages 199-215. Springer-Verlag, 2013.
7. S. Kreft and G. Navarro. On compressing and indexing repetitive sequences. Theoretical Computer Science, to appear.
8. S. Kuruppu, S. J. Puglisi, and J. Zobel. Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval. In Proceedings of the 17th Symposium on String Processing and Information Retrieval (SPIRE), pages 201-206, 2010.
9. S. Kuruppu, S. J. Puglisi, and J. Zobel. Optimized relative Lempel-Ziv compression of genomes. In Proceedings of the 34th Australasian Computer Science Conference (ACSC), pages 91-98, 2011.
10. S. Maruyama, Y. Tabei, H. Sakamoto, and K. Sadakane. Fully-online grammar compression. In Proceedings of the 20th Symposium on String Processing and Information Retrieval (SPIRE), pages 218-229, 2013.
11. D. Okanohara and K. Sadakane. Practical entropy-compressed rank/select dictionary. In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), 2007.
12. R. Raman, V. Raman, and S. R. Satti. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms, 3(4), 2007.
13. W. Rytter. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Computer Science, 302(1-3):211-222, 2003.
14. E. Verbin and W. Yu. Data structure lower bounds on random access to grammar-compressed strings. In Proceeings of the 24th Symposium on Combinatorial Pattern Matching (CPM), pages 247-258, 2013.