Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees

被引：12

作者：

Fischer, Johannes ^{[1
]}

Tomohiro, I ^{[2
]}

Koeppl, Dominik ^{[1
]}

Sadakane, Kunihiko ^{[3
]}

机构：

[1] TU Dortmund, Dept Comp Sci, Dortmund, Germany

[2] Kyushu Inst Technol, Dept Artificial Intelligence, Fukuoka, Japan

[3] Univ Tokyo, Grad Sch Informat Sci & Technol, Tokyo, Japan

来源：

ALGORITHMICA | 2018年 / 80卷 / 07期

关键词：

Lempel-Ziv; Lossless compression; Succinct suffix trees; LINEAR-TIME; DATA-COMPRESSION; STRING KERNEL; ARRAYS; TEXT; REPRESENTATIONS; ALGORITHM; TRIES;

D O I：

10.1007/s00453-017-0333-1

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We show that both the Lempel-Ziv-77 and the Lempel-Ziv-78 factorization of a text of length n on an integer alphabet of size sigma can be computed in O(n) time with either O(n lg sigma) bits of working space, or (1 + epsilon) n lg n + O(n) bits (for a constant epsilon > 0) of working space (including the space for the output, but not the text).

引用

页码：2048 / 2081

页数：34

共 50 条

[21] Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
Karkkainen, Juha
Kempa, Dominik
Puglisi, Simon J.
[J]. COMBINATORIAL PATTERN MATCHING, 2013, 7922 : 189 - 200
[22] Sublinear Time Lempel-Ziv (LZ77) Factorization
Ellert, Jonas
[J]. STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2023, 2023, 14240 : 171 - 187
[23] Application of Lempel-Ziv factorization to the approximation of grammar-based compression
Rytter, W
[J]. COMBINATORIAL PATTERN MATCHING, 2002, 2373 : 20 - 31
[24] Lempel-Ziv Factorization May Be Harder Than Computing All Runs
Kosolobov, Dmitry
[J]. 32ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2015), 2015, 30 : 582 - 593
[25] Application of Lempel-Ziv factorization to the approximation of grammar-based compression
Rytter, W
[J]. THEORETICAL COMPUTER SCIENCE, 2003, 302 (1-3) : 211 - 222
[26] Pushdown and Lempel-Ziv depth
Jordon, Liam
Moser, Philippe
[J]. INFORMATION AND COMPUTATION, 2023, 292
[27] On Lempel-Ziv complexity of sequences
Doganaksoy, Ali
Gologlu, Faruk
[J]. SEQUENCES AND THEIR APPLICATIONS - SETA 2006, 2006, 4086 : 180 - 189
[28] Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
Mayordomo, Elvira
Moser, Philippe
[J]. SOFSEM 2009-THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2009, 5404 : 633 - +
[29] Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable
Elvira Mayordomo
Philippe Moser
Sylvain Perifel
[J]. Theory of Computing Systems, 2011, 48 : 731 - 766
[30] Lempel-Ziv Computation In Compressed Space (LZ-CICS)
Koeppl, Dominik
Sadakane, Kunihiko
[J]. 2016 DATA COMPRESSION CONFERENCE (DCC), 2016, : 3 - 12

← 1 2 3 4 5 →