Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation
复制标题
动态相对压缩、动态部分和和子串串联
DOI:
10.1007/s00453-017-0380-7
复制
发表时间:
2015
期刊:
影响因子:
1.1
通讯作者:
Søren Vind
中科院分区:
文献类型:
--
作者:
Philip Bille;Patrick Hagge Cording;Inge Li Gørtz;Frederik Rye Skjoldjensen;Hjalte Wedel Vildhøj;Søren Vind
Given a static reference string R and a source string S, a relative compression of S with respect to R is an encoding of S as a sequence of references to substrings of R. Relative compression schemes are a classic model of compression and have recently proved very successful for compressing highly-repetitive massive data sets such as genomes and web-data. We initiate the study of relative compression in a dynamic setting where the compressed source string S is subject to edit operations. The goal is to maintain the compressed representation compactly, while supporting edits and allowing efficient random access to the (uncompressed) source string. We present new data structures that achieve optimal time for updates and queries while using space linear in the size of the optimal relative compression, for nearly all combinations of parameters. We also present solutions for restricted and extended sets of updates. To achieve these results, we revisit the dynamic partial sums problem and the substring concatenation problem. We present new optimal or near optimal bounds for these problems. Plugging in our new results we also immediately obtain new bounds for the string indexing for patterns with wildcards problem and the dynamic text and static pattern matching problem.
DOI:
--
发表时间:
2003-01
期刊:
--
影响因子:
--
作者:
R. Grossi;Ankur Gupta;J. Vitter
通讯作者:
R. Grossi;Ankur Gupta;J. Vitter
影响因子:
1.3
作者:
Navarro, Gonzalo;Sadakane, Kunihiko
通讯作者:
Sadakane, Kunihiko