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 and S. Lonardi, Compression of biological sequences by greedy off-line textual substitution, Proceedings DCC 2000. Data Compression Conference, pp.143-153, 2000.
DOI : 10.1109/DCC.2000.838154

A. Apostolico and S. Lonardi, Off-line compression by greedy textual substitution, Proceedings of the IEEE, vol.88, issue.11, pp.1733-1744, 2000.
DOI : 10.1109/5.892709
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.9094

A. Apostolico and F. Preparata, Data structures and algorithms for the string statistics problem, Algorithmica, vol.25, issue.3, pp.481-494, 1996.
DOI : 10.1007/BF01955046

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

G. W. Beadle and M. Beadle, The language of life: an introduction to the science of genetics, 1966.

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

J. Bentley and D. Mcilroy, Data compression using long common strings, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096), pp.287-295, 1999.
DOI : 10.1109/DCC.1999.755678
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.8470

R. Carrascosa, F. Coste, M. Gallé, and G. Infante-lopez, Choosing Word Occurrences for the Smallest Grammar Problem, Language and Automata Theory and Applications, p.12, 2010.
DOI : 10.1007/978-3-642-13089-2_13
URL : https://hal.archives-ouvertes.fr/inria-00476840

M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran et al., The Smallest Grammar Problem, IEEE Transactions on Information Theory, vol.51, issue.7, pp.2554-2576, 2005.
DOI : 10.1109/TIT.2005.850116

N. Chomsky, Syntactic Structures, 1957.
DOI : 10.1515/9783110218329

M. Gallé, P. Peterlongo, and F. Coste, IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS, International Journal of Foundations of Computer Science, vol.20, issue.06, pp.1025-1045, 2009.
DOI : 10.1142/S0129054109007029

S. Grumbach and F. Tahi, A new challenge for compression algorithms: Genetic sequences, Information Processing & Management, vol.30, issue.6, pp.875-886, 1994.
DOI : 10.1016/0306-4573(94)90014-0
URL : https://hal.archives-ouvertes.fr/inria-00180949

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

M. Karpinski, W. Rytter, and A. Shinohara, An efficient patternmatching algorithm for strings with short descriptions, Nordic Journal of Computing, vol.4, pp.172-186, 1997.

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

D. Klein, The Unsupervised Learning of Natural Language Structure, 2005.

N. Larsson and A. Moffat, Off-line dictionary-based compression, Proceedings of the IEEE, vol.88, issue.11, pp.1722-1732, 2000.
DOI : 10.1109/5.892708
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.9257

R. Nakamura, S. Inenaga, H. Bannai, T. Funamoto, M. Takeda et al., Linear-Time Text Compression by Longest-First Substitution, Algorithms, vol.2, issue.4, pp.1429-1448, 2009.
DOI : 10.3390/a2041429
URL : http://doi.org/10.3390/a2041429

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

C. G. Nevill-manning and I. H. Witten, Compression and Explanation using Hierarchical Grammars, The Computer Journal, vol.40, issue.2 and 3, pp.103-116, 1997.
DOI : 10.1093/comjnl/40.2_and_3.103

G. Nong, S. Zhang, and W. H. Chan, Two Efficient Algorithms for Linear Time Suffix Array Construction, IEEE Transactions on Computers, vol.60, issue.10, 2008.
DOI : 10.1109/TC.2010.188

S. J. Puglisi, W. F. Smyth, and M. Yusufu, Fast optimal algorithms for computing all the repeats in a string, pp.161-169, 2008.

W. Rytter, Application of Lempel???Ziv factorization to the approximation of grammar-based compression, Theoretical Computer Science, vol.302, issue.1-3, pp.211-222, 2003.
DOI : 10.1016/S0304-3975(02)00777-6

D. B. Searls, The language of genes, Nature, vol.10, issue.6912, pp.211-217, 2002.
DOI : 10.1038/29667

J. Wang, H. C. Liu, J. J. Tsai, and K. L. Ng, Scaling Behavior of Maximal Repeat Distributions in Genomic Sequences, International Journal of Cognitive Informatics and Natural Intelligence, vol.2, issue.3, pp.31-42, 2008.
DOI : 10.4018/jcini.2008070103