A universal algorithm for sequential data compression
From MaRDI portal
Publication:4158937
DOI10.1109/TIT.1977.1055714zbMATH Open0379.94010DBLPjournals/tit/ZivL77WikidataQ55921954 ScholiaQ55921954MaRDI QIDQ4158937FDOQ4158937
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)
- 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
- Congruence Closure of Compressed Terms in Polynomial Time
- Computing regularities in strings: a survey
- Fast equality test for straight-line compressed strings
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- A diffusion limit for a class of randomly-growing binary trees
- Optimal encoding of non-stationary sources
- On optimal parsing for LZ78-like compressors
- FM-index of alignment: a compressed index for similar strings
- A novel block-based scheme for arithmetic coding
- On compressing and indexing repetitive sequences
- Multivariate permutation entropy and its application for complexity analysis of chaotic systems
- Personalized multi-user view and content synchronization and retrieval in real-time mobile social software applications
- Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics
- Linear-time text compression by longest-first substitution
- Optimal partitioning of data chunks in deduplication systems
- The “Runs” Theorem
- The three squares lemma revisited
- Time-space trade-offs for compressed suffix arrays.
- Note on the greedy parsing optimality for dictionary-based text compression
- Completing prefix codes in submonoids.
- Title not available (Why is that?)
- A fully linear-time approximation algorithm for grammar-based compression
- Data compression with long repeated strings
- Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
- Convergence properties of functional estimates for discrete distributions
- Self-indexing Based on LZ77
- P-complete problems in data compression
- On the complexity of pattern matching for highly compressed two-dimensional texts.
- Approximate string matching with compressed indexes
- Lazy Lempel-Ziv Factorization Algorithms
- Self-indexed Text Compression Using Straight-Line Programs
- Computing the longest previous factor
- Estimating Entropy Rates with Bayesian Confidence Intervals
- On Undetected Redundancy in the Burrows-Wheeler Transform
- Size and path length of Patricia tries: Dynamical sources context
- Approximate string matching on Ziv--Lempel compressed text
- Reducing space for index implementation.
- Similarity in languages and programs
- Robust universal complete codes for transmission and compression
- Compressed Membership in Automata with Compressed Labels
- An Online Algorithm for Finding the Longest Previous Factors
- Comparison of alignment free string distances for complete genome phylogeny
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- Quasi-distinct Parsing and Optimal Compression Methods
- Fast gapped variants for Lempel-Ziv-Welch compression
- Generalized substring compression
- Fast relative Lempel-Ziv self-index for similar sequences
- Distance measures for biological sequences: some recent approaches
- Orthogonal Range Searching for Text Indexing
- Unified compression-based acceleration of edit-distance computation
- On the Value of Multiple Read/Write Streams for Data Compression
- Universal lossless compression via multilevel pattern matching
- Phenomenology of coupled nonlinear oscillators
- Straight-line programs: a practical test (extended abstract)
- An adaptive character wordlength algorithm for data compression
- Computing Longest Common Substring and All Palindromes from Compressed Strings
- Hybrid indexes for repetitive datasets
- Diverse Palindromic Factorization is NP-Complete
- COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA
- Faster subsequence recognition in compressed strings
- 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
- Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts
- 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
- 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?)
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)
