A. Apostolico and A. Fraenkel, Robust transmission of unbounded strings using Fibonacci representations, IEEE Transactions on Information Theory, vol.33, issue.2, pp.238-245, 1987.
DOI : 10.1109/TIT.1987.1057284

G. Benson, Tandem repeats finder: a program to analyze DNA sequences, Nucleic Acids Research, vol.27, issue.2, pp.573-80, 1999.
DOI : 10.1093/nar/27.2.573

J. Buard and A. J. Jeffreys, Big, bad minisatellites, Nature Genetics, vol.13, issue.4, pp.327-335, 1997.
DOI : 10.1093/hmg/6.1.129

C. J. Bult, O. White, G. J. Olsen, L. Zhou, R. D. Fleischmann et al., Complete Genome Sequence of the Methanogenic Archaeon, Methanococcus jannaschii, Science, vol.273, issue.5278, pp.1058-73, 1996.
DOI : 10.1126/science.273.5278.1058

J. Claverie and D. J. States, Information enhancement methods for large scale sequence analysis, Computers & Chemistry, vol.17, issue.2, pp.191-201, 1993.
DOI : 10.1016/0097-8485(93)85010-A

E. Coward and F. Drabløs, Detecting periodic patterns in biological sequences, Bioinformatics, vol.14, issue.6, pp.498-507, 1998.
DOI : 10.1093/bioinformatics/14.6.498

R. Cox and S. M. Mirkin, Characteristic enrichment of DNA repeats in different genomes, Proceedings of the National Academy of Sciences, vol.22, issue.9, pp.5237-5279, 1997.
DOI : 10.1093/nar/22.9.1735

D. Field and C. Wills, Abundant microsatellite polymorphism in Saccharomyces cerevisiae, and the different distributions of microsatellites in eight prokaryotes and S. cerevisiae, result from strong mutation pressures and a variety of selective forces, Proceedings of the National Academy of Sciences, vol.21, issue.5147, pp.1647-52, 1998.
DOI : 10.1126/science.8303260

V. A. Fischetti, G. M. Landau, P. H. Sellers, and J. P. Schmidt, Identifying periodic occurrences of a template with applications to protein structure, Inf Proc Letters, vol.45, pp.11-18, 1993.
DOI : 10.1007/3-540-56024-6_9

A. Goffeau, B. G. Barrell, H. Bussey, R. W. Davis, B. Dujon et al., Life with 6000 Genes, Science, vol.274, issue.5287, pp.563-570, 1996.
DOI : 10.1126/science.274.5287.546

S. Grumbach and F. Tahi, Compression of DNA sequences, [Proceedings] DCC `93: Data Compression Conference, pp.340-350, 1993.
DOI : 10.1109/DCC.1993.253115

J. M. Hancock and J. S. Armstrong, SIMPLE34: an improved and enhanced implementation for VAX and Sun computers of the SIMPLE algorithm for analysis of clustered repetitive motifs in nucleotide sequences, Bioinformatics, vol.10, issue.1, pp.67-70, 1994.
DOI : 10.1093/bioinformatics/10.1.67

A. Hauth and D. A. Joseph, Beyond tandem repeats: complex pattern structures and distant regions of similarity, Bioinformatics, vol.18, issue.Suppl 1, pp.31-37, 2002.
DOI : 10.1093/bioinformatics/18.suppl_1.S31

M. V. Katti, P. K. Ranjekar, and V. S. Gupta, Differential Distribution of Simple Sequence Repeats in Eukaryotic Genome Sequences, Molecular Biology and Evolution, vol.18, issue.7, pp.1161-1168, 2001.
DOI : 10.1093/oxfordjournals.molbev.a003903

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

R. Kolpakov and G. Kucherov, Finding Approximate Repetitions under Hamming Distance, ESA: Annual European Symposium on Algorithms, pp.170-181, 2001.
DOI : 10.1007/3-540-44676-1_14

URL : https://hal.archives-ouvertes.fr/inria-00100491

G. M. Landau, J. P. Schmidt, and D. Sokol, An Algorithm for Approximate Tandem Repeats, Journal of Computational Biology, vol.8, issue.1, pp.1-18, 2001.
DOI : 10.1089/106652701300099038

M. Li and P. M. Vitanyi, Introduction to Kolmogorov Complexity and Its Applications, 1997.

M. Main and R. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, Journal of Algorithms, vol.5, issue.3, pp.422-432, 1984.
DOI : 10.1016/0196-6774(84)90021-X

E. Nadir, H. Margalit, T. Gallily, and S. A. Ben-sasson, Microsatellite spreading in the human genome: evolutionary mechanisms and structural implications., Proceedings of the National Academy of Sciences, vol.93, issue.13, pp.6470-6475, 1996.
DOI : 10.1073/pnas.93.13.6470

E. Rivals, M. Dauchet, J. Delahaye, and O. Delgrange, Compression and genetic sequence analysis, Biochimie, vol.78, issue.5, pp.315-322, 1996.
DOI : 10.1016/0300-9084(96)84763-8

E. Rivals, O. Delgrange, J. D. Dauchet, M. Delorme, A. Hénaut et al., Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences, Bioinformatics, vol.13, issue.2, pp.131-136, 1997.
DOI : 10.1093/bioinformatics/13.2.131

M. F. Sagot and E. W. Myers, Identifying Satellites and Periodic Repetitions in Biological Sequences, Journal of Computational Biology, vol.5, issue.3, pp.539-53, 1998.
DOI : 10.1089/cmb.1998.5.539

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

J. Stoye and D. Gusfield, Simple and flexible detection of contiguous repeats using a suffix tree, Theoretical Computer Science, vol.270, issue.1-2, pp.843-856, 2002.
DOI : 10.1016/S0304-3975(01)00121-9

J. Wootton and S. Federhen, Statistics of local complexity in amino acid sequences and sequence databases, Computers & Chemistry, vol.17, issue.2, pp.149-163, 1993.
DOI : 10.1016/0097-8485(93)85006-X