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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 80; číslo 11; s. 3207 - 3224
Hlavní autori:	Bille, Philip, Christiansen, Anders Roy, Cording, Patrick Hagge, Gørtz, Inge Li, Skjoldjensen, Frederik Rye, Vildhøj, Hjalte Wedel, Vind, Søren
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2018 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!