English

Space-efficient RLZ-to-LZ77 conversion

Data Structures and Algorithms 2022-12-06 v2

Abstract

Consider a text T[1..n]T [1..n] prefixed by a reference sequence R=T[1..]R = T [1..\ell]. We show how, given RR and the zz'-phrase relative Lempel-Ziv parse of T[+1..n]T [\ell + 1..n] with respect to RR, we can build the LZ77 parse of TT in npolylog(n)n\,\mathrm{polylog} (n) time and O(+z)O (\ell + z') total space.

Cite

@article{arxiv.2211.13254,
  title  = {Space-efficient RLZ-to-LZ77 conversion},
  author = {Travis Gagie},
  journal= {arXiv preprint arXiv:2211.13254},
  year   = {2022}
}
R2 v1 2026-06-28T06:42:41.423Z