Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Lightweight Lempel-Ziv Parsing
verfasst von : Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Erschienen in: Experimental Algorithms
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We introduce a new approach to LZ77 factorization that uses
$\O(n/d)$
words of working space and
$\O(dn)$
time for any
d
≥ 1 (for polylogarithmic alphabet sizes). We also describe carefully engineered implementations of alternative approaches to lightweight LZ77 factorization. Extensive experiments show that the new algorithm is superior, and particularly so at the lowest memory levels and for highly repetitive data. As a part of the algorithm, we describe new methods for computing matching statistics which may be of independent interest.