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 -