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

URL : http://www.cs.cmu.edu/afs/cs/Web/People/avrim/Papers/./superstring.ps.gz

B. Cazaux, R. Cánovas, and E. Rivals, Shortest DNA Cyclic Cover in Compressed Space, 2016 Data Compression Conference (DCC), pp.536-545, 2016.
DOI : 10.1109/DCC.2016.79

URL : https://hal.archives-ouvertes.fr/lirmm-01314330

B. Cazaux and E. Rivals, Approximation of greedy algorithms for Max-ATSP, maximal compression, maximal cycle cover, and shortest cyclic cover of strings, Proc. of Prague Stringology ConferencePSC), pp.148-161, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01100683

B. Cazaux and E. Rivals, The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings, Discrete Applied Mathematics, vol.212, pp.48-60, 2016.
DOI : 10.1016/j.dam.2015.06.003

URL : https://hal.archives-ouvertes.fr/lirmm-01286943

M. Demange and V. T. Paschos, On an approximation measure founded on the links between optimization and polynomial approximation theory, Theoretical Computer Science, vol.158, issue.1-2, pp.117-1410304, 1996.
DOI : 10.1016/0304-3975(95)00060-7

URL : https://doi.org/10.1016/0304-3975(95)00060-7

G. Fici, T. Kociumaka, J. Radoszewski, W. Rytter, and T. Walen, On the greedy algorithm for the Shortest Common Superstring problem with reversals, Information Processing Letters, vol.116, issue.3, pp.245-251, 2016.
DOI : 10.1016/j.ipl.2015.11.015

URL : http://arxiv.org/pdf/1511.08431

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

URL : https://doi.org/10.1016/0022-0000(80)90004-5

T. P. Gevezes and L. S. Pitsoulis, Optimization in science and engineering, in: Honor of the 60th Birthday of Panos M. Pardalos The Shortest Superstring Problem, pp.189-227

A. Golovnev, A. Kulikov, and I. Mihajlin, Approximating Shortest Superstring Problem Using de Bruijn Graphs, Combinatorial Pattern Matching, pp.120-129, 2013.
DOI : 10.1007/978-3-642-38905-4_13

URL : http://logic.pdmi.ras.ru/~kulikov/papers/2013_approx_scs_cpm.pdf

H. Kaplan and N. Shafrir, The greedy algorithm for shortest superstrings, Information Processing Letters, vol.93, issue.1, pp.13-17, 2005.
DOI : 10.1016/j.ipl.2004.09.012

A. S. Kulikov, S. Savinov, and E. Sluzhaev, Greedy Conjecture for Strings of Length 4, Combinatorial Pattern Matching -26th Annual Symposium, CPM 2015, pp.307-315, 2015.
DOI : 10.1007/978-3-319-19929-0_26

B. Ma, Why greed works for shortest common superstring problem, Theoretical Computer Science, vol.410, issue.51, pp.5374-5381, 2009.
DOI : 10.1016/j.tcs.2009.09.014

M. Mucha, Lyndon Words and Short Superstrings, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.958-972
DOI : 10.1137/1.9781611973105.69

URL : https://epubs.siam.org/doi/pdf/10.1137/1.9781611973105.69

K. E. Paluch, Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring

H. J. Romero, C. A. Brizuela, and A. Tchernykh, An experimental comparison of two approximation algorithms for the shortest common superstring problem, Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004., pp.27-34, 2004.
DOI : 10.1109/ENC.2004.1342585

URL : http://usuario.cicese.mx/~chernykh/papers/ENC2004_superstring.pdf

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

URL : https://doi.org/10.1016/0304-3975(88)90167-3

M. Weinard and G. Schnitger, On the Greedy Superstring Conjecture, SIAM Journal on Discrete Mathematics, vol.20, issue.2, pp.502-522, 2006.
DOI : 10.1137/040619144

URL : http://www.thi.informatik.uni-frankfurt.de/%7Eweinard/Publications/siam.ps

A. Zaritsky and M. Sipper, The Preservation of Favored Building Blocks in the Struggle for Fitness: The Puzzle Algorithm, IEEE Transactions on Evolutionary Computation, vol.8, issue.5, pp.443-455, 2004.
DOI : 10.1109/TEVC.2004.831260