Consider a text T[1..n]T[1..n] prefixed by a reference sequence R=T[1..ℓ]R=T[1..ℓ]. We show how, given RR and the z′z′-phrase relative Lempel-Ziv parse of T[ℓ+1..n]T[ℓ+1..n] with respect to RR, we can build the LZ77 parse of TT in n polylog(n)npolylog(n) time and O(ℓ+z′)O(ℓ+z′) total space.
生成讲解博客的中文版本
生成AI智能校验的中文版本