Space efficient linear time lempel-ziv factorization for small alphabets

Keisuke Goto, Hideo Bannai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

We present a new linear time algorithm for computing the Lempel-Ziv Factorization (LZ77) of a given string of length N on an alphabet of size σ, that utilizes only Nlog N + O(σ log N) bits of working space. When the alphabet size is small, this greatly improves the previous best space requirement for linear time LZ77 factorization (Kärkkäinen et al. CPM 2013), which is 2Nlog N bits, i.e. two integer arrays of length N. Experiments show that despite the added complexity of the algorithm, the speed of the algorithm is only around two to three times slower than previous fastest linear time algorithms.

Original languageEnglish
Title of host publicationProceedings - DCC 2014
Subtitle of host publication2014 Data Compression Conference
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages163-172
Number of pages10
ISBN (Print)9781479938827
DOIs
Publication statusPublished - Jan 1 2014
Event2014 Data Compression Conference, DCC 2014 - Snowbird, UT, United States
Duration: Mar 26 2014Mar 28 2014

Other

Other2014 Data Compression Conference, DCC 2014
CountryUnited States
CitySnowbird, UT
Period3/26/143/28/14

Fingerprint

Factorization
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Goto, K., & Bannai, H. (2014). Space efficient linear time lempel-ziv factorization for small alphabets. In Proceedings - DCC 2014: 2014 Data Compression Conference (pp. 163-172). [6824424] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/DCC.2014.62

Space efficient linear time lempel-ziv factorization for small alphabets. / Goto, Keisuke; Bannai, Hideo.

Proceedings - DCC 2014: 2014 Data Compression Conference. Institute of Electrical and Electronics Engineers Inc., 2014. p. 163-172 6824424.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Goto, K & Bannai, H 2014, Space efficient linear time lempel-ziv factorization for small alphabets. in Proceedings - DCC 2014: 2014 Data Compression Conference., 6824424, Institute of Electrical and Electronics Engineers Inc., pp. 163-172, 2014 Data Compression Conference, DCC 2014, Snowbird, UT, United States, 3/26/14. https://doi.org/10.1109/DCC.2014.62
Goto K, Bannai H. Space efficient linear time lempel-ziv factorization for small alphabets. In Proceedings - DCC 2014: 2014 Data Compression Conference. Institute of Electrical and Electronics Engineers Inc. 2014. p. 163-172. 6824424 https://doi.org/10.1109/DCC.2014.62
Goto, Keisuke ; Bannai, Hideo. / Space efficient linear time lempel-ziv factorization for small alphabets. Proceedings - DCC 2014: 2014 Data Compression Conference. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 163-172
@inproceedings{b54c3a2e802c44b982a255ca80c16650,
title = "Space efficient linear time lempel-ziv factorization for small alphabets",
abstract = "We present a new linear time algorithm for computing the Lempel-Ziv Factorization (LZ77) of a given string of length N on an alphabet of size σ, that utilizes only Nlog N + O(σ log N) bits of working space. When the alphabet size is small, this greatly improves the previous best space requirement for linear time LZ77 factorization (K{\"a}rkk{\"a}inen et al. CPM 2013), which is 2Nlog N bits, i.e. two integer arrays of length N. Experiments show that despite the added complexity of the algorithm, the speed of the algorithm is only around two to three times slower than previous fastest linear time algorithms.",
author = "Keisuke Goto and Hideo Bannai",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/DCC.2014.62",
language = "English",
isbn = "9781479938827",
pages = "163--172",
booktitle = "Proceedings - DCC 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Space efficient linear time lempel-ziv factorization for small alphabets

AU - Goto, Keisuke

AU - Bannai, Hideo

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We present a new linear time algorithm for computing the Lempel-Ziv Factorization (LZ77) of a given string of length N on an alphabet of size σ, that utilizes only Nlog N + O(σ log N) bits of working space. When the alphabet size is small, this greatly improves the previous best space requirement for linear time LZ77 factorization (Kärkkäinen et al. CPM 2013), which is 2Nlog N bits, i.e. two integer arrays of length N. Experiments show that despite the added complexity of the algorithm, the speed of the algorithm is only around two to three times slower than previous fastest linear time algorithms.

AB - We present a new linear time algorithm for computing the Lempel-Ziv Factorization (LZ77) of a given string of length N on an alphabet of size σ, that utilizes only Nlog N + O(σ log N) bits of working space. When the alphabet size is small, this greatly improves the previous best space requirement for linear time LZ77 factorization (Kärkkäinen et al. CPM 2013), which is 2Nlog N bits, i.e. two integer arrays of length N. Experiments show that despite the added complexity of the algorithm, the speed of the algorithm is only around two to three times slower than previous fastest linear time algorithms.

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

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

U2 - 10.1109/DCC.2014.62

DO - 10.1109/DCC.2014.62

M3 - Conference contribution

AN - SCOPUS:84903469508

SN - 9781479938827

SP - 163

EP - 172

BT - Proceedings - DCC 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -