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(n4 log n) time with O(n3) space, and in O(n 4) time with O(n2) space, respectively, where n is the size of the input SLP-compressed strings. © Springer-Verlag Berlin Heidelberg 2008.
CITATION STYLE
Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T., & Hashimoto, K. (2008). Computing longest common substring and all palindromes from compressed strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4910 LNCS, pp. 364–375). Springer Verlag. https://doi.org/10.1007/978-3-540-77566-9_31
Mendeley helps you to discover research relevant for your work.