Computing regularities in strings: A survey

W.F. Smyth
2013 European journal of combinatorics (Print)  
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.
doi:10.1016/j.ejc.2012.07.010 fatcat:4vdmvekfpngu3csv4zbz5sa4jy