Efficient algorithms to compute compressed longest common substrings and compressed palindromes

Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto

Research output: Contribution to journalArticle

47 Citations (Scopus)

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 (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.

Original languageEnglish
Pages (from-to)900-913
Number of pages14
JournalTheoretical Computer Science
Volume410
Issue number8-10
DOIs
Publication statusPublished - 2009 Mar 1
Externally publishedYes

Fingerprint

Straight-line Programs
Palindrome
Efficient Algorithms
Strings
Polynomials
Combinatorial Algorithms
Polynomial time

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

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

In: Theoretical Computer Science, Vol. 410, No. 8-10, 01.03.2009, p. 900-913.

Research output: Contribution to journalArticle

Matsubara, Wataru ; Inenaga, Shunsuke ; Ishino, Akira ; Shinohara, Ayumi ; Nakamura, Tomoyuki ; Hashimoto, Kazuo. / Efficient algorithms to compute compressed longest common substrings and compressed palindromes. In: Theoretical Computer Science. 2009 ; Vol. 410, No. 8-10. pp. 900-913.
@article{d3ee79716a164c769aac2aca27d89fe4,
title = "Efficient algorithms to compute compressed longest common substrings and compressed palindromes",
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 (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.",
keywords = "Longest common substring, Palindromes, Straight line program, String processing algorithms, Text compression",
author = "Wataru Matsubara and Shunsuke Inenaga and Akira Ishino and Ayumi Shinohara and Tomoyuki Nakamura and Kazuo Hashimoto",
year = "2009",
month = "3",
day = "1",
doi = "10.1016/j.tcs.2008.12.016",
language = "English",
volume = "410",
pages = "900--913",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "8-10",

}

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

VL - 410

SP - 900

EP - 913

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 8-10

ER -