M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch, Replacing suffix trees with enhanced suffix arrays, Journal of Discrete Algorithms, vol.2, issue.1, pp.53-86, 2004.
DOI : 10.1016/S1570-8667(03)00065-0

URL : http://doi.org/10.1016/s1570-8667(03)00065-0

A. Apostolico, The myriad virtues of suffix trees, Combinatorial Algorithms on Words, pp.85-96, 1985.

M. Crochemore, Reducing space for index implementation, Theoretical Computer Science, vol.292, issue.1, pp.185-197, 2003.
DOI : 10.1016/S0304-3975(01)00222-5

URL : https://hal.archives-ouvertes.fr/hal-00619518

M. Crochemore, C. Epifanio, A. Gabriele, and F. Mignosi, On the Suffix Automaton with Mismatches, To appear in Lecture Notes in Computer Science. CIAA'07, 2007.
DOI : 10.1007/978-3-540-76336-9_15

URL : https://hal.archives-ouvertes.fr/hal-00620159

J. Fischer and V. Heun, Theoretical and practical improvements on the rmqproblem , with applications to lca and lce, Springer LNCS, volume 4009 of Proceedings of the 17th Annual Symposium on Combinatorial Pattern Match- ing(CPM'06), pp.36-48, 2006.

R. Grossi and G. F. Italiano, Suffix trees and their applications in string algorithms, Proceedings of the 1st South American Workshop on String Processing, pp.57-76, 1993.

D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, 1997.
DOI : 10.1017/CBO9780511574931

D. Harel and R. E. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors, SIAM Journal on Computing, vol.13, issue.2, pp.338-355, 1984.
DOI : 10.1137/0213024

L. C. Hui, Color set size problem with applications to string matching, Proceedings 3rd Symposium on Combinatorial Pattern Matching, pp.227-240, 1992.

L. C. Hui, A practical algorithm to find longest common substring in linear time, International Journal of Computer Systems Science & Engineering, vol.15, issue.2, pp.73-76, 2000.

S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa et al., On-line construction of compact directed acyclic word graphs, Discrete Applied Mathematics 12th Annual Symposium on Combinatorial Pattern Matching, pp.156-179, 2005.

M. G. Maas, Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem. Software Practice and Experience, pp.305-331, 2006.

E. M. Mccreight, A Space-Economical Suffix Tree Construction Algorithm, Journal of the ACM, vol.23, issue.2, pp.262-272, 1976.
DOI : 10.1145/321941.321946

B. Schieber and U. Vishkin, On Finding Lowest Common Ancestors: Simplification and Parallelization, SIAM Journal on Computing, vol.17, issue.6, pp.1253-1262, 1988.
DOI : 10.1137/0217079