F. [. Apostolico and . Preparata, Optimal off-line detection of repetitions in a string, Theoretical Computer Science, vol.22, issue.3, pp.297-315, 1983.
DOI : 10.1016/0304-3975(83)90109-3

A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen et al., The smallest automation recognizing the subwords of a text, Theoretical Computer Science, vol.40, pp.31-55, 1985.
DOI : 10.1016/0304-3975(85)90157-4

R. [. Brodal, . Lyngsø, . Ch, J. Pedersen, and . Stoye, Finding maximal pairs with bounded gap, Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching, volume 1645 of Lecture Notes in Computer Science, 1999.
DOI : 10.7146/brics.v6i12.20069
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.3937

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

W. [. Crochemore and . Rytter, Squares, cubes, and time-space efficient string searching, Algorithmica, vol.67, issue.3, pp.405-425, 1995.
DOI : 10.1007/BF01190846
URL : https://hal.archives-ouvertes.fr/hal-00619583

]. M. Cro81 and . Crochemore, An optimal algorithm for computing the repetitions in a word, Information Processing Letters, vol.12, pp.244-250, 1981.

]. M. Cro83 and . Crochemore, Recherche linéaire d'un carré dans un mot, Comptes Rendus Acad. Sci. Paris Sér. I Math, vol.296, pp.781-784, 1983.

]. M. Cro86 and . Crochemore, Transducers and repetitions, Theoretical Computer Science, vol.45, pp.63-86, 1986.

]. D. Gus97 and . Gusfield, Algorithms on Strings, Trees, and Sequences, 1997.

D. [. Iliopoulos, W. F. Moore, and . Smyth, A characterization of the squares in a Fibonacci string, Theoretical Computer Science, vol.172, issue.1-2, pp.281-291, 1997.
DOI : 10.1016/S0304-3975(96)00141-7

]. R. Kk99a, G. Kolpakov, and . Kucherov, Finding maximal repetitions in a word in linear time, Proceedings of the 1999 Symposium on Foundations of Computer Science

]. R. Kk99b, G. Kolpakov, and . Kucherov, On maximal repetitions in words, Proceedings of the 12- th International Symposium on Fundamentals of Computation Theory, 1999.

R. Kolpakov and G. Kucherov, Finding repeats with fixed gap, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000, 2000.
DOI : 10.1109/SPIRE.2000.878192
URL : https://hal.archives-ouvertes.fr/inria-00107855

]. S. Kos94 and . Kosaraju, Computation of squares in string, Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, number 807 in Lecture Notes in Computer Science, pp.146-150, 1994.

J. [. Lempel and . Ziv, On the Complexity of Finite Sequences, IEEE Transactions on Information Theory, vol.22, issue.1, pp.75-81, 1976.
DOI : 10.1109/TIT.1976.1055501

]. M. Mai89 and . Main, Detecting leftmost maximal periodicities, Discrete Applied Mathematics, vol.25, pp.145-153, 1989.

]. E. Mcc76 and . Mccreight, A space-economical suffix tree construction algorithm, Journal of the ACM, vol.23, issue.2, pp.262-272, 1976.

R. [. Main, . Lorentz, ¢. ¤. An, R. J. Main, and . Lorentz, An O(n log n) algorithm for finding all repetitions in a string, Combinatorial Algorithms on Words, pp.422-432, 1984.
DOI : 10.1016/0196-6774(84)90021-X

V. [. Rodeh, S. Pratt, and . Even, Linear Algorithm for Data Compression via String Matching, Journal of the ACM, vol.28, issue.1, pp.16-24, 1981.
DOI : 10.1145/322234.322237

]. J. Sg98a, D. Stoye, and . Gusfield, Simple and flexible detection of contiguous repeats using a suffix tree, Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, number 1448 in Lecture Notes in Computer Science, pp.140-152

]. J. Sg98b, D. Stoye, and . Gusfield, Linear time algorithms for finding and representing all the tandem repeats in a string, 1998.

]. A. Sli83 and . Slisenko, Detection of periodicities and string matching in real time, Journal of Soviet Mathematics, vol.22, pp.1316-1386, 1983.

]. J. Sto88 and . Storer, Data Compression: Methods and Theory, 1988.

]. E. Ukk95 and . Ukkonen, On-line construction of suffix trees, Algorithmica, vol.14, issue.3, pp.249-260, 1995.

A. [. Ziv and . Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977.
DOI : 10.1109/TIT.1977.1055714