Computing longest common substring and all palindromes from compressed strings

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

*この研究の対応する著者

研究成果: Conference contribution

5 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルSOFSEM 2008
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
出版社Springer Verlag
ページ364-375
ページ数12
ISBN(印刷版)354077565X, 9783540775652
DOI
出版ステータスPublished - 2008 1 1
外部発表はい
イベントSOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science - Novy Smokovec, Slovakia
継続期間: 2008 1 192008 1 25

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4910 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

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

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Computing longest common substring and all palindromes from compressed strings」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル