On the cyclic regularities of strings
Data Structures and Algorithms
2019-08-06 v1
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.
Cite
@article{arxiv.1908.01664,
title = {On the cyclic regularities of strings},
author = {Oluwole Ajala and Miznah Alshammary and Mai Alzamel and Jia Gao and Costas Iliopoulos and Jakub Radoszewski and Wojciech Rytter and Bruce Watson},
journal= {arXiv preprint arXiv:1908.01664},
year = {2019}
}