A. Amir, E. Eisenberg, and A. Levy, Approximate periodicity, Algorithms and Computation -21st International Symposium Proceedings, Part I, pp.25-36, 2010.
DOI : 10.1007/978-3-642-17517-6_5

A. Apostolico and F. P. 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

URL : https://doi.org/10.1016/0304-3975(83)90109-3

M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, 2007.
DOI : 10.1017/CBO9780511546853

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

M. Crochemore and L. Ilie, Computing Longest Previous Factor in linear time and applications, Information Processing Letters, vol.106, issue.2, pp.75-80, 2008.
DOI : 10.1016/j.ipl.2007.10.006

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

M. Crochemore, An optimal algorithm for computing the repetitions in a word, Information Processing Letters, vol.12, issue.5, pp.244-250, 1981.
DOI : 10.1016/0020-0190(81)90024-7

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

M. Crochemore, Recherche linéaire d'un carré dans un mot, C. R. Acad. Sc. Paris Sér. I Math, vol.296, issue.18, pp.781-784, 1983.

Z. Galil, R. Giancarlo, D. Gusfield, and J. Stoye, Improved string matching with k mismatches, ACM SIGACT News, vol.17, issue.4, pp.52-54525, 1986.
DOI : 10.1145/8307.8309

C. S. Iliopoulos, D. Moore, and W. F. 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. M. 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

S. , R. M. Kosaraju-[-lss01-]-g, J. P. Landau, D. Schmidt, and . Sokol, Computation of squares in a string (preliminary version) In CPM An algorithm for approximate tandem repeats, Journal of Computational Biology, vol.8, issue.1, pp.146-1501, 1994.

G. M. Landau and U. Vishkin, Fast parallel and serial approximate string matching, Journal of Algorithms, vol.10, issue.2, pp.157-169, 1989.
DOI : 10.1016/0196-6774(89)90010-2

M. G. Main, Detecting leftmost maximal periodicities, Discrete Applied Mathematics, vol.25, issue.1-2, pp.145-153, 1989.
DOI : 10.1016/0166-218X(89)90051-6

URL : https://doi.org/10.1016/0166-218x(89)90051-6

M. G. Main and R. J. 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

R. J. Parikh, On Context-Free Languages, Journal of the ACM, vol.13, issue.4, pp.570-581, 1966.
DOI : 10.1145/321356.321364

J. S. Sim, C. S. Iliopoulos, K. Park, and W. F. Smyth, Approximate Periods of Strings, Lecture Notes in Computer Science, vol.1, issue.4, pp.123-133, 1999.
DOI : 10.1089/cmb.1994.1.337

URL : https://doi.org/10.1016/s0304-3975(00)00365-0