TY - GEN

T1 - LZD factorization

T2 - 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015

AU - Goto, Keisuke

AU - Bannai, Hideo

AU - Inenaga, Shunsuke

AU - Takeda, Masayuki

N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.

PY - 2015

Y1 - 2015

N2 - We propose a new variant of the LZ78 factorization which we call the LZ Double-factor factorization (LZD factorization). Each factor of the LZD factorization of a string is the concatenation of the two longest previous factors, while each factor of the LZ78 factorization is that of the longest previous factor and the following character. Interestingly, this simple modification drastically improves the compression ratio in practice. We propose two online algorithms to compute the LZD factorization in O(m(M +min(m, M) log σ)) time and O(m) space, or in O(N log σ) time and O(N) space, where m is the number of factors to output, M is the length of the longest factor(s), N is the length of the input string, and σ is the alphabet size. We also show two versions of our LZD factorization with variable-to-fixed encoding, and present online algorithms to compute these versions in O(N + min(m, 2L)(M + min(m, M, 2L) log σ)) time and O(min(2L, m)) space, where L is the bit-length of each fixed-length code word. The LZD factorization and its versions with variable-to fixed encoding are actually grammar-based compression, and our experiments show that our algorithms outperform the state-of-the-art online grammar-based compression algorithms on several data sets.

AB - We propose a new variant of the LZ78 factorization which we call the LZ Double-factor factorization (LZD factorization). Each factor of the LZD factorization of a string is the concatenation of the two longest previous factors, while each factor of the LZ78 factorization is that of the longest previous factor and the following character. Interestingly, this simple modification drastically improves the compression ratio in practice. We propose two online algorithms to compute the LZD factorization in O(m(M +min(m, M) log σ)) time and O(m) space, or in O(N log σ) time and O(N) space, where m is the number of factors to output, M is the length of the longest factor(s), N is the length of the input string, and σ is the alphabet size. We also show two versions of our LZD factorization with variable-to-fixed encoding, and present online algorithms to compute these versions in O(N + min(m, 2L)(M + min(m, M, 2L) log σ)) time and O(min(2L, m)) space, where L is the bit-length of each fixed-length code word. The LZD factorization and its versions with variable-to fixed encoding are actually grammar-based compression, and our experiments show that our algorithms outperform the state-of-the-art online grammar-based compression algorithms on several data sets.

UR - http://www.scopus.com/inward/record.url?scp=84949036063&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949036063&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-19929-0_19

DO - 10.1007/978-3-319-19929-0_19

M3 - Conference contribution

AN - SCOPUS:84949036063

SN - 9783319199283

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 219

EP - 230

BT - Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings

A2 - Vaccaro, Ugo

A2 - Porat, Ely

A2 - Cicalese, Ferdinando

PB - Springer Verlag

Y2 - 29 June 2015 through 1 July 2015

ER -