Journal article
Computing regularities in strings: A survey
European Journal of Combinatorics, Vol.34(1), pp.3-14
2013
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.
Details
- Title
- Computing regularities in strings: A survey
- Authors/Creators
- W.F. Smyth (Author/Creator) - McMaster University
- Publication Details
- European Journal of Combinatorics, Vol.34(1), pp.3-14
- Publisher
- Academic Press
- Identifiers
- 991005544212807891
- Copyright
- © 2012 Elsevier Ltd
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Journal article
Metrics
145 File views/ downloads
87 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Citation topics
- 4 Electrical Engineering, Electronics & Computer Science
- 4.182 Data Structures, Algorithms & Complexity
- 4.182.1103 Efficient Algorithms
- Web Of Science research areas
- Mathematics
- ESI research areas
- Mathematics