On the cyclic regularities of strings
arXiv:1908.01664
summary
The paper presents efficient algorithms for detecting various cyclic regularities in strings, including cyclic periodicity, all cyclic periodicities, maximal local cyclic periodicity, and cyclic covers.
Abstract
Regularities in strings are often related to periods and covers, which have extensively been studied, and algorithms for their efficient computation have broad application. In this paper we concentrate on computing cyclic regularities of strings, in particular, we propose several efficient algorithms for computing: (i) cyclic periodicity; (ii) all cyclic periodicity; (iii) maximal local cyclic periodicity; (iv) cyclic covers.
Topics & keywords
#string algorithms#cyclic periodicity#covers#combinatorial pattern matching#data structurescyclic periodicitycyclic covermaximal local cyclic periodicityalgorithm designstring processing