Computing Covers under Substring Consistent Equivalence Relations

Natsumi Kikuchi, Diptarama Hendrian, Ryo Yoshinaka +1

Covers are a kind of quasiperiodicity in strings. A string $C$ is a cover of another string $T$ if any position of $T$ is inside some occurrence of $C$ in $T$. The shortest and lon…