id: 06106890
dt: j
an: 06106890
au: Smyth, W.F.
ti: Computing regularities in strings: a survey.
so: Eur. J. Comb. 34, No. 1, 3-14 (2013).
py: 2013
pu: Elsevier Science (Academic Press), London
la: EN
cc: 
ut: sequencial algorithms
ci: 
li: doi:10.1016/j.ejc.2012.07.010
ab: Summary: 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.
rv: