A. Bankevich, S. Nurk, D. Antipov, A. Gurevich, M. Dvorkin et al., Spades: a new genome assembly algorithm and its applications to single-cell sequencing, Journal of computational biology : a journal of computational molecular cell biology, vol.19, issue.5, pp.455-477, 2012.

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.244, issue.2, pp.313-348, 2016.

S. François, R. Andonov, H. Djidjev, and D. Lavenier, Global optimization methods for genome scaffolding, Electronic Notes in Discrete Mathematics, vol.64, 2018.

S. François, R. Andonov, D. Lavenier, and H. Djidjev, Global optimization approach for circular and chloroplast genome assemblies, 10th International Conference on Bioinformatics and Computational Biology, 2018.

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

H. Daniel, K. Huson, E. W. Reinert, and . Myers, The greedy path-merging algorithm for contig scaffolding, J. ACM, vol.49, issue.5, pp.603-615, 2002.

C. E. Miller, A. W. Tucker, and R. A. Zemlin, Integer programming formulation of traveling salesman problems, J. ACM, vol.7, issue.4, pp.326-329, 1960.

K. Sahlin, F. Vezzi, B. Nystedt, J. Lundeberg, and L. Arvestad, BESST-efficient scaffolding of large fragmented assemblies, BMC Bioinformatics, vol.15, p.281, 2014.

L. Taccari, Integer programming formulations for the elementary shortest path problem, European Journal of Operational Research, vol.252, issue.1, pp.122-130, 2016.