R. Li, Y. Li, X. Fang, H. Yang, J. Wang et al., SNP detection for massively parallel whole-genome resequencing, Genome research, vol.19, issue.6, pp.1124-1132, 2009.

E. Mark-a-depristo, R. Banks, . Poplin, V. Kiran, J. R. Garimella et al., A framework for variation discovery and genotyping using nextgeneration dna sequencing data, Nature genetics, vol.43, issue.5, pp.491-498, 2011.

N. Nagarajan and M. Pop, Parametric complexity of sequence assembly: theory and applications to next generation sequencing, Journal of computational biology, vol.16, issue.7, pp.897-908, 2009.

J. Dekker, K. Rippe, M. Dekker, and N. Kleckner, Capturing chromosome conformation. science, vol.295, pp.1306-1311, 2002.

. Jacob-o-kitzman, Haplotypes drop by drop: short-read sequencing provides haplotype information when long DNA fragments are barcoded in microfluidic droplets, Nature biotechnology, vol.34, issue.3, pp.296-299, 2016.

S. Yeo, L. Coombe, J. Chu, L. René, I. Warren et al., ARCS: scaffolding genome drafts with linked reads, Bioinformatics, 2017.

H. Marie-nelly, M. Marbouty, A. Cournac, J. Flot, G. Liti et al., High-quality genome (re)assembly using chromosomal contact data, Nature Communications, vol.5, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01138788

J. Flot, H. Marie-nelly, and R. Koszul, Contact genomics: scaffolding and phasing (meta)genomes using chromosome 3D physical signatures, FEBS Letters, vol.589, issue.20, pp.2966-2974, 2015.
URL : https://hal.archives-ouvertes.fr/pasteur-01419996

M. Jain, H. E. Olsen, B. Paten, and M. Akeson, The Oxford Nanopore MinION: delivery of nanopore sequencing to the genomics community, Genome biology, vol.17, issue.1, p.239, 2016.

L. M. Ryan-r-wick, C. L. Judd, K. E. Gorrie, and . Holt, Unicycler: resolving bacterial genome assemblies from short and long sequencing reads, PLOS Computational Biology, vol.13, issue.6, p.1005595, 2017.

A. Pavel, H. Pevzner, M. Tang, and . Waterman, An Eulerian path approach to dna fragment assembly, Proceedings of the National Academy of Sciences, vol.98, issue.17, pp.9748-9753, 2001.

I. Akogwu and N. Wang, Chaoyang Zhang, and Ping Gong. A comparative study of k-spectrum-based error correction methods for next-generation sequencing data analysis, Human genomics, vol.10, issue.2, p.20, 2016.

Y. Liu, J. Schröder, and B. Schmidt, Musket: a multistage k-mer spectrum-based error corrector for illumina sequence data, Bioinformatics, vol.29, issue.3, pp.308-315, 2012.

G. Benoit, D. Lavenier, C. Lemaitre, and G. Rizk, Bloocoo, a memory efficient read corrector, European Conference on Computational Biology (ECCB), 2014.
URL : https://hal.archives-ouvertes.fr/hal-01092960

L. Song, L. Florea, and B. Langmead, Lighter: fast and memory-efficient sequencing error correction without counting, Genome biology, vol.15, issue.11, p.509, 2014.

H. Li, BFC: correcting Illumina sequencing errors, Bioinformatics, vol.31, issue.17, pp.2885-2887, 2015.

J. Schröder, H. Schröder, J. Simon, R. Puglisi, B. Sinha et al., SHREC: a short-read error correction method, Bioinformatics, vol.25, issue.17, pp.2157-2163, 2009.

L. Salmela and J. Schröder, Correcting errors in short reads by multiple alignments, Bioinformatics, vol.27, issue.11, pp.1455-1461, 2011.

X. Yang, P. Sriram, S. Chockalingam, and . Aluru, A survey of error-correction methods for next-generation sequencing, Briefings in bioinformatics, vol.14, issue.1, pp.56-66, 2012.

L. Salmela and E. Rivals, LoRDEC: accurate and efficient long read error correction, Bioinformatics, vol.30, issue.24, pp.3506-3514, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01100451

L. Salmela, R. Walve, E. Rivals, and E. Ukkonen, Accurate self-correction of errors in long reads using de Bruijn graphs, Bioinformatics, vol.33, issue.6, pp.799-806, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01385006

R. Chikhi, A. Limasset, S. Jackman, J. T. Simpson, and P. Medvedev, On the representation of de Bruijn graphs, RECOMB, vol.8394, pp.35-55, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01524525

H. Mohamadi, H. Khan, and I. Birol, ntCard: a streaming algorithm for cardinality estimation in genomics data, Bioinformatics, vol.33, issue.9, pp.1324-1330, 2017.

R. Chikhi, A. Limasset, and P. Medvedev, Compacting de Bruijn graphs from sequencing data quickly and in low memory, Bioinformatics, vol.32, issue.12, pp.201-208, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01395704

, BTRIM de Bruijn graph TRIMming tool

, BGREAT2 improved version of BGREAT edit

A. Limasset, B. Cazaux, E. Rivals, and P. Peterlongo, Read mapping on de Bruijn graphs, BMC bioinformatics, vol.17, issue.1, p.237, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01349636

A. Limasset, G. Rizk, R. Chikhi, and P. Peterlongo, Fast and scalable minimal perfect hashing for massive key sets, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01566246

R. Chikhi and P. Medvedev, Informed and automated k-mer size selection for genome assembly, Bioinformatics, vol.30, issue.1, pp.31-37, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01477511

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.
URL : https://hal.archives-ouvertes.fr/hal-00753930

H. Li, Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly, Bioinformatics, vol.28, issue.14, pp.1838-1844, 2012.

A. Gurevich, V. Saveliev, N. Vyahhi, and G. Tesler, Quast: quality assessment tool for genome assemblies, Bioinformatics, vol.29, issue.8, pp.1072-1075, 2013.

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

B. Langmead, L. Steven, and . Salzberg, Fast gapped-read alignment with Bowtie 2, Nature methods, vol.9, issue.4, pp.357-359, 2012.

Y. Ono, K. Asai, and M. Hamada, PBSIM: PacBio reads simulatorâ?"toward accurate genome assembly, Bioinformatics, vol.29, issue.1, pp.119-121, 2012.