The Lempel-Ziv factorization is an important tool in text compression, being its size z closely related with the number of repetitions in the processed string.

We present two efficient algorithms which, given a compressed representation of a string w of length N, compute the Lyndon factorization of w. Given a straight ...

Sep 5, 2015 · Fast Online Lempel-Ziv Factorization in Compressed Space. Conference paper; First Online: 01 January 2015. pp 13–20; Cite this conference paper.

We show that the LZ77 factorization of T can be computed in n H 0 + o n log ⁡ σ + O σ log ⁡ n bits of working space with an online algorithm running in O n log ...

Abstract. Let T be a text of length n on an alphabet Σ of size σ, and let H0 be the zero-order empirical entropy of T. We show that the LZ77 factorization ...

Aug 4, 2024 · Bibliographic details on Fast Online Lempel-Ziv Factorization in Compressed Space.

We show that the LZ77 factorization of T can be computed in nH0+o(nlogσ)+O(σlogn) bits of working space with an online algorithm running in O(nlogn) time.

Fast Online Lempel-Ziv Factorization in Compressed Space ; String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, ...

We show that the LZ77 factorization of T can be computed in nH0+o(nlogσ)+O(σlogn) bits of working space with an online algorithm running in O(nlogn) time.

Fast Online Lempel-Ziv Factorization in Compressed Space · List of references · Publications that cite this publication.