String Cadences
Data Structures and Algorithms
2016-10-12 v1
Abstract
We say a string has a cadence if a certain character is repeated at regular intervals, possibly with intervening occurrences of that character. We call the cadence anchored if the first interval must be the same length as the others. We give a sub-quadratic algorithm for determining whether a string has any cadence consisting of at least three occurrences of a character, and a nearly linear algorithm for finding all anchored cadences.
Keywords
Cite
@article{arxiv.1610.03337,
title = {String Cadences},
author = {Amihood Amir and Alberto Apostolico and Travis Gagie and Gad M. Landau},
journal= {arXiv preprint arXiv:1610.03337},
year = {2016}
}