G. Benoit, C. Lemaitre, D. Lavenier, and G. Rizk, Compression of high throughput sequencing data with probabilistic de bruijn graph. arXiv.org, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01214682

J. K. Bonfield and M. V. Mahoney, Compression of FASTQ and SAM Format Sequencing Data, PLoS ONE, vol.32, issue.3, p.59190, 2013.
DOI : 10.1371/journal.pone.0059190.s001

M. Burrows and D. Wheeler, A block sorting lossless data compression algorithm, Digital Equipment Corporation, 1994.

R. Cánovas, A. Moffat, and A. Turpin, Lossy compression of quality scores in genomic data, Bioinformatics, vol.30, issue.15, pp.2130-2136, 2014.
DOI : 10.1093/bioinformatics/btu183

R. Chikhi and G. Rizk, Space-efficient and exact de Bruijn graph representation based on a Bloom filter, Algorithms for Molecular Biology, vol.8, issue.1, p.22, 2013.
DOI : 10.1101/gr.131383.111
URL : https://hal.archives-ouvertes.fr/hal-00753930

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.281415-1419, 2012.
DOI : 10.1093/bioinformatics/bts173

S. Deorowicz and S. Grabowski, Compression of DNA sequence reads in FASTQ format, Bioinformatics, vol.27, issue.6, pp.860-862, 2011.
DOI : 10.1093/bioinformatics/btr014

P. Deutsch and J. Gailly, Zlib compressed data format specification version 3.3, 1950.
DOI : 10.17487/rfc1950

S. Grabowski and S. Deorowicz, Disk-based compression of data from genome sequencing, Bioinformatics, vol.31, issue.9, 2014.
DOI : 10.1093/bioinformatics/btu844

F. Hach, I. Numanagic, C. Alkan, and S. C. Sahinalp, SCALCE: boosting sequence compression algorithms using locally consistent encoding, Bioinformatics, vol.28, issue.23, pp.3051-3057, 2012.
DOI : 10.1093/bioinformatics/bts593

D. Huffman, A method for the construction of minimum-redundancy codes, Proceedings of the Institute of Radio Engineers, 1952.

L. Janin, G. Rosone, and A. J. Cox, Adaptive reference-free compression of sequence quality scores, Bioinformatics, vol.30, issue.1, p.257, 2013.
DOI : 10.1093/bioinformatics/btt257

D. C. Jones, W. L. Ruzzo, X. Peng, and M. G. Katze, Compression of nextgeneration sequencing reads aided by highly efficient de novo assembly, Nucleic Acids Res, issue.22, pp.40-171, 2012.

H. Li and R. Durbin, Fast and accurate short read alignment with Burrows-Wheeler transform, Bioinformatics, vol.25, issue.14, pp.1754-1760, 2009.
DOI : 10.1093/bioinformatics/btp324

H. Li, B. Handsaker, A. Wysoker, T. Fennell, J. Ruan et al., The Sequence Alignment/Map format and SAMtools, Bioinformatics, vol.25, issue.16, pp.252078-2079, 2009.
DOI : 10.1093/bioinformatics/btp352

M. Mahoney, Adaptive weighing of context models for lossless data compression . Florida Tech, 2005.

A. Moffat, Implementing the PPM data compression scheme, IEEE Transactions on Communications, vol.38, issue.11, 1990.
DOI : 10.1109/26.61469

G. Rizk, D. Lavenier, and R. Chikhi, DSK: k-mer counting with very low memory usage, Bioinformatics, vol.29, issue.5, pp.652-653, 2013.
DOI : 10.1093/bioinformatics/btt020
URL : https://hal.archives-ouvertes.fr/hal-00778473

L. Roguski and S. Deorowicz, DSRC 2???Industry-oriented compression of FASTQ files, Bioinformatics, vol.30, issue.15, pp.2213-2215, 2014.
DOI : 10.1093/bioinformatics/btu208

S. Saha and S. Rajasekaran, Efficient algorithms for the compression of FASTQ files, 2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), 2014.
DOI : 10.1109/BIBM.2014.6999132

S. C. Sahinalp and U. Vishkin, Efficient approximate and dynamic matching of patterns using a labeling paradigm, Proceedings of 37th Conference on Foundations of Computer Science, p.320, 1996.
DOI : 10.1109/SFCS.1996.548491

C. Shannon and W. Weaver, The mathematical theory of communication, 1949.

W. Tembe, J. Lowey, and E. Suh, G-SQZ: compact encoding of genomic sequence and quality data, Bioinformatics, vol.26, issue.17, pp.2192-2194, 2010.
DOI : 10.1093/bioinformatics/btq346

W. Tembe, J. Lowey, and E. Suh, G-SQZ: compact encoding of genomic sequence and quality data, Bioinformatics, vol.26, issue.17, 2010.
DOI : 10.1093/bioinformatics/btq346

R. Wan, V. N. Anh, and K. Asai, Transformations for the compression of FASTQ quality scores of next-generation sequencing data, Bioinformatics, vol.28, issue.5, pp.628-635, 2012.
DOI : 10.1093/bioinformatics/btr689

T. Welch, A Technique for High-Performance Data Compression, Computer, vol.17, issue.6, 1984.
DOI : 10.1109/MC.1984.1659158

I. Witten, R. Neal, and J. Cleary, Arithmetic coding for data compression, Communications of the ACM, vol.30, issue.6, 1987.
DOI : 10.1145/214762.214771

V. Yanovsky, ReCoil - an algorithm for compression of extremely large datasets of dna data, Algorithms for Molecular Biology, vol.6, issue.1, p.23, 2011.
DOI : 10.1016/0022-2836(81)90087-5

Y. W. Yu, D. Yorukoglu, and B. Berger, Traversing the k-mer Landscape of NGS Read Datasets for Quality Score Sparsification, Research in Computational Molecular Biology, pp.385-399, 2014.
DOI : 10.1007/978-3-319-05269-4_31

J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, 1977.
DOI : 10.1109/TIT.1977.1055714