Q. T. Bui, Y. Deville, and Q. D. Pham, Exact methods for solving the elementary shortest and longest path problems, Annals of Operations Research, vol.3, issue.4, pp.313-348, 2016.
DOI : 10.1016/j.orl.2005.02.007

R. Chikhi and G. Rizk, Space-Efficient and Exact de Bruijn Graph Representation Based on a Bloom Filter, In: WABI. Lecture Notes in Computer Science, vol.7534, pp.236-248, 2012.
DOI : 10.1007/978-3-642-33122-0_19
URL : https://hal.archives-ouvertes.fr/hal-00753930

S. François, R. Andonov, D. Lavenier, and H. Djidjev, Global optimization methods for genome sca?olding, p.INRIA, 2017.

M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1990.

A. A. Gritsenko, J. F. Nijkamp, M. J. Reinders, and D. D. Ridder, GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies, Bioinformatics, vol.28, issue.11, pp.1429-1437, 2012.
DOI : 10.1093/bioinformatics/bts175
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.470.2343

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.
DOI : 10.1093/bioinformatics/btt086
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3624806

W. Huang, L. Li, J. R. Myers, and G. T. Marth, ART: a next-generation sequencing read simulator, Bioinformatics, vol.28, issue.4, pp.593-594, 2012.
DOI : 10.1093/bioinformatics/btr708
URL : https://academic.oup.com/bioinformatics/article-pdf/28/4/593/16911715/btr708.pdf

D. H. Huson, K. Reinert, and E. W. Myers, The greedy path-merging algorithm for contig scaffolding, Journal of the ACM, vol.49, issue.5, pp.603-615, 2002.
DOI : 10.1145/585265.585267

I. Mandric and A. Zelikovsky, Sca?Match: sca?olding algorithm based on maximum weight matching, Bioinformatics, 2015.

B. Nicolas, C. Annie, R. Coletta, S. De-givry, P. Leleux et al., An integer linear programming approach for genome sca?olding, Bioinformatics, 2015.

P. A. Pevzner, H. Tang, and M. S. Waterman, An Eulerian path approach to DNA fragment assembly, Proceedings of the National Academy of Sciences, vol.291, issue.5507, pp.9748-9753, 2001.
DOI : 10.1126/science.1058040
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC55524

K. Sahlin, F. Vezzi, B. Nystedt, J. Lundeberg, and L. Arvestad, BESST - Efficient scaffolding of large fragmented assemblies, BMC Bioinformatics, vol.15, issue.1, p.281, 2014.
DOI : 10.1186/1471-2105-15-281
URL : http://doi.org/10.1186/1471-2105-15-281

J. L. Weber and E. W. Myers, Human Whole-Genome Shotgun???Sequencing, Genome Research, vol.53, issue.5, pp.401-409, 1997.
DOI : 10.1038/ng0794-343
URL : http://ai.stanford.edu/~serafim/cs262/Papers/WeberMyers.pdf

M. Weller, A. Chateau, and R. Giroudeau, Exact approaches for scaffolding, BMC Bioinformatics, vol.16, issue.Suppl 14, p.2, 2015.
DOI : 10.1186/1471-2105-16-S14-S2
URL : https://hal.archives-ouvertes.fr/lirmm-01219627