A universal algorithm for sequential data compression
From MaRDI portal
Publication:4158937
DOI10.1109/TIT.1977.1055714zbMATH Open0379.94010DBLPjournals/tit/ZivL77WikidataQ55921954 ScholiaQ55921954MaRDI QIDQ4158937FDOQ4158937
Authors: Jacob Ziv, Abraham Lempel 
Publication date: 1977
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- Compressed Data Structures for Dynamic Sequences
- A sequential algorithm for the universal coding of finite memory sources
- Combinatorial compression algorithms for ordered record sequences
- scientific article; zbMATH DE number 503181
- Universal almost sure data compression
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- Inequalities and algorithms for universal data compression
- Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
Cited In (only showing first 100 items - show all)
- Compressing table data with column dependency
- A complexity-based measure and its application to phylogenetic analysis
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
- Improving the efficiency of the PPM algorithm
- Is Huffmann coding dead?
- On the distribution function of the complexity of finite sequences
- Disjunctivity and other properties of sets of pseudo-bordered words
- Parallel algorithms for Burrows-Wheeler compression and decompression
- Phylogenetic analysis of DNA sequences based on the generalized pseudo-amino acid composition
- Progress, gaps and obstacles in the classification of cellular automata
- Towards approximate matching in compressed strings: local subsequence recognition
- Faster subsequence and don't-care pattern matching on compressed texts
- On the algorithmic complexity of static structures
- Comparative construction of plug-in estimators of the entropy rate of two-state Markov chains
- Variations of the parameterized longest previous factor
- An empirical study of the complexity and randomness of prediction error sequences
- Title not available (Why is that?)
- On updating suffix tree labels
- Compressed Data Structures for Dynamic Sequences
- Leaf languages and string compression
- Universally typical sets for ergodic sources of multidimensional data
- Random Access to Grammar-Compressed Strings and Trees
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
- On bounded redundancy of universal codes
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String
- Lempel-Ziv factorization powered by space efficient suffix trees
- LZ77 computation based on the run-length encoded BWT
- Compror: On-line lossless data compression with a factor oracle.
- An efficient algorithm for sequence comparison with block reversals
- Impugning randomness, convincingly
- Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data
- Title not available (Why is that?)
- Small-space LCE data structure with constant-time queries
- A Self-index on Block Trees
- A fast dynamic compression scheme for natural language texts
- Exploring the dynamics of dyadic interactions via hierarchical segmentation
- A motion compression/reconstruction method based on max t-norm composite fuzzy relational equations
- Relative entropy via non-sequential recursive pair substitution
- On the approximation ratio of LZ-end to LZ77
- On-line versus off-line computation in dynamic text compression
- Speeding up HMM decoding and training by exploiting sequence repetitions
- A Linear-Time Algorithm for Seeds Computation
- On-line construction of two-dimensional suffix trees
- A sequential algorithm for the universal coding of finite memory sources
- A sensor-based framework for kinetic data compression
- Almost linear time computation of maximal repetitions in run length encoded strings
- A compressed dynamic self-index for highly repetitive text collections
- Computing longest previous non-overlapping factors
- Fast algorithms for finding a minimum repetition representation of strings and trees
- Practical fixed length Lempel-Ziv coding
- Scalability and communication in parallel low-complexity lossless compression
- A worst-case analysis of the LZ2 compression algorithm
- Sampling automata and programs
- \(LZ\)-based image compression
- Parallelism and dictionary based data compression
- Composite Repetition-Aware Data Structures
- Lempel Ziv Computation in Small Space (LZ-CISS)
- A faster implementation of online RLBWT and its application to LZ77 parsing
- Truncated suffix trees and their application to data compression.
- Data compression and learning in time sequences analysis
- Compressed subsequence matching and packed tree coloring
- A novel lossless data compression scheme based on the error correcting Hamming codes
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Adaptive learning of compressible strings
- Similarity analysis of DNA sequences based on the generalized LZ complexity of (0,1)-sequences
- Information density, structure and entropy in equilibrium and non-equilibrium systems
- Deterministic compression with uncertain priors
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
- Computing maximal-exponent factors in an overlap-free word
- Code-carrying theories
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
- A universal finite memory source
- On Sensitivity of Compact Directed Acyclic Word Graphs
- A universal statistical test for random bit generators
- Balancing and clustering of words in the Burrows-Wheeler transform
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Compact q-gram profiling of compressed strings
- Efficient algorithms for three variants of the LPF table
- Quasi-distinct parsing and optimal compression methods
- Parameterized longest previous factor
- Algorithmic folding complexity
- The greedy approach to dictionary-based static text compression on a distributed system
- Convergence of recurrence of blocks for mixing processes
- Title not available (Why is that?)
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Replacing suffix trees with enhanced suffix arrays
- Efficient algorithms for Lempel-Ziv encoding
- Computing longest previous factor in linear time and applications
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Title not available (Why is that?)
- Efficient fully-compressed sequence representations
- Bacterial DNA sequence compression models using artificial neural networks
- Collage system: A unifying framework for compressed pattern matching.
- Fuzzy relation equations for coding/decoding processes of images and videos
- Phase transition in a generalized Eden growth model on a tree
- Analytical depoissonization and its applications
- Computing regularities in strings: a survey
- Fast equality test for straight-line compressed strings
This page was built for publication: A universal algorithm for sequential data compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158937)
