A. V. Aho and M. J. Corasick, Efficient string matching, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.

L. Arge, G. S. Brodal, and L. Georgiadis, Improved Dynamic Planar Point Location, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.305-314, 2006.

C. Armen and C. Stein, A 2 2/3-approximation algorithm for the shortest superstring problem, Combinatorial Pattern Matching, pp.87-101, 1996.

F. Bassino, J. Clément, and P. Nicodème, Counting occurrences for a finite set of words, ACM Transactions on Algorithms, vol.8, issue.3, pp.1-28, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00452694

M. Berg, M. Kreveld, M. Overmars, and O. Schwarzkopf, Computational geometry: Algorithms and applications, 2008.

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.

B. Cazaux, R. Canovas, and E. Rivals, Shortest DNA Cyclic Cover in Compressed Space, 2016 Data Compression Conference (DCC), vol.18, p.14, 2016.
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.
URL : https://hal.archives-ouvertes.fr/lirmm-01240278

B. Cazaux and E. Rivals, Hierarchical Overlap Graph, Information Processing Letters, vol.155, p.105862, 2020.
URL : https://hal.archives-ouvertes.fr/lirmm-01674319

T. P. Gevezes and L. S. Pitsoulis, Recognition of overlap graphs, Journal of Combinatorial Optimization, vol.28, issue.1, pp.25-37, 2013.

Y. Giora and H. Kaplan, Optimal dynamic vertical ray shooting in rectilinear planar subdivisions, ACM Transactions on Algorithms, vol.5, issue.3, pp.1-51, 2009.

G. Gonnella and S. Kurtz, Readjoiner: a fast and memory efficient string graph-based sequence assembler, BMC Bioinformatics, vol.13, issue.1, p.82, 2012.

G. Gonnella and S. Kurtz, Readjoiner: a fast and memory efficient string graph-based sequence assembler, BMC Bioinformatics, vol.13, issue.1, 2012.

L. J. Guibas and A. M. Odlyzko, Periods in strings, Journal of Combinatorial Theory, Series A, vol.30, issue.1, pp.19-42, 1981.

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.

T. Hagerup, Sorting and searching on the word RAM, STACS 98, pp.366-398, 1998.

I. , T. Inenaga, S. Bannai, H. Takeda, and M. , Inferring strings from suffix trees and links on a binary alphabet, Discrete Applied Mathematics, vol.163, pp.316-325, 2014.

P. Jacquet and W. Szpankowski, Autocorrelation on words and its applications, Journal of Combinatorial Theory, Series A, vol.66, issue.2, pp.237-269, 1994.
URL : https://hal.archives-ouvertes.fr/inria-00075453

J. Karkkainen, M. Piatkowski, and S. J. Puglisi, String inference from longestcommon-prefix array, ICALP. LIPIcs, vol.80, p.14, 2017.

A. Laaksonen, Guide to Competitive Programming, pp.246-248, 2017.

J. Lim and K. Park, A fast algorithm for the all-pairs suffix?prefix problem, Theoretical Computer Science, vol.698, pp.14-24, 2017.

M. Mucha, Lyndon Words and Short Superstrings, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013.

E. W. Myers, The fragment assembly string graph, Bioinformatics, vol.21, issue.Suppl 2, pp.ii79-ii85, 2005.

K. Paluch, Better approximation algorithms for maximum asymmetric traveling salesman and shortest superstring, 2014.

G. Park, H. Hwang, P. Nicodème, and W. Szpankowski, Profiles of Tries, SIAM Journal on Computing, vol.38, issue.5, pp.1821-1880, 2009.

H. Peltola and J. Tarhio, Alternative Algorithms for Bit-Parallel String Matching, String Processing and Information Retrieval, pp.80-93, 2003.

P. A. Pevzner, H. Tang, and M. S. Waterman, An Eulerian path approach to DNA fragment assembly, Proceedings of the National Academy of Sciences, vol.98, issue.17, pp.9748-9753, 2001.

M. H. Rachid and Q. Malluhi, A practical and scalable tool to find overlaps between sequences, BioMed Research International, 2015.

M. Haj-rachid and Q. Malluhi, A Practical and Scalable Tool to Find Overlaps between Sequences, BioMed Research International, vol.2015, pp.1-12, 2015.

S. Robin, F. Rodolphe, and S. Schbath, DNA, Words and Models, 2005.
URL : https://hal.archives-ouvertes.fr/hal-02829582

Z. Sweedyk, \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring, SIAM Journal on Computing, vol.29, issue.3, pp.954-986, 2000.