A. Apostolico and D. Breslauer, Of periods, quasiperiods, repetitions and covers, Structures in Logic and Computer Science, pp.236-248, 1997.
DOI : 10.1007/3-540-63246-8_14

A. Apostolico and A. Ehrenfeucht, Efficient detection of quasiperiodicities in strings, Theoretical Computer Science, vol.119, issue.2, pp.247-265, 1993.
DOI : 10.1016/0304-3975(93)90159-Q

O. Berkman, C. S. Iliopoulos, and K. Park, The Subtree Max Gap Problem with Application to Parallel String Covering, Information and Computation, vol.123, issue.1, pp.127-137, 1995.
DOI : 10.1006/inco.1995.1162

D. Breslauer, An on-line string superprimitivity test, Information Processing Letters, vol.44, issue.6, pp.345-347, 1992.
DOI : 10.1016/0020-0190(92)90111-8

G. S. Brodal and C. N. Pedersen, Finding Maximal Quasiperiodicities in Strings, Lecture Notes in Computer Science, vol.1848, pp.397-411, 2000.
DOI : 10.1007/3-540-45123-4_33

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, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter et al., Extracting Powers and Periods in a String from Its Runs Structure, Lecture Notes in Computer Science, vol.6393, pp.258-269, 2010.
DOI : 10.1007/978-3-642-16321-0_27
URL : https://hal.archives-ouvertes.fr/hal-00742047

M. Crochemore and W. Rytter, Jewels of Stringology, World Scientific, 2003.
DOI : 10.1142/4838
URL : https://hal.archives-ouvertes.fr/hal-00619795

J. Fischer and V. Heun, A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array, Lecture Notes in Computer Science, vol.4614, pp.459-470, 2007.
DOI : 10.1007/978-3-540-74450-4_41

H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.246-251, 1983.
DOI : 10.1145/800061.808753

C. S. Iliopoulos, D. W. Moore, and K. Park, Covering a string, Algorithmica, vol.6, issue.3, pp.288-297, 1996.
DOI : 10.1007/BF01955677

Y. Li and W. F. Smyth, Computing the Cover Array in Linear Time, Algorithmica, vol.32, issue.1, pp.95-106, 2002.
DOI : 10.1007/s00453-001-0062-2

K. Sadakane, Succinct data structures for flexible text retrieval systems, Journal of Discrete Algorithms, vol.5, issue.1, pp.12-22, 2007.
DOI : 10.1016/j.jda.2006.03.011