A universal algorithm for sequential data compression

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)

Algorithmic folding complexity
The macro model for data compression (extended abstract)
Convergence properties of functional estimates for discrete distributions
Computing Longest Common Substring and All Palindromes from Compressed Strings
An Online Algorithm for Finding the Longest Previous Factors
Approximate string matching on Ziv--Lempel compressed text
A fully linear-time approximation algorithm for grammar-based compression
Generalized substring compression
Data compression with long repeated strings
Multivariate permutation entropy and its application for complexity analysis of chaotic systems
The greedy approach to dictionary-based static text compression on a distributed system
Space-efficient construction of Lempel-Ziv compressed text indexes
Computing regularities in strings: a survey
Fast equality test for straight-line compressed strings
Reducing space for index implementation.
Fast relative Lempel-Ziv self-index for similar sequences
Bacterial DNA sequence compression models using artificial neural networks
Universal lossless compression via multilevel pattern matching
The ``runs theorem
Self-indexing based on LZ77
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
Algorithm 938: Compressing circular buffers
Balancing and clustering of words in the Burrows-Wheeler transform
Distance measures for biological sequences: some recent approaches
Compressed membership problems for regular expressions and hierarchical automata
Collage system: A unifying framework for compressed pattern matching.
Self-indexed Text Compression Using Straight-Line Programs
Linear-time text compression by longest-first substitution
Phase transition in a generalized Eden growth model on a tree
Analytical depoissonization and its applications
Completing prefix codes in submonoids.
Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics
Orthogonal range searching for text indexing
Convergence of recurrence of blocks for mixing processes
Phenomenology of coupled nonlinear oscillators
On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
Computing longest previous factor in linear time and applications
Compact q-gram profiling of compressed strings
ISSDC: digram coding based lossless data compression algorithm
Straight-line programs: a practical test (extended abstract)
The three squares lemma revisited
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Hybrid indexes for repetitive datasets
An adaptive character wordlength algorithm for data compression
Unified compression-based acceleration of edit-distance computation
P-complete problems in data compression
Similarity in languages and programs
Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
Efficient algorithms for three variants of the LPF table
Computing the longest previous factor
Quasi-distinct parsing and optimal compression methods
scientific article; zbMATH DE number 590411 (Why is no real title available?)
Fast gapped variants for Lempel-Ziv-Welch compression
Comparison of alignment free string distances for complete genome phylogeny
Efficient fully-compressed sequence representations
On undetected redundancy in the Burrows-Wheeler transform
On compressing and indexing repetitive sequences
On Sensitivity of Compact Directed Acyclic Word Graphs
On the complexity of pattern matching for highly compressed two-dimensional texts.
Lazy Lempel-Ziv factorization algorithms
Estimating Entropy Rates with Bayesian Confidence Intervals
Fuzzy relation equations for coding/decoding processes of images and videos
Congruence closure of compressed terms in polynomial time
Robust universal complete codes for transmission and compression
Optimal partitioning of data chunks in deduplication systems
A diffusion limit for a class of randomly-growing binary trees
Parameterized longest previous factor
scientific article; zbMATH DE number 7765421 (Why is no real title available?)
Approximate string matching with compressed indexes
Diverse Palindromic Factorization is NP-Complete
A universal statistical test for random bit generators
Time-space trade-offs for compressed suffix arrays.
Faster subsequence recognition in compressed strings
Replacing suffix trees with enhanced suffix arrays
Quasi-distinct Parsing and Optimal Compression Methods
On optimal parsing for LZ78-like compressors
Optimal encoding of non-stationary sources
scientific article; zbMATH DE number 2135152 (Why is no real title available?)
Note on the greedy parsing optimality for dictionary-based text compression
FM-index of alignment: a compressed index for similar strings
Efficient algorithms for Lempel-Ziv encoding
A novel block-based scheme for arithmetic coding
Size and path length of Patricia tries: Dynamical sources context
Compressed membership in automata with compressed labels
A fast and efficient nearly-optimal adaptive Fano coding scheme
String Indexing with Compressed Patterns
scientific article; zbMATH DE number 1421009 (Why is no real title available?)
Internal pattern matching queries in a text and applications
Fast Exponentiation Using Data Compression
De Novo NGS Data Compression
On the palindromic zl-factorization and c-factorization of the generalized period-doubling sequences
scientific article; zbMATH DE number 7765406 (Why is no real title available?)
Faster sequential universal coding via block partitioning
Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
Bicriteria data compression
Universal Lossless Compression of Erased Symbols
Inline vector compression for computational physics
Pushdown and Lempel-Ziv depth
Redundancy estimates for the Lempel–Ziv algorithm of data compression
Selective dynamic compression

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)