M. D. Berg and A. Khosravi, Optimal binary space partitions for segments in the plane, Int. J. Comput. Geometry Appl, vol.22, issue.3, pp.187-206, 2012.

P. Berman, M. Karpinski, and A. D. Scott, Approximation hardness and satisfiability of bounded occurrence instances of SAT, Electronic Colloquium on Computational Complexity (ECCC), vol.10, issue.022, 2003.

M. A. Biscotti, E. Olmo, and J. S. Heslop-harrison, Repetitive DNA in eukaryotic genomes, Chromosome Res, vol.23, issue.3, pp.415-420, 2015.

A. Chateau and R. Giroudeau, A complexity and approximation framework for the maximization scaffolding problem, Theoretical Computer Science, vol.595, pp.92-106, 2015.
URL : https://hal.archives-ouvertes.fr/lirmm-01219622

T. Davot, A. Chateau, R. Giroudeau, and M. Weller, On the hardness of approximating the linearization of scaffolds sharing repeated contigs
URL : https://hal.archives-ouvertes.fr/lirmm-01900395

J. Håstad, Some optimal inapproximability results, J. ACM, vol.48, issue.4, pp.798-859, 2001.

M. Hunt, C. Newbold, M. Berriman, and T. Otto, A comprehensive evaluation of assembly scaffolding tools, Genome Biology, vol.15, issue.3, p.42, 2014.

P. Koch, M. Platzer, and B. R. Downie, RepARK-de novo creation of repeat libraries from whole-genome NGS reads, Nucleic Acids Res, vol.42, issue.9, p.80, 2014.

I. Mandric, J. Lindsay, I. I. M?ndoiu, and A. Zelikovsky, Scaffolding algorithms, Computational Methods for Next Generation Sequencing Data Analysis, pp.107-132, 2016.

C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991.

N. Philippe, M. Salson, T. Lecroq, M. Léonard, T. Commes et al., Querying large read collections in main memory: a versatile data structure, BMC Bioinformatics, vol.12, p.242, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00632958

M. Quail, M. Smith, P. Coupland, T. Otto, S. Harris et al., A tale of three next generation sequencing platforms: comparison of ion torrent, pacific biosciences and illumina miseq sequencers, BMC Genomics, vol.13, issue.1, p.341, 2012.

H. Tang, Genome assembly, rearrangement, and repeats, Chemical Reviews, vol.107, issue.8, pp.3391-3406, 2007.

M. Weller, A. Chateau, C. Dallard, and R. Giroudeau, Scaffolding problems revisited: Complexity, approximation and fixed parameter tractable algorithms, and some special cases, Algorithmica, vol.80, issue.6, pp.1771-1803, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01833303

M. Weller, A. Chateau, and R. Giroudeau, Exact approaches for scaffolding, BMC Bioinformatics, vol.16, p.2, 2015.
URL : https://hal.archives-ouvertes.fr/lirmm-01219627

M. Weller, A. Chateau, and R. Giroudeau, On the linearization of scaffolds sharing repeated contigs, Proc. 11th COCOA'17, pp.509-517, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01672893