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

B. Cazaux and E. Rivals, Reverse engineering of compact suffix trees and links: A novel algorithm, Journal of Discrete Algorithms, vol.28, issue.1, pp.9-22, 2014.
DOI : 10.1016/j.jda.2014.07.002
URL : https://hal.archives-ouvertes.fr/lirmm-01082098

I. Tomohiro, S. Inenaga, H. Bannai, and M. Takeda, Inferring strings from suffix trees and links on a binary alphabet, Proceedings of the Prague Stringology Conference 2011, pp.121-130, 2011.

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

E. 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

N. Philippe, Caractérisation et énumération des arbres compacts des suffixes, 2007.

E. Ukkonen, On-line construction of suffix trees, Algorithmica, vol.10, issue.3, pp.249-260, 1995.
DOI : 10.1007/BF01206331

P. Weiner, Linear pattern matching algorithms, 14th Annual Symposium on Switching and Automata Theory (swat 1973), pp.1-11, 1973.
DOI : 10.1109/SWAT.1973.13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.474.9582