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)

Random access in persistent strings and segment selection
The macro model for data compression (extended abstract)
Two-pattern strings. I: A recognition algorithm
A universal finite memory source
Linear pattern matching of compressed terms and polynomial rewriting
Randomized probe selection algorithm for microarray design
A circuit complexity formulation of algorithmic information theory
Speeding up the detection of tandem repeats over the edit distance
Finger search in grammar-compressed strings
Compressing table data with column dependency
Burrows-Wheeler compression: Principles and reflections
Artificial sequences and complexity measures
On the size of overlapping Lempel-Ziv and Lyndon factorizations
A universal statistical test for random bit generators
Compressed automata for dictionary matching
Redundancy estimates for the Lempel–Ziv algorithm of data compression
Balancing and clustering of words in the Burrows-Wheeler transform
A complexity-based measure and its application to phylogenetic analysis
Substring complexity in sublinear space
On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
Compact q-gram profiling of compressed strings
Variable-length codes independent or closed with respect to edit relations
A faster algorithm for computing maximal -gapped repeats in a string
On undetected redundancy in the Burrows-Wheeler transform
Efficient algorithms for three variants of the LPF table
Quasi-distinct parsing and optimal compression methods
Is Huffmann coding dead?
Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes
On Sensitivity of Compact Directed Acyclic Word Graphs
On the distribution function of the complexity of finite sequences
Parameterized longest previous factor
Improving the efficiency of the PPM algorithm
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
Disjunctivity and other properties of sets of pseudo-bordered words
scientific article; zbMATH DE number 1421009 (Why is no real title available?)
Error Analysis of ZFP Compression for Floating-Point Data
Algorithmic folding complexity
Faster online computation of the succinct longest previous factor array
The greedy approach to dictionary-based static text compression on a distributed system
Parallel algorithms for Burrows-Wheeler compression and decompression
Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order
On the palindromic zl-factorization and c-factorization of the generalized period-doubling sequences
Convergence of recurrence of blocks for mixing processes
Structure-generating mechanisms in agent-based models
Phylogenetic analysis of DNA sequences based on the generalized pseudo-amino acid composition
Computing NP-hard repetitiveness measures via MAX-SAT
Progress, gaps and obstacles in the classification of cellular automata
Worst-case analysis for on-line data compression
Space-efficient construction of Lempel-Ziv compressed text indexes
On the algorithmic complexity of static structures
Fast string matching for multiple searches
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
Towards approximate matching in compressed strings: local subsequence recognition
Faster subsequence and don't-care pattern matching on compressed texts
scientific article; zbMATH DE number 7765421 (Why is no real title available?)
Dynamic-history predictive compression
Replacing suffix trees with enhanced suffix arrays
Approximate pattern matching in LZ77-compressed texts
The smallest grammar problem as constituents choice and minimal grammar parsing
Zipping thermal ratchets
Comparative construction of plug-in estimators of the entropy rate of two-state Markov chains
The fractional greedy algorithm for data compression
Time-universal data compression
Grammar compressed sequences with rank/select support
An empirical study of the complexity and randomness of prediction error sequences
Computing longest previous factor in linear time and applications
Variations of the parameterized longest previous factor
Computing minimal unique substrings for a sliding window
Efficient fully-compressed sequence representations
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
scientific article; zbMATH DE number 49083 (Why is no real title available?)
Efficient algorithms for Lempel-Ziv encoding
A universal online caching algorithm based on pattern matching
Finding characteristic substrings from compressed texts
On updating suffix tree labels
Adaptive text mining: inferring structure from sequences
Bacterial DNA sequence compression models using artificial neural networks
Leaf languages and string compression
scientific article; zbMATH DE number 590411 (Why is no real title available?)
Compressed Data Structures for Dynamic Sequences
Collage system: A unifying framework for compressed pattern matching.
Phase transitions in tumor growth. III: Vascular and metastasis behavior
Comparison of LZ77-type parsings
Rényi entropy and pattern matching for run-length encoded sequences
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
scientific article; zbMATH DE number 3621627 (Why is no real title available?)
Flexible indexing of repetitive collections
Viral genome phylogeny based on Lempel-Ziv complexity and Hausdorff distance
Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
Universally typical sets for ergodic sources of multidimensional data
Pass-efficient methods for compression of high-dimensional turbulent flow data
Variance of entropy for testing time-varying regimes with an application to meme stocks
On bounded redundancy of universal codes
An extension of the Lyndon-Schützenberger result to pseudoperiodic words
Complexity analysis to explore the structure of ancient stromatolites
Fuzzy relation equations for coding/decoding processes of images and videos
On the non-randomness of maximum Lempel Ziv complexity sequences of finite size
An Efficient Scheme for Joint Compression and Encryption
Phase transition in a generalized Eden growth model on a tree
Analytical depoissonization and its applications

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)