Simpler and Faster Lempel Ziv Factorization

TL;DR

This paper introduces a new, simpler, and more efficient linear-time algorithm for Lempel-Ziv factorization using suffix arrays, outperforming existing methods in speed with comparable space requirements.

Contribution

A novel approach for LZ77 factorization that is simpler and faster than previous algorithms, leveraging suffix arrays for improved performance.

Findings

Outperforms the LZ OG algorithm in speed by 2-3 times

Maintains similar or slightly increased space complexity

Consistently faster across various data sets

Abstract

We present a new, simple, and efficient approach for computing the Lempel-Ziv (LZ77) factorization of a string in linear time, based on suffix arrays. Computational experiments on various data sets show that our approach constantly outperforms the currently fastest algorithm LZ OG (Ohlebusch and Gog 2011), and can be up to 2 to 3 times faster in the processing after obtaining the suffix array, while requiring the same or a little more space.