Lempel-Ziv Factorization in Linear-Time O(1)-Workspace for Constant Alphabets
- 1 December 2021
- journal article
- research article
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E104.D (12), 2145-2153
- https://doi.org/10.1587/transinf.2021edp7037
Abstract
Computing the Lempel-Ziv Factorization (LZ77) of a string is one of the most important problems in computer science. Nowadays, it has been widely used in many applications such as data compression, text indexing and pattern discovery, and already become the heart of many file compressors like gzip and 7zip. In this paper, we show a linear time algorithm called Xone for computing the LZ77, which has the same space requirement with the previous best space requirement for linear time LZ77 factorization called BGone. Xone greatly improves the efficiency of BGone. Experiments show that the two versions of Xone: XoneT and XoneSA are about 27% and 31% faster than BGoneT and BGoneSA, respectively.Keywords
This publication has 16 references indexed in Scilit:
- Improving a lightweight LZ77 computation algorithm for running fasterSoftware: Practice and Experience, 2015
- Fast Online Lempel-Ziv Factorization in Compressed SpacePublished by Springer Science and Business Media LLC ,2015
- Parallel and Space-Efficient Construction of Burrows-Wheeler Transform and Suffix Array for Big Genome DataIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2015
- Space Efficient Linear Time Lempel-Ziv Factorization for Small AlphabetsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Practical linear-time O (1)-workspace suffix sorting for constant alphabetsACM Transactions on Information Systems, 2013
- On parsing optimality for dictionary-based text compression—the Zip caseJournal of Discrete Algorithms, 2013
- Simpler and Faster Lempel Ziv FactorizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- A comparison of index-based lempel-Ziv LZ77 factorization algorithmsACM Computing Surveys, 2012
- Computing Longest Previous Factor in linear time and applicationsInformation Processing Letters, 2008
- Incremental frequency count—a post BWT‐stage for the Burrows–Wheeler compression algorithmSoftware: Practice and Experience, 2006