S. Vatedka and A. Tchamkerten, Local decoding and update of compressed data, Proceedings of the 2019 IEEE International Symposium on Information Theory (ISIT), 2019.
URL : https://hal.archives-ouvertes.fr/hal-02302650

D. Pavlichin, T. Weissman, and G. Mably, The quest to save genomics: Unless researchers solve the looming data compression problem, biomedical science could stagnate, IEEE Spectrum, vol.55, issue.9, pp.27-31, 2018.

C. P. Chen and C. Zhang, Data-intensive applications, challenges, techniques and technologies: A survey on big data, Information sciences, vol.275, pp.314-347, 2014.

I. A. Hashem, I. Yaqoob, N. B. Anuar, S. Mokhtar, A. Gani et al., The rise of "big data" on cloud computing: Review and open research issues, Information systems, vol.47, pp.98-115, 2015.

M. P. Ball, J. V. Thakuria, A. W. Zaranek, T. Clegg, A. M. Rosenbaum et al., A public resource facilitating clinical use of genomes, Proceedings of the National Academy of Sciences, vol.109, issue.30, pp.11-920, 2012.

U. Consortium, The uk10k project identifies rare variants in health and disease, Nature, vol.526, issue.7571, p.82, 2015.

J. M. Gaziano, J. Concato, M. Brophy, L. Fiore, S. Pyarajan et al., Million veteran program: a mega-biobank to study genetic influences on health and disease, Journal of clinical epidemiology, vol.70, pp.214-223, 2016.

E. E. Schadt, M. D. Linderman, J. Sorenson, L. Lee, and G. P. Nolan, Computational solutions to large-scale data management and analysis, Nature reviews genetics, vol.11, issue.9, p.647, 2010.

M. Vivien, The big challenges of big data, Nature, vol.498, p.255, 2013.

Z. D. Stephens, S. Y. Lee, F. Faghri, R. H. Campbell, C. Zhai et al., Big data: astronomical or genomical?, PLoS biology, vol.13, issue.7, p.1002195, 2015.

J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977.

, Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory, vol.24, issue.5, pp.530-536, 1978.

M. C. Brandon, D. C. Wallace, and P. Baldi, Data structures and compression algorithms for genomic sequence data, Bioinformatics, vol.25, issue.14, pp.1731-1738, 2009.

S. Deorowicz and S. Grabowski, Robust relative compression of genomes with random access, Bioinformatics, vol.27, issue.21, pp.2979-2986, 2011.

A. J. Cox, M. J. Bauer, T. Jakobi, and G. Rosone, Large-scale compression of genomic sequence databases with the burrows-wheeler transform, Bioinformatics, vol.28, issue.11, pp.1415-1419, 2012.

S. Deorowicz, A. Danek, and S. Grabowski, Genome compression: a novel approach for large collections, Bioinformatics, vol.29, issue.20, pp.2572-2578, 2013.

K. Tatwawadi, M. Hernaez, I. Ochoa, and T. Weissman, GTRAC: Fast retrieval from compressed collections of genomic variants, Bioinformatics, vol.32, issue.17, pp.479-486, 2016.

M. Patrascu, Succincter, 49th Annual IEEE Symposium on Foundations of Computer Science, pp.305-313, 2008.

Y. Dodis, M. Patrascu, and M. Thorup, Changing base without losing space, Proceedings of the forty-second ACM symposium on Theory of computing, pp.593-602, 2010.

J. I. Munro and Y. Nekrich, Compressed data structures for dynamic sequences, Algorithms-ESA 2015, pp.891-902, 2015.

R. Raman and S. S. Rao, Succinct dynamic dictionaries and trees, International Colloquium on Automata, Languages, and Programming, pp.357-368, 2003.

V. Chandar, D. Shah, and G. W. Wornell, A locally encodable and decodable compressed data structure, Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, pp.613-619, 2009.

V. B. Chandar, Sparse graph codes for compression, sensing and secrecy, 2010.

A. Dutta, R. Levi, D. Ron, and R. Rubinfeld, A simple online competitive adaptation of lempel-ziv compression with efficient random access support, Proceedings of the Data Compression Conference (DCC), pp.113-122, 2013.

P. Bille, G. M. Landau, R. Raman, K. Sadakane, S. R. Satti et al., Random access to grammar-compressed strings, Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms, pp.373-389, 2011.

E. Viola, O. Weinstein, and H. Yu, How to store a random walk, 2019.

K. Sadakane and R. Grossi, Squeezing succinct data structures into entropy bounds, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp.1230-1239, 2006.

R. González and G. Navarro, Statistical encoding of succinct data structures, Annual Symposium on Combinatorial Pattern Matching, pp.294-305, 2006.

P. Ferragina and R. Venturini, A simple storage scheme for strings achieving entropy bounds, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp.690-696, 2007.

S. Kreft and G. Navarro, LZ77-like compression with fast random access, 2010 Data Compression Conference, pp.239-248, 2010.

V. Mäkinen and G. Navarro, Dynamic entropy-compressed sequences and full-text indexes, Annual Symposium on Combinatorial Pattern Matching, pp.306-317, 2006.

J. Jansson, K. Sadakane, and W. Sung, Cram: Compressed random access memory, International Colloquium on Automata, Languages, and Programming, pp.510-521, 2012.

R. Grossi, R. Raman, S. S. Rao, and R. Venturini, Dynamic compressed strings with random access, International Colloquium on Automata, Languages, and Programming, pp.504-515, 2013.

G. Navarro and Y. Nekrich, Optimal dynamic sequence representations, SIAM Journal on Computing, vol.43, issue.5, pp.1781-1806, 2014.

P. K. Nicholson, V. Raman, and S. S. Rao, A survey of data structures in the bitprobe model, Space-Efficient Data Structures, Streams, and Algorithms, pp.303-318, 2013.

H. Buhrman, P. B. Miltersen, J. Radhakrishnan, and S. Venkatesh, Are bitvectors optimal?, SIAM Journal on Computing, vol.31, issue.6, pp.1723-1744, 2002.

M. Lewenstein, J. I. Munro, P. K. Nicholson, and V. Raman, Improved explicit data structures in the bitprobe model, European Symposium on Algorithms, pp.630-641, 2014.

M. Garg and J. Radhakrishnan, Set membership with a few bit probes, Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, pp.776-784, 2015.

, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), ser. Leibniz International Proceedings in Informatics (LIPIcs), vol.66, 2017.

A. Mazumdar, V. Chandar, and G. W. Wornell, Local recovery in data compression for general sources, Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT), pp.2984-2988, 2015.

K. Tatwawadi, S. Bidokhti, and T. Weissman, On universal compression with constant random access, Proceedings of the 2018 IEEE International Symposium on Information Theory, pp.891-895, 2018.

A. Makhdoumi, S. Huang, M. Médard, and Y. Polyanskiy, On locally decodable source coding, Proceedings of the 2015 IEEE International Conference on Communications (ICC), pp.4394-4399, 2015.

A. Pananjady and T. A. Courtade, The effect of local decodability constraints on variable-length compression, IEEE Transactions on Information Theory, vol.64, issue.4, pp.2593-2608, 2018.

A. Montanari and E. Mossel, Smooth compression, Gallager bound and nonlinear sparse-graph codes, Proceedings of the 2008 IEEE International Symposium on Information Theory, pp.2474-2478, 2008.

L. R. Varshney, J. Kusuma, and V. K. Goyal, On palimpsests in neural memory: An information theory viewpoint, IEEE Transactions on Molecular, Biological and Multi-Scale Communications, vol.2, issue.2, pp.143-153, 2016.

, Malleable coding for updatable cloud caching, IEEE Transactions on Communications, vol.64, issue.12, pp.4946-4955, 2016.

A. Mazumdar and S. , Semisupervised clustering, AND-queries and locally encodable source coding, Advances in Neural Information Processing Systems, pp.6489-6499, 2017.

S. Yekhanin, Locally decodable codes, Foundations and Trends R in Theoretical Computer Science, vol.6, issue.3, pp.139-255, 2012.

P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, On the locality of codeword symbols, IEEE Transactions on Information theory, vol.58, issue.11, pp.6925-6934, 2012.

I. Tamo and A. Barg, A family of optimal locally recoverable codes, IEEE Transactions on Information Theory, vol.60, issue.8, pp.4661-4676, 2014.

V. R. Cadambe and A. Mazumdar, Bounds on the size of locally recoverable codes, IEEE transactions on information theory, vol.61, issue.11, pp.5787-5794, 2015.

A. Mazumdar, V. Chandar, and G. W. Wornell, Update-efficiency and local repairability limits for capacity approaching codes, IEEE Journal on Selected Areas in Communications, vol.32, issue.5, pp.976-988, 2014.

I. Tamo, A. Barg, and A. Frolov, Bounds on the parameters of locally recoverable codes, IEEE Transactions on information theory, vol.62, issue.6, pp.3070-3083, 2016.

T. M. Cover and J. A. Thomas, Elements of Information Theory, 2012.

A. E. Gamal and Y. Kim, Network Information Theory, 2011.