A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Computing regularities in strings: A survey
2013
European journal of combinatorics (Print)
Preserved Fulltext
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