English

Approximating LZ77 in Small Space

Data Structures and Algorithms 2015-03-10 v1

Abstract

Given a positive ϵ1\epsilon \leq 1 and read-only access to a string S[1..n]S [1..n] whose LZ77 parse consists of zz phrases, with high probability we can build an LZ77-like parse of SS that consists of \Ohz/ϵ\Oh{z / \epsilon} phrases using \Ohn1+ϵ\Oh{n^{1 + \epsilon}} time, \Ohn1+ϵ/B\Oh{n^{1 + \epsilon} / B} I/Os (where BB is the size of a disk block) and \Ohz/ϵ\Oh{z / \epsilon} space.

Cite

@article{arxiv.1503.02416,
  title  = {Approximating LZ77 in Small Space},
  author = {Travis Gagie},
  journal= {arXiv preprint arXiv:1503.02416},
  year   = {2015}
}
R2 v1 2026-06-22T08:47:20.825Z