Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees

Abstract

We present algorithms computing the non-overlapping Lempel–Ziv-77 factorization and the longest previous non-overlapping factor table within small space in linear or near-linear time with the help of modern suffix tree representations fitting into limited space. With similar techniques, we show how to answer substring compression queries for the Lempel–Ziv-78 factorization with a possible logarithmic multiplicative slowdown depending on the used suffix tree representation.

Keywords

• substring compression query
• longest previous non-overlapping factor table
• application of suffix trees
• non-overlapping Lempel–Ziv factorization
• lossless compression
• Lempel–Ziv-78 factorization