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

A. Apostolico and S. Lonardi, Compression of biological sequences by greedy offline textual substitution, Proc. Data Compression Conference, pp.143-152, 2000.

A. Apostolico and S. Lonardi, Off-line compression by greedy textual substitution, Proc. IEEE volume, pp.1733-1744, 2000.
DOI : 10.1109/5.892709

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

H. Chan, W. Hon, T. Lam, and K. Sadakane, Compressed indexes for dynamic text collections, ACM Transactions on Algorithms, vol.3, issue.2, 2007.
DOI : 10.1145/1240233.1240244

P. Ferragina, R. Grossi, and M. Montangero, On updating suffix tree labels, Theoretical Computer Science, vol.201, issue.1-2, pp.249-262, 1998.
DOI : 10.1016/S0304-3975(97)00243-0

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

M. Gu, M. Farach, and R. Beigel, An efficient algorithm for dynamic text indexing, Proc. ACM-SIAM symposium on Discrete Algorithms, pp.697-704, 1994.

J. Kärkkäinen and P. Sanders, Simple Linear Work Suffix Array Construction, Proc. International Conference on Automata, Languages and Programming, 2003.
DOI : 10.1007/3-540-45061-0_73

J. Kieffer and E. Yang, Grammar-based codes: a new class of universal lossless source codes, IEEE Transactions on Information Theory, vol.46, issue.3, 2000.
DOI : 10.1109/18.841160

P. Ko and S. Aluru, Space efficient linear time construction of suffix arrays, Proc. Combinatorial Pattern Matching volume 2676, pp.200-210, 2003.

R. Kolpakov and G. Kucherov, Finding maximal repetitions in a word in linear time, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.596-604, 1999.
DOI : 10.1109/SFFCS.1999.814634
URL : https://hal.archives-ouvertes.fr/inria-00098853

K. D. Kyue, S. J. Seop, P. Heejin, and P. Kunsoo, Linear time construction of suffix arrays, Proc. Combinatorial Pattern Matching volume 2676, pp.186-2003, 2003.

J. K. Lanctot, M. Li, and E. Yang, Estimating dna sequence entropy, Proc. ACM-SIAM symposium on Discrete Algorithms, pp.409-418, 2000.

N. J. Larsson and K. Sadakane, Faster suffix sorting, Theoretical Computer Science, vol.387, issue.3, 1999.
DOI : 10.1016/j.tcs.2007.07.017
URL : http://doi.org/10.1016/j.tcs.2007.07.017

M. A. Maniscalco and S. J. Puglisi, An efficient, versatile approach to suffix sorting, Journal of Experimental Algorithmics, vol.12, pp.1-23, 2008.
DOI : 10.1145/1227161.1278374

G. Manzini and P. Ferragina, Engineering a Lightweight Suffix Array Construction Algorithm, Algorithmica, vol.40, issue.1, pp.33-50, 2004.
DOI : 10.1007/s00453-004-1094-1

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

Y. Mori and Y. Mori, An implementation of the induced sorting algorithm, 2008.

R. Nakamura, H. Bannai, S. Inenaga, and M. Takeda, Simple Linear-Time Off-Line Text Compression by Longest-First Substitution, 2007 Data Compression Conference (DCC'07), 2007.
DOI : 10.1109/DCC.2007.70

C. Nevill-manning and I. Witten, Identifying hierarchical structure in sequences: A linear-time algorithm, Journal of Artificial Intelligence Research, vol.7, pp.67-82, 1997.

C. Nevill-manning and I. Witten, On-line and off-line heuristics for inferring hierarchies of repetitions in sequences, Proc. Data Compression Conference, 2000.
DOI : 10.1109/5.892710

S. Puglisi, W. Smyth, and A. Turpin, A taxonomy of suffix array construction algorithms, ACM Computing Surveys, vol.39, issue.2, 2007.
DOI : 10.1145/1242471.1242472

S. C. Sahinalp and U. Vishkin, Efficient approximate and dynamic matching of patterns using a labeling paradigm, Proceedings of 37th Conference on Foundations of Computer Science, 1996.
DOI : 10.1109/SFCS.1996.548491

M. Salson, T. Lecroq, M. Léonard, and L. Mouchard, Dynamic burrows-wheeler transform, Proc. Prague Stringology Club, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00469530

K. Schürmann and J. Stoye, An incomplex algorithm for fast suffix array construction, Software: Practice and Experience, vol.12, issue.3, pp.309-329, 2007.
DOI : 10.1002/spe.768

J. S. Sim, Time and Space Efficient Search for Small Alphabets with Suffix Arrays, Proc. Conference on Fuzzy Systems and Knowledge Discovery, 2005.
DOI : 10.1007/11539506_136

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

S. Zhang, G. Nong, and W. H. Chan, Fast and Space Efficient Linear Suffix Array Construction, Data Compression Conference (dcc 2008), 2008.
DOI : 10.1109/DCC.2008.61