Computing regularities in strings: A survey
Smyth, W.F. (2013) Computing regularities in strings: A survey. European Journal of Combinatorics, 34 (1). pp. 3-14.
*Subscription may be required
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.
Item Type: | Journal Article |
---|---|
Publisher: | Academic Press |
Copyright: | © 2012 Elsevier Ltd |
URI: | http://researchrepository.murdoch.edu.au/id/eprint/28194 |
![]() |
Item Control Page |
Downloads
Downloads per month over past year