Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation

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...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 80; no. 11; pp. 3207 - 3224
Main Authors:	Bille, Philip, Christiansen, Anders Roy, Cording, Patrick Hagge, Gørtz, Inge Li, Skjoldjensen, Frederik Rye, Vildhøj, Hjalte Wedel, Vind, Søren
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2018 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data compression Data structures Data Structures and Information Theory Genomes Mathematics of Computing Pattern matching Random access Sums Theory of Computation Partial Sums Problem Reference String Substring Concatenation Source String Relative Compression
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!