Faster Lightweight Lempel-Ziv Parsing

We present an algorithm that computes the Lempel-Ziv decomposition in \(O(n(\log \sigma + \log \log n))\) time and \(n\log \sigma + \epsilon n\) bits of space, where \(\epsilon \) is a constant rational parameter, n is the length of the input string, and \(\sigma \) is the alphabet size. The \(n\log \sigma \) bits in the space bound are for the input string itself which is treated as read-only.

[1]  Juha Kärkkäinen,et al.  Lightweight Lempel-Ziv Parsing , 2013, SEA.

[2]  Tatiana Starikovskaya.  Computing Lempel-Ziv Factorization Online , 2012, MFCS.

[3]  Kunihiko Sadakane,et al.  An Online Algorithm for Finding the Longest Previous Factors , 2008, ESA.

[4]  Roberto Grossi,et al.  A General Technique for Managing Strings in Comparison-Driven Data Structures , 2004, ICALP.

[5]  Rajeev Raman,et al.  Succinct indexable dictionaries with applications to encoding k-ary trees and multisets , 2002, SODA '02.

[6]  Enno Ohlebusch,et al.  Computing the longest common prefix array based on the Burrows-Wheeler transform , 2011, J. Discrete Algorithms.

[7]  Juha Kärkkäinen,et al.  Fast Lightweight Suffix Array Construction and Checking , 2003, CPM.

[8]  Guy E. Blelloch.  Space-efficient dynamic orthogonal point location, segment intersection, and range reporting , 2008, SODA '08.

[9]  Moshe Lewenstein,et al.  Dynamic weighted ancestors , 2007, SODA '07.

[10]  Kunihiko Sadakane,et al.  Fully Functional Static and Dynamic Succinct Trees , 2009, TALG.

[11]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[12]  Hideo Bannai,et al.  Faster Compact On-Line Lempel-Ziv Factorization , 2014, STACS.

[13]  Wing-Kai Hon,et al.  Breaking a Time-and-Space Barrier in Constructing Full-Text Indices , 2009, SIAM J. Comput..

[14]  Djamal Belazzougui.  Succinct Dictionary Matching with No Slowdown , 2010, CPM.

[15]  Richard Cole,et al.  Two Simplified Algorithms for Maintaining Order in a List , 2002, ESA.

[16]  Johannes Fischer,et al.  Lempel Ziv Computation in Small Space (LZ-CISS) , 2015, CPM.

[17]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[18]  Philip Bille,et al.  Time-Space Trade-Offs for Longest Common Extensions , 2012, CPM.

[19]  Dmitry Kosolobov.  Lempel-Ziv Factorization May Be Harder Than Computing All Runs , 2015, STACS.

[20]  Enno Ohlebusch,et al.  Lempel-Ziv Factorization Revisited , 2011, CPM.