A. Dayarian, P. Todd, . Michael, M. Anirvan, and . Sengupta, SOPRA: Scaffolding algorithm for paired reads via statistical optimization, BMC Bioinformatics, vol.11, issue.1, p.345, 2010.
DOI : 10.1186/1471-2105-11-345

J. Eisner, State-of-the-art algorithms for minimum spanning trees -a tutorial discussion, 1997.

S. El-metwally, T. Hamza, M. Zakaria, and M. Helmy, Next-Generation Sequence Assembly: Four Stages of Data Processing and Computational Challenges, PLoS Computational Biology, vol.25, issue.Suppl 2, p.1003345, 2013.
DOI : 10.1371/journal.pcbi.1003345.t005

L. J. Fogel, A. J. Owens, and M. J. Walsh, Artificial Intelligence through Simulated Evolution, 1966.
DOI : 10.1109/9780470544600.ch7

S. Gao, . Wing-kin, N. Sung, and . Nagarajan, Opera: Reconstructing Optimal Genomic Scaffolds with High-Throughput Paired-End Sequences, Journal of Computational Biology, vol.18, issue.11, pp.1681-1691, 2011.
DOI : 10.1089/cmb.2011.0170

R. Michael, . Garey, S. David, L. Johnson, and . Stockmeyer, Some simplified np-complete problems, Proceedings of the sixth annual ACM symposium on Theory of computing, pp.47-63, 1974.

A. Alexey, . Gritsenko, F. Jurgen, . Nijkamp, J. Marcel et al., Grass: a generic algorithm for scaffolding next-generation sequencing assemblies, Bioinformatics, vol.28, issue.11, pp.1429-1437, 2012.

H. John and . Holland, Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence, 1975.

M. Hunt, C. Newbold, M. Berriman, D. Thomas, and . Otto, A comprehensive evaluation of assembly scaffolding tools, Genome Biology, vol.15, issue.3, p.42, 2014.
DOI : 10.1186/gb-2004-5-2-r12

D. John, E. W. Kececioglu, and . Myers, Combinatorial algorithms for dna sequence assembly, Algorithmica, vol.13, issue.12, pp.7-51, 1995.

R. David, . Kelley, C. Michael, . Schatz, L. Steven et al., Quake: quality-aware detection and correction of sequencing errors, Genome Biol, vol.11, issue.11, p.116, 2010.

R. Li, H. Zhu, J. Ruan, W. Qian, X. Fang et al., De novo assembly of human genomes with massively parallel short read sequencing, Genome Research, vol.20, issue.2, pp.265-272, 2010.
DOI : 10.1101/gr.097261.109

A. Pavel, H. Pevzner, . Tang, S. Michael, and . Waterman, An eulerian path approach to dna fragment assembly, Proceedings of the National Academy of Sciences, pp.9748-9753, 2001.

J. Plesnik, The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two, Information Processing Letters, vol.8, issue.4, pp.199-201, 1979.
DOI : 10.1016/0020-0190(79)90023-1

L. Salmela, V. Mäkinen, N. Välimäki, J. Ylinen, and E. Ukkonen, Fast scaffolding with small independent mixed integer programs, Bioinformatics, vol.27, issue.23, pp.3259-3265, 2011.
DOI : 10.1093/bioinformatics/btr562

A. Sasson, P. Todd, and . Michael, Filtering error from SOLiD Output, Bioinformatics, vol.26, issue.6, pp.849-850, 2010.
DOI : 10.1093/bioinformatics/btq045

P. Van-hentenryck, D. Mcallester, and D. Kapur, Solving Polynomial Systems Using a Branch and Prune Approach, SIAM Journal on Numerical Analysis, vol.34, issue.2, pp.797-827, 1997.
DOI : 10.1137/S0036142995281504

J. Westbrook, E. Robert, and . Tarjan, Maintaining bridge-connected and biconnected components on-line, Algorithmica, vol.28, issue.1-6, pp.433-464, 1992.
DOI : 10.1007/BF01758773

D. Whitley, A genetic algorithm tutorial, Statistics and Computing, vol.4, issue.2, pp.65-85, 1994.
DOI : 10.1007/BF00175354

R. Daniel, . Zerbino, K. Gayle, . Mcewen, H. Elliott et al., Pebble and rock band: heuristic resolution of repeats and scaffolding in the velvet short-read de novo assembler, PloS one, vol.4, issue.12, p.8407, 2009.