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

A. Blum, T. Jiang, and M. Li, John Tromp, and Mihalis Yannakakis. Linear approximation of shortest superstrings, ACM Symposium on the Theory of Computing, pp.328-336, 1991.

R. Cánovas, B. Cazaux, and E. Rivals, The Compressed Overlap Index. CoRR, abs, 1707.

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, A linear time algorithm for Shortest Cyclic Cover of Strings, Journal of Discrete Algorithms, vol.37, pp.56-67, 2016.
DOI : 10.1016/j.jda.2016.05.001

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

A. Golovnev, A. S. Kulikov, and I. Mihajlin, Solving SCS for bounded length strings in fewer than steps, Proc. Letters, pp.421-425, 2014.
DOI : 10.1016/j.ipl.2014.03.004

D. Gusfield, M. Gad, B. Landau, and . 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. Lim and K. Park, A fast algorithm for the all-pairs suffix???prefix problem, Theoretical Computer Science, vol.698, 2017.
DOI : 10.1016/j.tcs.2017.07.013

H. Peltola, H. Söderlund, J. Tarhio, and E. Ukkonen, Algorithms for some string matching problems arising in molecular genetics, IFIP Congress, pp.59-64, 1983.

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

H. A. William, S. Tustumi, G. P. Gog, F. A. Telles, and . Louza, An improved algorithm for the all-pairs suffix?prefix problem, J. of Discrete Algorithms, vol.37, pp.34-43, 2016.

E. Ukkonen, A linear-time algorithm for finding approximate shortest common superstrings, Algorithmica, vol.57, issue.1-4, pp.313-323, 1990.
DOI : 10.1007/BF01840391

N. Välimäki, S. Ladra, and V. Mäkinen, Approximate all-pairs suffix/prefix overlaps, Information and Computation, vol.213, pp.49-58, 2012.
DOI : 10.1016/j.ic.2012.02.002