Computing longest common substring and all palindromes from compressed strings

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

doi:10.1007/978-3-540-77566-9_31

Computing longest common substring and all palindromes from compressed strings

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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference 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(n⁴ log n) time with O(n3) space, and in O(n ⁴) time with O(n²) space, respectively, where n is the size of the input SLP-compressed strings.

Original language	English
Title of host publication	SOFSEM 2008
Subtitle of host publication	Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
Publisher	Springer Verlag
Pages	364-375
Number of pages	12
ISBN (Print)	354077565X, 9783540775652
DOIs	https://doi.org/10.1007/978-3-540-77566-9_31
Publication status	Published - 2008
Externally published	Yes
Event	SOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science - Novy Smokovec, Slovakia Duration: 2008 Jan 19 → 2008 Jan 25

Publication series

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

Conference

Conference	SOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science
Country/Territory	Slovakia
City	Novy Smokovec
Period	08/1/19 → 08/1/25

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-77566-9_31

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

Computing longest common substring and all palindromes from compressed strings. / Matsubara, Wataru; Inenaga, Shunsuke; Ishino, Akira et al.
SOFSEM 2008: Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Springer Verlag, 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 proceeding › Conference 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4910 LNCS, Springer Verlag, pp. 364-375, SOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science, Novy Smokovec, Slovakia, 08/1/19. https://doi.org/10.1007/978-3-540-77566-9_31

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. Springer Verlag. 2008. p. 364-375. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-77566-9_31

Matsubara, Wataru ; Inenaga, Shunsuke ; Ishino, Akira et al. / 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. Springer Verlag, 2008. pp. 364-375 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{40ecdfc5f3e34fe5a53c23ebbcc2a7b6,

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",

doi = "10.1007/978-3-540-77566-9_31",

language = "English",

isbn = "354077565X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "364--375",

booktitle = "SOFSEM 2008",

note = "SOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science ; Conference date: 19-01-2008 Through 25-01-2008",

}

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

U2 - 10.1007/978-3-540-77566-9_31

DO - 10.1007/978-3-540-77566-9_31

M3 - Conference contribution

AN - SCOPUS:38549098620

SN - 354077565X

SN - 9783540775652

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

PB - Springer Verlag

T2 - SOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science

Y2 - 19 January 2008 through 25 January 2008

ER -

Computing longest common substring and all palindromes from compressed strings

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this