Computing longest common substring and all palindromes from compressed strings

Authors:
Wataru Matsubara;Shunsuke Inenaga;Akira Ishino;Ayumi Shinohara;Tomoyuki Nakamura;Kazuo Hashimoto
Affiliations:
Graduate School of Information Science, Tohoku University, Japan;Department of Computer Science and Communication Engineering, Kyushu University, Japan;Graduate School of Information Science, Tohoku University, Japan;Graduate School of Information Science, Tohoku University, Japan;Graduate School of Information Science, Tohoku University, Japan;Graduate School of Information Science, Tohoku University, Japan
Venue:
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Year:
2008

Citing 8
Cited 2

Parallel detection of all palindromes in a string

Theoretical Computer Science
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs

CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Testing Equivalence of Morphisms on Context-Free Languages

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Querying and embedding compressed texts

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
An efficient pattern matching algorithm on a subclass of context free grammars

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Universal lossless compression via multilevel pattern matching

IEEE Transactions on Information Theory
Processing compressed texts: a tractability border

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

Efficient algorithms to compute compressed longest common substrings and compressed palindromes

Theoretical Computer Science
Testing square-freeness of strings compressed by balanced straight line program

CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94

Quantified Score

Hi-index	0.00

Visualization

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.