The aim of this survey is to provide insight into the sequential algorithms that have been proposed to compute exact "regularities" in strings; that is, covers (or quasiperiods), seeds, repetitions, runs (or maximal periodicities), and repeats. After outlining and evaluating the algorithms that have been proposed for their computation, I suggest possibly productive future directions of research. © 2012 Elsevier Ltd.
Smyth, W. F. (2013). Computing regularities in strings: A survey. European Journal of Combinatorics, 34(1), 3–14. https://doi.org/10.1016/j.ejc.2012.07.010