Efficient algorithms to compute compressed longest common substrings and compressed palindromes

This paper studies two problems on compressed strings described in terms of straight line programs (SLPs). One is to compute the length of the longest common substring of two given SLP-compressed strings, and the other is to compute all palindromes of a given SLP-compressed string. In order to solve these problems efficiently (in polynomial time w.r.t. the compressed size) decompression is never feasible, since the decompressed size can be exponentially large. We develop combinatorial algorithms that solve these problems in O (n⁴ log n) time with O (n³) space, and in O (n⁴) time with O (n²) space, respectively, where n is the size of the input SLP-compressed strings.