Compression of Low Entropy Strings with Lempel--Ziv Algorithms
From MaRDI portal
Publication:4943851
DOI10.1137/S0097539797331105zbMath0941.68055MaRDI QIDQ4943851
Giovanni Manzini, S. Rao Kosaraju
Publication date: 19 March 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539797331105
68Q25: Analysis of algorithms and problem complexity
68P20: Information storage and retrieval of data
Related Items
Unnamed Item, Practical Wavelet Tree Construction, Compressed Multiple Pattern Matching, Bicriteria Data Compression, A new class of string transformations for compressed text indexing, On compressing and indexing repetitive sequences, Dictionary-symbolwise flexible parsing, A sensor-based framework for kinetic data compression, Space-efficient construction of Lempel-Ziv compressed text indexes, On optimally partitioning a text to improve its compression, Lempel-Ziv-78 compressed string dictionaries, Indexing text using the Ziv--Lempel trie, Range majorities and minorities in arrays, Lempel-Ziv-like parsing in small space, Lempel-Ziv compressed structures for document retrieval, Linked dynamic tries with applications to LZ-compression in sublinear time and space, Stronger Lempel-Ziv based compressed text indexing, Compressing table data with column dependency, Random Access to High-Order Entropy Compressed Text, On the Value of Multiple Read/Write Streams for Data Compression
