License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2016.18
URN: urn:nbn:de:0030-drops-67872
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6787/
Go to the corresponding LIPIcs Volume Portal


Bille, Philip ; Cording, Patrick Hagge ; Gørtz, Inge Li ; Skjoldjensen, Frederik Rye ; Vildhøj, Hjalte Wedel ; Vind, Søren

Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation

pdf-format:
LIPIcs-ISAAC-2016-18.pdf (0.5 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{bille_et_al:LIPIcs:2016:6787,
  author =	{Philip Bille and Patrick Hagge Cording and Inge Li G\ortz and Frederik Rye Skjoldjensen and Hjalte Wedel Vildh\oj and S\oren Vind},
  title =	{{Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation}},
  booktitle =	{27th International Symposium on Algorithms and Computation (ISAAC 2016)},
  pages =	{18:1--18:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-026-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{64},
  editor =	{Seok-Hee Hong},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6787},
  URN =		{urn:nbn:de:0030-drops-67872},
  doi =		{10.4230/LIPIcs.ISAAC.2016.18},
  annote =	{Keywords: Relative compression, dynamic compression, dynamic partial sum, sub-string concatenation, external macro compression}
}

Keywords: Relative compression, dynamic compression, dynamic partial sum, sub-string concatenation, external macro compression
Seminar: 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Issue Date: 2016
Date of publication: 02.12.2016


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI