A universal algorithm for sequential data compression
From MaRDI portal
Publication:4158937
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)- scientific article; zbMATH DE number 4045113 (Why is no real title available?)
- Deterministic compression with uncertain priors
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Parallel algorithms for Burrows-Wheeler compression and decompression
- Relative entropy via non-sequential recursive pair substitution
- Exploring the dynamics of dyadic interactions via hierarchical segmentation
- Towards approximate matching in compressed strings: local subsequence recognition
- Practical fixed length Lempel-Ziv coding
- Faster subsequence and don't-care pattern matching on compressed texts
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
- Personalized multi-user view and content synchronization and retrieval in real-time mobile social software applications
- Comparative construction of plug-in estimators of the entropy rate of two-state Markov chains
- \(LZ\)-based image compression
- Parallelism and dictionary based data compression
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
- A complexity-based measure and its application to phylogenetic analysis
- A compressed dynamic self-index for highly repetitive text collections
- Leaf languages and string compression
- Variations of the parameterized longest previous factor
- A review on the application of fuzzy transform in data and image compression
- A worst-case analysis of the LZ2 compression algorithm
- Data compression and learning in time sequences analysis
- A faster implementation of online RLBWT and its application to LZ77 parsing
- Phylogenetic analysis of DNA sequences based on the generalized pseudo-amino acid composition
- Compressing table data with column dependency
- A fast dynamic compression scheme for natural language texts
- Truncated suffix trees and their application to data compression.
- On the algorithmic complexity of static structures
- Universally typical sets for ergodic sources of multidimensional data
- On the approximation ratio of LZ-end to LZ77
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
- A motion compression/reconstruction method based on max t-norm composite fuzzy relational equations
- Computing longest previous non-overlapping factors
- Progress, gaps and obstacles in the classification of cellular automata
- On-line versus off-line computation in dynamic text compression
- Adaptive learning of compressible strings
- Compror: On-line lossless data compression with a factor oracle.
- Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data
- An empirical study of the complexity and randomness of prediction error sequences
- Fast algorithms for finding a minimum repetition representation of strings and trees
- Improving the efficiency of the PPM algorithm
- Is Huffmann coding dead?
- Computing maximal-exponent factors in an overlap-free word
- Speeding up HMM decoding and training by exploiting sequence repetitions
- Relations between greedy and bit-optimal LZ77 encodings
- Similarity analysis of DNA sequences based on the generalized LZ complexity of (0,1)-sequences
- On the distribution function of the complexity of finite sequences
- On bounded redundancy of universal codes
- Lempel-Ziv factorization powered by space efficient suffix trees
- LZ77 computation based on the run-length encoded BWT
- A universal finite memory source
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- A sequential algorithm for the universal coding of finite memory sources
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
- Code-carrying theories
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Information density, structure and entropy in equilibrium and non-equilibrium systems
- Small-space LCE data structure with constant-time queries
- Sampling automata and programs
- A sensor-based framework for kinetic data compression
- A self-index on block trees
- Disjunctivity and other properties of sets of pseudo-bordered words
- Almost linear time computation of maximal repetitions in run length encoded strings
- Impugning randomness, convincingly
- On updating suffix tree labels
- Compressed Data Structures for Dynamic Sequences
- On-line construction of two-dimensional suffix trees
- A faster algorithm for computing maximal \(\alpha \)-gapped repeats in a string
- An efficient algorithm for sequence comparison with block reversals
- Composite repetition-aware data structures
- Lempel Ziv computation in small space (LZ-CISS)
- A novel lossless data compression scheme based on the error correcting Hamming codes
- Scalability and communication in parallel low-complexity lossless compression
- Random access to grammar-compressed strings and trees
- 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.
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)
