Abstract
We explore the Full Compressed Delta Encoding problem in compressed
texts, defined as the problem of constructing a delta file directly from the two
given compressed files, without decompressing. We concentrate on the case
where the given files are compressed using LZSS and propose solutions for the
special cases involving substitutions only.
| Original language | American English |
|---|---|
| Title of host publication | DCC |
| State | Published - 2007 |