Shortest covers of all cyclic shifts of a string

Maxime Crochemore,Costas S. Iliopoulos,Jakub Radoszewski,Wojciech Rytter,Juliusz Straszyński,Tomasz Waleń,Wiktor Zuba

Theoretical Computer Science（2021）

引用 0|浏览1

暂无评分

摘要

•Computing shortest covers of cyclic shifts of a string is considered.•This problem extends in a natural way previous results on quasiperiodicity.•We give an O(n log n)-time algorithm for this problem.•Shortest covers of cyclic shifts of a Fibonacci string are also characterized.

查看译文

关键词

Cover,Quasiperiod,Seed,Fibonacci string

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要