R. B. Gerth-stølting-brodal, C. N. Lyngsø, J. Pedersen, and . Stoye, Finding maximal pairs with bounded gap, Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching, pp.134-14910, 1999.

M. Crochemore, R. Kolpakov, and G. Kucherov, Optimal Bounds for Computing $$\alpha $$ ?? -gapped Repeats, Proceedings of the 10th International Conference on Language and Automata Theory and Applications, pp.245-255, 2016.
DOI : 10.1007/978-3-319-30000-9_19

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

M. Dumitran and F. Manea, Longest Gapped Repeats and Palindromes, Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, pp.205-21710, 2015.
DOI : 10.1007/978-3-662-48057-1_16
URL : http://arxiv.org/pdf/1511.07180

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Gawrychowski, I. Tomohiro, S. Inenaga, D. Köppl, and F. Manea, Efficiently finding all maximal ?-gapped repeats, Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), volume 47 of LIPIcs:14. Schloss Dagstuhl ? Leibniz-Zentrum für Informatik, pp.1-39, 2016.

P. Gawrychowski and F. Manea, Longest $$\alpha $$ ?? -Gapped Repeat and Palindrome, Proceedings of the 20th International Symposium on Fundamentals of Computation Theory, pp.27-40978, 2015.
DOI : 10.1007/978-3-319-22177-9_3

A. Glen and J. Simpson, The total run length of a word, Theoretical Computer Science, vol.501, pp.41-48
DOI : 10.1016/j.tcs.2013.06.004

L. J. Guibas and A. M. Odlyzko, String overlaps, pattern matching, and nontransitive games, Journal of Combinatorial Theory, Series A, vol.30, issue.2, pp.183-20810, 1981.
DOI : 10.1016/0097-3165(81)90005-4
URL : https://doi.org/10.1016/0097-3165(81)90005-4

R. Kolpakov and G. Kucherov, Searching for gapped palindromes, Theoretical Computer Science, vol.410, issue.51, pp.5365-5373, 2009.
DOI : 10.1016/j.tcs.2009.09.013
URL : http://www.lifl.fr/~kucherov/PAPERS/KolpakovKucherovCPM08.pdf

R. Kolpakov, M. Podolskiy, M. Posypkin, and N. Khrapov, Searching of gapped repeats and subrepetitions in a word, Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching, pp.212-221, 2014.
DOI : 10.1016/j.jda.2017.10.004

M. Roman, G. Kolpakov, and . Kucherov, Finding repeats with fixed gap, Proceedings of the 7th International Symposium on String Processing and Information Retrieval, pp.162-16810, 2000.

C. Nicaud, Estimating statistics on words using ambiguous descriptions, Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching Schloss Dagstuhl ? Leibniz-Zentrum für Informatik, pp.1-9, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01769095

J. Simon, J. Puglisi, and . Simpson, The expected number of runs in a word URL: https, Australas. J. Comb, vol.42, pp.45-54, 2008.

M. Rubinchik and A. M. Shur, The Number of Distinct Subpalindromes in Random Words, Fundamenta Informaticae, vol.145, issue.3, pp.371-38410, 2016.
DOI : 10.3233/FI-2016-1366
URL : http://arxiv.org/pdf/1505.08043

M. Arseny and . Shur, Growth properties of power-free languages, Comput. Sci. Rev, vol.6, pp.5-6187

Y. Tanimura, Y. Fujishige, I. Tomohiro, S. Inenaga, H. Bannai et al., A Faster Algorithm for Computing Maximal $$\alpha $$ -gapped Repeats in a String, Proceedings of the 22nd International Symposium on String Processing and Information Retrieval, pp.124-13610, 2015.
DOI : 10.1007/978-3-319-23826-5_13