### 抄録

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.

元の言語 | English |
---|---|

ページ（範囲） | 900-913 |

ページ数 | 14 |

ジャーナル | Theoretical Computer Science |

巻 | 410 |

発行部数 | 8-10 |

DOI | |

出版物ステータス | Published - 2009 3 1 |

外部発表 | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### これを引用

*Theoretical Computer Science*,

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

**Efficient algorithms to compute compressed longest common substrings and compressed palindromes.** / Matsubara, Wataru; Inenaga, Shunsuke; Ishino, Akira; Shinohara, Ayumi; Nakamura, Tomoyuki; Hashimoto, Kazuo.

研究成果: Article

*Theoretical Computer Science*, 巻. 410, 番号 8-10, pp. 900-913. https://doi.org/10.1016/j.tcs.2008.12.016

}

TY - JOUR

T1 - Efficient algorithms to compute compressed longest common substrings and compressed palindromes

AU - Matsubara, Wataru

AU - Inenaga, Shunsuke

AU - Ishino, Akira

AU - Shinohara, Ayumi

AU - Nakamura, Tomoyuki

AU - Hashimoto, Kazuo

PY - 2009/3/1

Y1 - 2009/3/1

N2 - 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 (n4) time with O (n2) space, respectively, where n is the size of the input SLP-compressed strings.

AB - 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 (n4) time with O (n2) space, respectively, where n is the size of the input SLP-compressed strings.

KW - Longest common substring

KW - Palindromes

KW - Straight line program

KW - String processing algorithms

KW - Text compression

UR - http://www.scopus.com/inward/record.url?scp=59049103692&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=59049103692&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2008.12.016

DO - 10.1016/j.tcs.2008.12.016

M3 - Article

AN - SCOPUS:59049103692

VL - 410

SP - 900

EP - 913

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 8-10

ER -