Computing longest common substring and all palindromes from compressed strings

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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

Original languageEnglish
Title of host publicationSOFSEM 2008: Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
Pages364-375
Number of pages12
Volume4910 LNCS
Publication statusPublished - 2008
EventSOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science - Novy Smokovec, Slovakia
Duration: Jan 19 2008Jan 25 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4910 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherSOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science
CountrySlovakia
CityNovy Smokovec
Period1/19/081/25/08

Fingerprint

Straight-line Programs
Palindrome
Strings
Polynomials
Computing
Decompression
Combinatorial Algorithms
Polynomial time

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T., & Hashimoto, K. (2008). Computing longest common substring and all palindromes from compressed strings. In SOFSEM 2008: Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (Vol. 4910 LNCS, pp. 364-375). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4910 LNCS).

Computing longest common substring and all palindromes from compressed strings. / Matsubara, Wataru; Inenaga, Shunsuke; Ishino, Akira; Shinohara, Ayumi; Nakamura, Tomoyuki; Hashimoto, Kazuo.

SOFSEM 2008: Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Vol. 4910 LNCS 2008. p. 364-375 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4910 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Matsubara, W, Inenaga, S, Ishino, A, Shinohara, A, Nakamura, T & Hashimoto, K 2008, Computing longest common substring and all palindromes from compressed strings. in SOFSEM 2008: Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. vol. 4910 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4910 LNCS, pp. 364-375, SOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science, Novy Smokovec, Slovakia, 1/19/08.
Matsubara W, Inenaga S, Ishino A, Shinohara A, Nakamura T, Hashimoto K. Computing longest common substring and all palindromes from compressed strings. In SOFSEM 2008: Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Vol. 4910 LNCS. 2008. p. 364-375. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Matsubara, Wataru ; Inenaga, Shunsuke ; Ishino, Akira ; Shinohara, Ayumi ; Nakamura, Tomoyuki ; Hashimoto, Kazuo. / Computing longest common substring and all palindromes from compressed strings. SOFSEM 2008: Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Vol. 4910 LNCS 2008. pp. 364-375 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{cb4b94208f60428e8ff3f1e0c2b246dc,
title = "Computing longest common substring and all palindromes from compressed strings",
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(n 4) time with O(n2) space, respectively, where n is the size of the input SLP-compressed strings.",
author = "Wataru Matsubara and Shunsuke Inenaga and Akira Ishino and Ayumi Shinohara and Tomoyuki Nakamura and Kazuo Hashimoto",
year = "2008",
language = "English",
isbn = "354077565X",
volume = "4910 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "364--375",
booktitle = "SOFSEM 2008: Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings",

}

TY - GEN

T1 - Computing longest common substring and all palindromes from compressed strings

AU - Matsubara, Wataru

AU - Inenaga, Shunsuke

AU - Ishino, Akira

AU - Shinohara, Ayumi

AU - Nakamura, Tomoyuki

AU - Hashimoto, Kazuo

PY - 2008

Y1 - 2008

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

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

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

M3 - Conference contribution

AN - SCOPUS:38549098620

SN - 354077565X

SN - 9783540775652

VL - 4910 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 364

EP - 375

BT - SOFSEM 2008: Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings

ER -