暂无分享,去创建一个
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.
[1] Alberto Apostolico. Pattern Discovery and the Algorithmics of Surprise , 2002 .
[2] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[3] Paul Pritchard. Improved incremental prime number sieves , 1994, ANTS.