A universal algorithm for sequential data compression
From MaRDI portal
(Redirected from 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)- Fountain codes for lossless data compression
- Fast equality test for straight-line compressed strings
- Inline vector compression for computational physics
- Pushdown and Lempel-Ziv depth
- Computing regularities in strings: a survey
- Lempel-Ziv factorization powered by space efficient suffix trees
- LZ77 computation based on the run-length encoded BWT
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Self-indexing based on LZ77
- FM-index of alignment: a compressed index for similar strings
- A diffusion limit for a class of randomly-growing binary trees
- A novel block-based scheme for arithmetic coding
- Optimal data compression algorithm
- On optimal parsing for LZ78-like compressors
- Non-sequential recursive pair substitution: some rigorous results
- Diverse Palindromic Factorization Is NP-complete
- Ziv-Lempel and Crochemore factorizations of the generalized period-doubling word
- A separation between RLSLPs and LZ77
- WORD COMPLEXITY AND REPETITIONS IN WORDS
- On compressing and indexing repetitive sequences
- De Novo NGS Data Compression
- Compror: On-line lossless data compression with a factor oracle.
- Factorizing strings into repetitions
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words
- Optimal encoding of non-stationary sources
- Universal data compression and repetition times
- Contrasting stochasticity with chaos in a permutation Lempel-Ziv complexity -- Shannon entropy plane
- ODC: frame for definition of dense codes
- Phase transitions in tumor growth. VI: Epithelial-mesenchymal transition
- Personalized multi-user view and content synchronization and retrieval in real-time mobile social software applications
- Multivariate permutation entropy and its application for complexity analysis of chaotic systems
- An example of mathematical authorship attribution
- Compression in the presence of shared data
- Efficient parallel algorithms to test square-freeness and factorize strings
- Posterior representations for Bayesian context trees: sampling, estimation and convergence
- An efficient algorithm for sequence comparison with block reversals
- Compressed depth sequences
- Tight bounds for the sensitivity of CDAWGs with left-end edits
- Compressed membership in automata with compressed labels
- Binary image compression via monochromatic pattern substitution: sequential and parallel implementations
- Impugning randomness, convincingly
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- The heaviest induced ancestors problem revisited
- Generative complexity of Gray-Scott model
- Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics
- Practical and flexible pattern matching over Ziv-Lempel compressed text.
- Estimation of muscle spindle information rate by pattern matching and the effect of gamma system activity on parallel spindles
- Linear-time text compression by longest-first substitution
- Semiconductor Emitters in Entropy Sources for Quantum Random Number Generation
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- Optimal partitioning of data chunks in deduplication systems
- Channel simulation: theory and applications to lossy compression and differential privacy
- Sublinear algorithms for approximating string compressibility
- On the complexity and approximability of bounded access Lempel Ziv coding
- Shortest unique palindromic substring queries in semi-dynamic settings
- A separation of \(\gamma\) and \(b\) via Thue-Morse words
- An LMS-based grammar self-index with local consistency properties
- Grammar index by induced suffix sorting
- Phase transitions in tumor growth. V: What can be expected from cancer glycolytic oscillations?
- The heaviest induced ancestors problem: better data structures and applications
- Selective dynamic compression
- Synchronizing dynamic Huffman codes
- The three squares lemma revisited
- Fast distance multiplication of unit-Monge matrices
- Lossless compression and information hiding in images
- Universal coding and prediction on ergodic random points
- Large-scale detection of repetitions
- Compression using lossless decimation: analysis and application
- Lempel-Ziv-like parsing in small space
- scientific article; zbMATH DE number 1192494 (Why is no real title available?)
- Time-space trade-offs for compressed suffix arrays.
- Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
- Differentially private compression and the sensitivity of LZ77
- Space-efficient SLP encoding for O( N)-time random access
- Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data
- Refining the \(r\)-index
- Mathematical models of textual data: a short review
- Statistical properties of the rooted-tree encoding of \(\mathbb{N}\)
- XML compression techniques: A survey and comparison
- Sequential universal modeling for non-binary sequences with constrained distributions
- Matching statistics -- a survey
- Note on the greedy parsing optimality for dictionary-based text compression
- Edit and alphabet-ordering sensitivity of lex-parse
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files
- On universal algorithms for classifying and predicting stationary processes
- LZ78 compression in low main memory space
- scientific article; zbMATH DE number 4045113 (Why is no real title available?)
- Completing prefix codes in submonoids.
- Universal Data Compression Algorithm Based on Approximate String Matching
- Engineering practical Lempel-Ziv tries
- Lempel-Ziv data compression on parallel and distributed systems
- String Indexing with Compressed Patterns
- Estimation of the Entropy Rate of a Countable Markov Chain
- An Introduction to Neural Data Compression
- Parallel Lempel Ziv coding
- Internal pattern matching queries in a text and applications
- A fast dynamic compression scheme for natural language texts
- Composite repetition-aware data structures
- Lempel Ziv computation in small space (LZ-CISS)
- A fully linear-time approximation algorithm for grammar-based 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)