A universal algorithm for sequential data compression
From MaRDI portal
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)- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Compressed depth sequences
- On the distribution function of the complexity of finite sequences
- XML compression techniques: A survey and comparison
- Comparative construction of plug-in estimators of the entropy rate of two-state Markov chains
- Phylogenetic inference from binary sequences reduced by primary DNA sequences
- A complexity-based measure and its application to phylogenetic analysis
- A diffusion limit for a class of randomly-growing binary trees
- Dynamic-history predictive compression
- Analytical depoissonization and its applications
- On updating suffix tree labels
- Efficient parallel algorithms to test square-freeness and factorize strings
- A universal statistical test for random bit generators
- Predictive analog-to-digital conversion for resistance to data outliers
- P-complete problems in data compression
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
- A worst-case analysis of the LZ2 compression algorithm
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Truncated suffix trees and their application to data compression.
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
- Zipping thermal ratchets
- Aim functions and sequential estimation of the source model for universal coding
- Multivariate permutation entropy and its application for complexity analysis of chaotic systems
- Phase transitions in tumor growth. III: Vascular and metastasis behavior
- Comparison of LZ77-type parsings
- A separation between RLSLPs and LZ77
- Approximate string matching with compressed indexes
- Linear-time text compression by longest-first substitution
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files
- Dynamics characterization of modified Gross-Pitaevskii equation
- Measuring the clustering effect of BWT via RLE
- Time-space trade-offs for Lempel-Ziv compressed indexing
- On optimal parsing for LZ78-like compressors
- FM-index of alignment with gaps
- Synergy, redundancy, and multivariate information measures: an experimentalist's perspective
- A faster implementation of online RLBWT and its application to LZ77 parsing
- Quantifying local randomness in human DNA and RNA sequences using Erdös motifs
- Detecting life signatures with RNA sequence similarity measures
- Randomized prediction of individual sequences
- Lempel-Ziv data compression on parallel and distributed systems
- The smallest grammar problem as constituents choice and minimal grammar parsing
- Computing regularities in strings: a survey
- Computing the longest previous factor
- ODC: frame for definition of dense codes
- Parallel Lempel Ziv coding
- Partial words and the critical factorization theorem
- Comparison of protein secondary structures based on backbone dihedral angles
- Data compression and genomes: a two-dimensional life domain map
- Improving the efficiency of the PPM algorithm
- Combinatorial compression algorithms for ordered record sequences
- Optimal data compression algorithm
- Regular expression searching on compressed text
- Two-pattern strings. I: A recognition algorithm
- Approximate string matching on Ziv--Lempel compressed text
- Time-space trade-offs for compressed suffix arrays.
- Compror: On-line lossless data compression with a factor oracle.
- Reducing space for index implementation.
- Data compression and learning in time sequences analysis
- On the complexity of pattern matching for highly compressed two-dimensional texts.
- Collage system: A unifying framework for compressed pattern matching.
- Complexity analysis to explore the structure of ancient stromatolites
- Lossless compression and information hiding in images
- The fractional greedy algorithm for data compression
- Robust universal complete codes for transmission and compression
- Variations of the parameterized longest previous factor
- Unified compression-based acceleration of edit-distance computation
- Computing longest previous non-overlapping factors
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- Dimension is compression
- The faster higher-order cellular automaton for hyper-parallel undistorted data compression
- Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order
- Time-universal data compression
- Flexible indexing of repetitive collections
- On universal algorithms for classifying and predicting stationary processes
- Automatic proofs of memory deallocation for a Whiley-to-C compiler
- Asymptotically most powerful tests for random number generators
- Variable-length codes independent or closed with respect to edit relations
- On fungal automata
- Faster online computation of the succinct longest previous factor array
- Computing minimal unique substrings for a sliding window
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Factorizing strings into repetitions
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words
- Contrasting stochasticity with chaos in a permutation Lempel-Ziv complexity -- Shannon entropy plane
- Grammar index by induced suffix sorting
- An LMS-based grammar self-index with local consistency properties
- On the approximation ratio of LZ-end to LZ77
- A separation of \(\gamma\) and \(b\) via Thue-Morse words
- Phase transitions in tumor growth. V: What can be expected from cancer glycolytic oscillations?
- The heaviest induced ancestors problem: better data structures and applications
- Phase transitions in tumor growth. VI: Epithelial-mesenchymal transition
- A parametrized family of Tversky metrics connecting the Jaccard distance to an analogue of the normalized information distance
- Sequential universal modeling for non-binary sequences with constrained distributions
- Shortest unique palindromic substring queries in semi-dynamic settings
- Lempel-Ziv-like parsing in small space
- Generative complexity of Gray-Scott model
- Randomized probe selection algorithm for microarray design
- A combinatorial view on string attractors
- Palindromic trees for a sliding window and its applications
- Binary image compression via monochromatic pattern substitution: sequential and parallel implementations
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)
