. Millerjr, . Korens, and . Suttong, Assembly algorithms for next-generation sequencing data, Genomics, vol.2010, issue.956, pp.315-327

P. Pevzner, H. Tang, and M. Waterman, An Eulerian path approach to DNA fragment assembly, Proceedings of the National Academy of Sciences, vol.98, issue.17, pp.989748-9753, 2001.
DOI : 10.1073/pnas.171285098

M. Grabherr, B. Haas, M. Yassour, J. Levin, D. Thompson et al., Full-length transcriptome assembly from RNA-Seq data without a reference genome, Nature Biotechnology, vol.30, issue.7, pp.29644-652, 2011.
DOI : 10.1101/GR.229202. ARTICLE PUBLISHED ONLINE BEFORE MARCH 2002

G. Sacomoto, J. Kielbassa, R. Chikhi, R. Uricaru, P. Antoniou et al., KISSPLICE: de-novo calling alternative splicing events from RNA-seq data, BMC Bioinformatics, vol.2012, issue.6, p.135
URL : https://hal.archives-ouvertes.fr/hal-00784407

Y. Peng, H. Leung, S. Yiu, and F. Chin, Meta-IDBA: a de Novo assembler for metagenomic data, Bioinformatics, vol.27, issue.13, pp.94-101, 2011.
DOI : 10.1093/bioinformatics/btr216

Z. Iqbal, M. Caccamo, I. Turner, P. Flicek, and G. Mcvean, De novo assembly and genotyping of variants using colored de Bruijn graphs, Nature Genetics, vol.44, issue.2, pp.226-232
DOI : 10.1016/0198-8859(91)90078-N

T. Conway and A. Bromage, Succinct data structures for assembling large genomes, Bioinformatics, vol.27, issue.4, pp.479-486, 2011.
DOI : 10.1093/bioinformatics/btq697

C. Ye, Z. Ma, C. Cannon, M. Pop, and D. Yu, Exploiting sparseness in de novo genome assembly, BMC Bioinformatics, vol.13, issue.Suppl 6, p.1
DOI : 10.1093/bioinformatics/btr319

R. Chikhi and G. Rizk, Space-efficient and exact de Bruijn graph representation based on a Bloom filter, Preliminary version in WABI'2012, p.22
URL : https://hal.archives-ouvertes.fr/hal-00753930

A. Bowe, T. Onodera, K. Sadakane, and T. Shibuya, Succinct de Bruijn Graphs, Algorithms in Bioinformatics -12th International Workshop, WABI 2012, pp.225-235, 2012.
DOI : 10.1007/978-3-642-33122-0_18

J. Pell, A. Hintze, R. Canino-koning, A. Howe, J. Tiedje et al., Scaling metagenome sequence assembly with probabilistic de Bruijn graphs, Proceedings of the National Academy of Sciences, vol.109, issue.33, pp.13272-13277, 2012.
DOI : 10.1073/pnas.1121464109

URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3421212

A. Kirsch and M. Mitzenmacher, Less hashing, same performance: building a better Bloom filter. Random Struct Algorithms, pp.187-218, 2008.

G. Rizk, D. Lavenier, and R. Chikhi, DSK: k-mer counting with very low memory usage, Bioinformatics, vol.29, issue.5, pp.652-655
DOI : 10.1093/bioinformatics/btt020

URL : https://hal.archives-ouvertes.fr/hal-00778473

F. Blattner, G. Plunkett, C. Bloch, N. Perna, V. Burland et al., The Complete Genome Sequence of Escherichia coli K-12, Computer Science -Theory and Applications, Fourth International Computer Science Symposium in Russia Proceedings. Lecture Notes in Computer Science, pp.1453-1462, 1997.
DOI : 10.1126/science.277.5331.1453