C. Armen and C. Stein, A 2 2/3-approximation algorithm for the shortest superstring problem, Lecture Notes in Computer Science, vol.1075, pp.87-101, 1996.
DOI : 10.1007/3-540-61258-0_8

A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis, Linear approximation of shortest superstrings, Journal of the ACM, vol.41, issue.4, pp.630-647, 1994.
DOI : 10.1145/179812.179818

D. Breslauer, T. Jiang, and Z. Jiang, Rotations of Periodic Strings and Short Superstrings, Journal of Algorithms, vol.24, issue.2, pp.340-353, 1997.
DOI : 10.1006/jagm.1997.0861

M. Crochemore and W. Rytter, Jewels of Stringology, 2002.
DOI : 10.1142/4838

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

J. C. Dohm, C. Lottaz, T. Borodina, and H. Himmelbauer, SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing, Genome Research, vol.17, issue.11, pp.1697-1706, 2007.
DOI : 10.1101/gr.6435207

F. Eisenbrand, Fast Integer Programming in Fixed Dimension, ESA, pp.196-207, 2003.
DOI : 10.1007/978-3-540-39658-1_20

J. Gallant, D. Maier, and J. A. Storer, On finding minimal length superstrings, Journal of Computer and System Sciences, vol.20, issue.1, pp.50-58, 1980.
DOI : 10.1016/0022-0000(80)90004-5

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

D. Gusfield, G. M. Landau, and B. Schieber, An efficient algorithm for the All Pairs Suffix-Prefix Problem, Information Processing Letters, vol.41, issue.4, pp.181-185, 1992.
DOI : 10.1016/0020-0190(92)90176-V

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

H. W. Lenstra and J. , Integer Programming with a Fixed Number of Variables, Mathematics of Operations Research, vol.8, issue.4, pp.538-548, 1983.
DOI : 10.1287/moor.8.4.538

H. Li, J. Ruan, and R. Durbin, Mapping short DNA sequencing reads and calling variants using mapping quality scores, Genome Research, vol.18, issue.11, pp.1851-1858, 2008.
DOI : 10.1101/gr.078212.108

E. W. Myers, A Whole-Genome Assembly of Drosophila, Science, vol.287, issue.5461, pp.2196-2204, 2000.
DOI : 10.1126/science.287.5461.2196

A. Sundquist, M. Ronaghi, H. Tang, P. Pevzner, and S. Batzoglou, Whole-Genome Sequencing and Assembly with High-Throughput, Short-Read Technologies, PLoS ONE, vol.330, issue.5, p.484, 2007.
DOI : 10.1371/journal.pone.0000484.t005

J. Tarhio and E. Ukkonen, A greedy approximation algorithm for constructing shortest common superstrings, Theoretical Computer Science, vol.57, issue.1, pp.131-145, 1988.
DOI : 10.1016/0304-3975(88)90167-3

R. L. Warren, G. G. Sutton, S. J. Jones, and R. A. Holt, Assembling millions of short DNA sequences using SSAKE, Bioinformatics, vol.23, issue.4, pp.500-501, 2007.
DOI : 10.1093/bioinformatics/btl629

D. R. Zerbino and E. Birney, Velvet: Algorithms for de novo short read assembly using de Bruijn graphs, Genome Research, vol.18, issue.5, pp.821-829, 2008.
DOI : 10.1101/gr.074492.107