### Abstract

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^{4} log n) time with O (n^{3}) space, and in O (n^{4}) time with O (n^{2}) space, respectively, where n is the size of the input SLP-compressed strings.

Original language | English |
---|---|

Pages (from-to) | 900-913 |

Number of pages | 14 |

Journal | Theoretical Computer Science |

Volume | 410 |

Issue number | 8-10 |

DOIs | |

Publication status | Published - 2009 Mar 1 |

Externally published | Yes |

### Keywords

- Longest common substring
- Palindromes
- Straight line program
- String processing algorithms
- Text compression

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Efficient algorithms to compute compressed longest common substrings and compressed palindromes'. Together they form a unique fingerprint.

## Cite this

*Theoretical Computer Science*,

*410*(8-10), 900-913. https://doi.org/10.1016/j.tcs.2008.12.016