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
Subtitle of host publicationTheory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
PublisherSpringer Verlag
Pages364-375
Number of pages12
ISBN (Print)354077565X, 9783540775652
DOIs
Publication statusPublished - 2008 Jan 1
Externally publishedYes
EventSOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science - Novy Smokovec, Slovakia
Duration: 2008 Jan 192008 Jan 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4910 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceSOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science
CountrySlovakia
CityNovy Smokovec
Period08/1/1908/1/25

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Computing longest common substring and all palindromes from compressed strings'. Together they form a unique fingerprint.

  • 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 (pp. 364-375). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4910 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-77566-9_31