Name
Title | ||
|---|---|---|
Efficient algorithms to compute compressed longest common substrings and compressed palindromes |
Abstract | ||
|---|---|---|
This paper studies two problems on compressed strings described interms of straight line programs (SLPs). One is tocompute the length of the longest common substring of two givenSLP-compressed strings, and the other is to compute all palindromesof a given SLP-compressed string. In order to solve these problemsefficiently (in polynomial time w.r.t. the compressed size)decompression is never feasible, since the decompressed size can beexponentially large. We develop combinatorial algorithms that solvethese problems in O(n4logn) timewith O(n3) space, and inO(n4) time withO(n2) space, respectively, where nis the size of the input SLP-compressed strings. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.tcs.2008.12.016 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
polynomial time w,input SLP-compressed string,SLP-compressed string,paper study,longest common substrings,combinatorial algorithm,efficient algorithm,Longest common substring,Straight line program,Palindromes,time withO,String processing algorithms,decompressed size,givenSLP-compressed string,Text compression,timewith O,longest common substring | Journal | 410 |
Issue | ISSN | Citations |
8-10 | Theoretical Computer Science | 15 |
PageRank | References | Authors |
0.67 | 14 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wataru Matsubara | 1 | 52 | 5.87 |
| Shunsuke Inenaga | 2 | 595 | 79.02 |
| Akira Ishino | 3 | 54 | 7.31 |
| Ayumi Shinohara | 4 | 936 | 88.28 |
| Tomoyuki Nakamura | 5 | 18 | 1.12 |
| Kazuo Hashimoto | 6 | 300 | 29.86 |