A. V. Aho and M. J. Corasick, Efficient string matching: An aid to bibliographic search, Communincations of ACM, vol.18, issue.6, pp.333-340, 1975.
DOI : 10.1145/360825.360855

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

R. Cánovas, B. Cazaux, and E. Rivals, The Compressed Overlap Index, 2017.

B. Cazaux, R. Cánovas, and E. Rivals, Shortest DNA cyclic cover in compressed space, 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, A linear time algorithm for Shortest Cyclic Cover of Strings, J. of Discrete Algorithms, vol.37, pp.56-67, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01240278

B. Cazaux and E. Rivals, Hierarchical Overlap Graph, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-01674319

B. Cazaux and E. Rivals, Superstrings with multiplicities, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018, vol.105, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-01843225

M. Crochemore, M. Cygan, C. S. Iliopoulos, M. Kubica, J. Radoszewski et al., Algorithms for three versions of the shortest common superstring problem, Proc. of 21st Annual Symp. Combinatorial Pattern Matching (CPM), vol.6129, pp.299-309, 2010.
DOI : 10.1007/978-3-642-13509-5_27
URL : https://hal.archives-ouvertes.fr/hal-00742040

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.

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

A. Golovnev, A. Kulikov, and I. Mihajlin, Approximating Shortest Superstring Problem Using de Bruijn Graphs, Combinatorial Pattern Matching, vol.7922, 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

D. Gusfield, Algorithms on strings, trees, and sequences: computer science and computational biology, 1997.

T. Jiang, M. Li, and D. Du, A note on shortest superstrings with flipping, Information Processing Letters, vol.44, issue.4, pp.195-199, 1992.

J. D. Kececioglu and E. W. Myers, Combinatiorial algorithms for DNA sequence assembly, Algorithmica, vol.13, issue.1, pp.7-51, 1995.

B. Ma, Why greed works for shortest common superstring problem, Theoretical Computer Science, vol.410, issue.51, pp.5374-5381, 2009.

M. Mucha, Lyndon words and short superstrings, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp.958-972, 2013.

K. E. Paluch, Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring. CoRR, abs/1401, vol.3670, 2014.

C. H. Papadimitriou and K. Steiglitz, Combinatorial optimization : algorithms and complexity, vol.496, 1998.

H. J. Romero, C. A. Brizuela, and A. Tchernykh, An Experimental Comparison of Approximation Algorithms for the Shortest Common Superstring Problem, 5th Mexican International Conference on Computer Science, pp.27-34, 2004.

, Practical lower and upper bounds for the Shortest Linear Superstring

J. Tarhio and E. Ukkonen, A greedy approximation algorithm for constructing shortest common superstrings, Theoretical Computer Science, vol.57, pp.131-145, 1988.

E. Ukkonen, A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings, Algorithmica, vol.5, pp.313-323, 1990.

V. Vassilevska, Explicit inapproximability bounds for the shortest superstring problem, 30th Int. Symp. on Mathematical Foundations of Computer Science (MFCS), vol.3618, pp.793-800, 2005.

M. Weinard and G. Schnitger, On the greedy superstring conjecture, SIAM Journal on Discrete Mathematics, vol.20, issue.2, pp.502-522, 2006.