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

H. Bunke and U. Buehler, Applications of approximate string matching to 2D shape recognition, Pattern Recognition, vol.26, issue.12, pp.1797-1812, 1993.
DOI : 10.1016/0031-3203(93)90177-X

B. Cazaux and E. Rivals, A linear time algorithm for Shortest Cyclic Cover of Strings, Journal of Discrete Algorithms, vol.37
DOI : 10.1016/j.jda.2016.05.001

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

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

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

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

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, Algorithms on Strings, Trees and Sequences, 1997.
DOI : 10.1017/CBO9780511574931

D. Gusfield, M. Gad, B. Landau, and . Schieber, An efficient algorithm for the all pairs suffix-prefix problem, Proc. Letters, pp.181-185, 1992.

R. Tak-wah-lam, A. Li, S. C. Tam, E. Wong, S. Wu et al., High throughput short read alignment via bi-directional BWT, Proc. IEEE BIBM, pp.31-36, 2009.

G. Navarro and L. M. Russo, Fast Fully-Compressed Suffix Trees, 2014 Data Compression Conference, pp.283-291, 2014.
DOI : 10.1109/DCC.2014.40

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

K. Sadakane, Compressed Suffix Trees with Full Functionality, Theory of Computing Systems, vol.41, issue.4, pp.589-607, 2007.
DOI : 10.1007/s00224-006-1198-x

T. Schnattinger, E. Ohlebusch, and S. Gog, Bidirectional search in a string with wavelet trees and bidirectional matching statistics, Information and Computation, vol.213, pp.13-22, 2012.
DOI : 10.1016/j.ic.2011.03.007

D. Strothmann, The affix array data structure and its applications to RNA secondary structure analysis, Theoretical Computer Science, vol.389, issue.1-2, pp.278-294, 2007.
DOI : 10.1016/j.tcs.2007.09.029