Efficient Algorithms to Compute Closed Substrings

Samkith K Jain, Neerja Mhaskar

A closed string $u$ is either of length one or contains a border that occurs only as a prefix and as a suffix in $u$ and nowhere else within $u$. In this paper, we present fast $\m…