H. Alamro, G. Badkobeh, D. Belazzougui, S. Costas, S. J. Iliopoulos et al., Computing the antiperiod (s) of a string, 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019.

M. Alzamel, A. Conte, D. Greco, V. Guerrini, C. Iliopoulos et al., Online algorithms on antipowers and antiperiods, String Processing and Information Retrieval, pp.175-188, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02336623

A. Apostolico and A. Ehrenfeucht, Efficient detection of quasiperiodicities in strings, Theoretical Computer Science, vol.119, issue.2, pp.247-265, 1993.

A. Apostolico, M. Farach, and . Costas-s-iliopoulos, Optimal superprimitivity testing for strings, Information Processing Letters, vol.39, issue.1, pp.17-20, 1991.

B. Aspvall, M. F. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Inf. Process. Lett, vol.8, issue.3, pp.121-123, 1979.

G. Badkobeh, G. Fici, and S. J. Puglisi, Algorithms for anti-powers in strings, Information Processing Letters, vol.137, pp.57-60, 2018.

A. Condon, J. Ma?uch, and C. Thachuk, The complexity of string partitioning, J. Discrete Algorithms, vol.32, pp.24-43, 2015.

A. Conte, R. Grossi, and A. Marino, Large-scale clique cover of real-world networks, Special Issue on 26th London Stringology Days & London Algorithmic Workshop (LSD & LAW), vol.270, 2020.

M. Crochemore and W. Rytter, Jewels of stringology: text algorithms, 2002.

G. Fici, A. Restivo, M. Silva, and L. Zamboni, Anti-powers in infinite words, Journal of Combinatorial Theory, Series A, vol.157, pp.109-119, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01829146

V. Fedor, D. Fomin, and . Kratsch, Exact Exponential Algorithms, 2010.

D. Gusfield, Algorithms on strings, trees, and sequences, Computer Science and Computational Biology, 1997.

T. Kociumaka, M. Kubica, J. Radoszewski, W. Rytter, and T. Wale?, A linear time algorithm for seeds computation, Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms, pp.1095-1112, 2012.

R. Kolpakov, G. Bana, and G. Kucherov, mreps: efficient and flexible detection of tandem repeats in DNA, Nucleic acids research, vol.31, issue.13, pp.3672-3678, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099597

Y. Li, F. William, and . Smyth, Computing the cover array in linear time, Algorithmica, vol.32, issue.1, pp.95-106, 2002.

M. Lothaire, Applied combinatorics on words, vol.105, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00620607

M. Lothaire and M. Lothaire, Algebraic combinatorics on words, vol.90, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00620608

S. Radu, A. Mincu, and . Popa, The maximum equality-free string factorization problem: Gaps vs. no gaps, SOFSEM 2020: Theory and Practice of Computer Science, pp.531-543, 2020.

D. Moore and W. F. Smyth, Computing the covers of a string in linear time, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '94, pp.511-515, 1994.

D. Moore, F. William, and . Smyth, An optimal algorithm to compute all the covers of a string, Information Processing Letters, vol.50, issue.5, pp.239-246, 1994.

Z. Robert, . Norman, and . Michael-o-rabin, An algorithm for a minimum cover of a graph, Proceedings of the American Mathematical Society, vol.10, issue.2, pp.315-319, 1959.

C. A. Tovey, A simplified NP-complete satisfiability problem, Discrete Applied Mathematics, vol.8, issue.1, pp.85-89, 1984.