Compression of individual sequences via variable-rate coding
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Finger search in grammar-compressed strings
- Compressing table data with column dependency
- Burrows-Wheeler compression: Principles and reflections
- On the size of overlapping Lempel-Ziv and Lyndon factorizations
- Compressed automata for dictionary matching
- Redundancy estimates for the Lempel–Ziv algorithm of data compression
- Measuring chaos in the Lorenz and Rössler models: fidelity tests for reservoir computing
- Balancing and clustering of words in the Burrows-Wheeler transform
- A complexity-based measure and its application to phylogenetic analysis
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Characterization of chaotic multiscale features on the time series of melt index in industrial propylene polymerization system
- Compact q-gram profiling of compressed strings
- Quasi-distinct parsing and optimal compression methods
- Is Huffmann coding dead?
- On the distribution function of the complexity of finite sequences
- Finite state incompressible infinite sequences
- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
- Error Analysis of ZFP Compression for Floating-Point Data
- Algorithmic folding complexity
- The greedy approach to dictionary-based static text compression on a distributed system
- A normal sequence compressed by PPM* but not by Lempel-Ziv 78
- Constructing words with high distinct square densities
- On the palindromic zl-factorization and c-factorization of the generalized period-doubling sequences
- Universal prediction of random binary sequences in a noisy environment
- Information and dynamical systems: A concrete measurement on sporadic dynamics
- Indexing text using the Ziv--Lempel trie
- Phylogenetic analysis of DNA sequences based on the generalized pseudo-amino acid composition
- Computing NP-hard repetitiveness measures via MAX-SAT
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Colored operads, series on colored operads, and combinatorial generating systems
- 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?)
- 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
- Monge properties of sequence alignment
- Fast profile matching algorithms - A survey
- Finite state complexity
- On principles of emergent organization
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Using data compressors to construct order tests for homogeneity and component independence
- A universal online caching algorithm based on pattern matching
- Finding characteristic substrings from compressed texts
- Entropy rates and finite-state dimension
- On updating suffix tree labels
- The finite automata approaches in stringology
- Adaptive text mining: inferring structure from sequences
- A non-parametric symbolic approximate representation for long time series
- Perturbations and phase transitions in swarm optimization algorithms
- Information entropy as a basic building block of complexity theory
- Normality and finite-state dimension of Liouville numbers
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Collage system: A unifying framework for compressed pattern matching.
- Phase transitions in tumor growth. III: Vascular and metastasis behavior
- Comparison of LZ77-type parsings
- The structural complexity of DNA templates -- implications on cellular complexity
- Complexity and meaning in nonlinear dynamical systems
- Rényi entropy and pattern matching for run-length encoded sequences
- On the Ziv-Merhav theorem beyond Markovianity. I
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Universally typical sets for ergodic sources of multidimensional data
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Multiscale dynamic analysis of blast furnace system based on intensive signal processing
- Universal coding for memoryless sources with countably infinite alphabets
- Analytical depoissonization and its applications
- A simple storage scheme for strings achieving entropy bounds
- Second Thoughts on the Second Law
- Pebble-depth
- Inline vector compression for computational physics
- Pushdown and Lempel-Ziv depth
- scientific article; zbMATH DE number 3863086 (Why is no real title available?)
- Succinct 2D dictionary matching
- Parallel comparison of run-length-encoded strings on a linear systolic array
- Lempel-Ziv-78 compressed string dictionaries
- Lempel-Ziv factorization powered by space efficient suffix trees
- Self-indexing based on LZ77
- Eulerian entropy and non-repetitive subword complexity
- 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
- Complexity-based permutation entropies: from deterministic time series to white noise
- Pushdown dimension
- WORD COMPLEXITY AND REPETITIONS IN WORDS
- On compressing and indexing repetitive sequences
- Compror: On-line lossless data compression with a factor oracle.
- Metric properties about Banach averages and super simply normal numbers
- Factorizing strings into repetitions
- Optimal encoding of non-stationary sources
- Contrasting stochasticity with chaos in a permutation Lempel-Ziv complexity -- Shannon entropy plane
- Phase transitions in tumor growth. VI: Epithelial-mesenchymal transition
- Dynamic Path-decomposed Tries
- Bounded pushdown dimension vs Lempel Ziv information density
- A linearly computable measure of string complexity
- Compression in the presence of shared data
- On the average redundancy rate of the Lempel-Ziv code with the k-error protocol
- LZD factorization: simple and practical online grammar compression with variable-to-fixed encoding
This page was built for publication: Compression of individual sequences via variable-rate coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4174617)
