A. V. Aho and M. J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.
DOI : 10.1145/360825.360855

A. Apostolico and D. Breslauer, Of periods, quasiperiods, repetitions and covers, pp.236-248, 1997.
DOI : 10.1007/3-540-63246-8_14
URL : http://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2353&context=cstech

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

A. Apostolico, M. Farach, and C. S. Iliopoulos, Optimal superprimitivity testing for strings, Information Processing Letters, vol.39, issue.1, pp.17-20, 1991.
DOI : 10.1016/0020-0190(91)90056-N
URL : http://www.cs.rutgers.edu/~farach/pubs/SuperPrim.pdf

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
URL : http://www.cs.columbia.edu/~library/TR-repository/reports/reports-1992/cucs-022-92.ps.gz

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
URL : http://www.daimi.au.dk/~cstorm/courses/StrAlg_e05/papers/BrodalPedersen2000_Quasi.pdf

M. Christou, M. Crochemore, C. S. Iliopoulos, M. Kubica, S. P. Pissis et al., Efficient Seeds Computation Revisited, CPM, pp.350-363, 2011.
DOI : 10.1016/j.jda.2006.03.011
URL : https://hal.archives-ouvertes.fr/hal-00742061

J. Fischer and V. Heun, A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array, ESCAPE 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 15th Annual ACM Symposium on Theory of Computing (STOC), pp.246-251, 1983.

D. Harel and R. E. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors, SIAM Journal on Computing, vol.13, issue.2, pp.338-355, 1984.
DOI : 10.1137/0213024

C. S. Iliopoulos, D. W. Moore, and K. Park, Covering a string, Algorithmica, vol.6, issue.3, pp.288-297, 1996.
DOI : 10.1016/B978-0-12-417750-5.50022-1

J. Kärkkäinen and P. Sanders, Simple Linear Work Suffix Array Construction, ICALP, pp.943-955, 2003.
DOI : 10.1007/3-540-45061-0_73

P. Ko and S. Aluru, Space Efficient Linear Time Construction of Suffix Arrays, Lecture Notes in Computer Science, vol.2676, pp.200-210, 2003.
DOI : 10.1007/3-540-44888-8_15

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

D. Moore and W. F. Smyth, Computing the covers of a string in linear time, pp.511-515, 1994.