C. Armen and C. Stein, A 2 2 3 superstring approximation algorithm, Computational Molecular Biology {DAM} -{CMB} Series, vol.88, issue.1-3, pp.29-57, 1998.

A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis, Linear approximation of shortest superstrings, J. ACM, vol.41, issue.4, pp.630-647, 1994.

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.

A. Chris and S. Clifford, Algorithms and Data Structures: 4th International Workshop, p.95

C. Kingston, Proceedings, chapter Improved length bounds for the shortest superstring problem, pp.494-505, 1995.

M. Crochemore, M. Cygan, C. S. Iliopoulos, M. Kubica, J. Radoszewski et al., Algorithms for three versions of the shortest common superstring problem, CPM, vol.6129, pp.299-309, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00742040

A. Czumaj, L. Gasieniec, M. Piotrów, and W. Rytter, Sequential and parallel approximation of shortest superstrings, Journal of Algorithms, vol.23, issue.1, pp.74-100, 1997.

G. Fici, T. Kociumaka, J. Radoszewski, W. Rytter, and T. Walen, On the greedy algorithm for the shortest common superstring problem with reversals, Inf. Process. Lett, vol.116, issue.3, pp.245-251, 2016.

J. Gallant, D. Maier, and J. Astorer, On finding minimal length superstrings, Journal of Computer and System Sciences, vol.20, issue.1, pp.50-58, 1980.

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

A. Golovnev, A. S. Kulikov, and I. Mihajlin, Approximating shortest superstring problem using de bruijn graphs, CPM, vol.7922, pp.120-129, 2013.

H. Kaplan, M. Lewenstein, N. Shafrir, and M. Sviridenko, Approximation algorithms for asymmetric tsp by decomposing directed regular multigraphs, J. ACM, vol.52, issue.4, pp.602-626, 2005.

H. Kaplan and N. Shafrir, The greedy algorithm for shortest superstrings, Inf. Process. Lett, vol.93, issue.1, pp.13-17, 2005.

M. Karpinski and R. Schmied, Improved inapproximability results for the shortest superstring and related problems, CATS, vol.141, pp.27-36, 2013.

S. R. Kosaraju, J. K. Park, and C. Stein, Long tours and short superstrings, Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on, pp.166-177, 1994.

M. Li, Towards a DNA sequencing theory (learning a string), Proc. of the 31st Symposium on the Foundations of Comp. Sci, pp.125-134, 1990.

M. Mucha, Lyndon words and short superstrings, SODA, pp.958-972, 2013.

S. Ott, Proceedings, chapter Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size, vol.2, pp.55-64, 1999.

K. E. Paluch, Better approximation algorithms for maximum asymmetric traveling salesman and shortest superstring. CoRR, abs/1401, vol.3670, 2014.

K. E. Paluch, K. M. Elbassioni, and A. Van-zuylen, Simpler approximation of the maximum asymmetric traveling salesman problem, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, vol.14, pp.501-506, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678183

Z. Sweedyk, 1 2 -approximation algorithm for shortest superstring, SIAM J. Comput, vol.2, issue.3, pp.954-986, 1999.

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.

S. Teng and F. F. Yao, Approximating shortest superstrings, SIAM J. Comput, vol.26, issue.2, pp.410-417, 1997.

Y. W. Yu, Approximation hardness of shortest common superstring variants, 2016.