Computing regularities in strings: A survey

15Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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. © 2012 Elsevier Ltd.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free