Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424383 | European Journal of Combinatorics | 2013 | 12 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
W.F. Smyth,