Fast Algorithm for Partial Covers in Words

Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter +2

A factor $u$ of a word $w$ is a cover of $w$ if every position in $w$ lies within some occurrence of $u$ in $w$. A word $w$ covered by $u$ thus generalizes the idea of a repetition…