R. Arnold and T. Bell, A corpus for the evaluation of lossless compression algorithms, Proceedings DCC '97. Data Compression Conference, pp.201-210, 1997.
DOI : 10.1109/DCC.1997.582019

A. Apostolico and W. Szpankowski, Self-alignments in words and their applications, Journal of Algorithms, vol.13, issue.3, pp.446-467, 1992.
DOI : 10.1016/0196-6774(92)90049-I

A. Brazma, I. Jonassen, J. Vilo, and E. Ukkonen, Predicting gene regulatory elements in silico on a genomic scale, Genome Research, vol.11, pp.1202-1215, 1998.

T. C. Bell, J. G. Cleary, and I. H. Witten, Text Compression, 1990.

M. Crochemore and W. Rytter, Text Algorithms, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00619796

M. Crochemore and W. Rytter, Jewels of Stringology, 2002.
DOI : 10.1142/4838
URL : https://hal.archives-ouvertes.fr/hal-00619795

B. Dorohonceanu and C. G. Nevill-manning, Accelerating Protein Classification Using Suffix Tree, Proc. 8th Intl. Conference on Intelligent Systems for Molecular Biology ISMB 2000, pp.128-133, 2000.

R. Giegerich and S. Kurtz, From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction, Algorithmica, vol.19, issue.3, pp.331-353, 1997.
DOI : 10.1007/PL00009177

R. Giegerich, S. Kurtz, and J. Stoye, Efficient implementation of lazy suffix trees, Proc. of the Third Workshop on Algorithmic Engineering (WAE99), pp.30-42, 1999.
DOI : 10.1002/spe.535

E. R. Fiala and D. H. Greene, Data compression with finite windows, Communications of the ACM, vol.32, issue.4, pp.490-505, 1989.
DOI : 10.1145/63334.63341

R. Giegerich, S. Kurtz, and J. Stoye, Efficient implementation of lazy suffix trees, Proc. Third Worshop on Algorithm Engineering WAE' 99, pp.30-42, 1999.
DOI : 10.1002/spe.535

D. Gusfield, Algorithms on strings, trees and sequences: computer science and computational biology, 1997.
DOI : 10.1017/CBO9780511574931

S. Kurtz, Reducing the Space Requirement of Suffix Trees. Software: Practice and Experience, pp.1149-1171, 1999.

N. Larsson, Structures of String Matching and Data Compression, 1999.

N. Larsson, Extended application of suffix trees to data compression, Proceedings of Data Compression Conference, DCC '96, pp.190-199, 1996.
DOI : 10.1109/DCC.1996.488324

L. Marsan and M. Sagot, Extracting structured motifs using a suffix tree ? algorithms and application to promoter consensus identification, RECOMB, pp.210-219, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00427093

E. M. Mccreight, A space-economical suffix tree construction algorithm J. Algorithms, pp.262-272, 1976.

J. I. Munro, V. Raman, S. Rao, and S. , Space Efficient Suffix Trees, Journal of Algorithms, vol.39, issue.2, pp.205-222, 2001.
DOI : 10.1006/jagm.2000.1151
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.5337

J. H. Na and K. Park, Data Compression with Truncated Suffix Trees, Data Compression Conference, pp.565-565, 2000.

M. Sagot, C. L. Lucchesi, and A. V. Moura, Spelling approximate repeated or common motifs using a suffix tree, Proceedings of the Third Latin American Symposium, pp.374-390, 1998.
DOI : 10.1007/BFb0054337
URL : https://hal.archives-ouvertes.fr/hal-00428511

W. Szpankowski, A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors, SIAM Journal on Computing, vol.22, issue.6, pp.1176-1198, 1993.
DOI : 10.1137/0222070

E. Ukkonen, On-line construction of suffix trees Algorithmica, pp.249-260, 1995.

A. Vanet, L. Marsan, and M. Sagot, Promoter sequences and algorithmical methods for identifying them, Research in Microbiology, vol.150, issue.9-10, pp.779-799, 1998.
DOI : 10.1016/S0923-2508(99)00115-1
URL : https://hal.archives-ouvertes.fr/hal-00428461

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