Compression of individual sequences via variable-rate coding
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- On the distribution function of the complexity of finite sequences
- Dimension extractors and optimal decompression
- Measuring the efficiency of the intraday Forex market with a universal data compression algorithm
- Phylogenetic inference from binary sequences reduced by primary DNA sequences
- A complexity-based measure and its application to phylogenetic analysis
- The effect of microarray image compression on expression-based classification
- Analytical depoissonization and its applications
- On updating suffix tree labels
- AUTOMATE, a computing package for automata and finite semigroups
- Data compression with factor automata
- A comparative classification of complexity measures
- P-complete problems in data compression
- A worst-case analysis of the LZ2 compression algorithm
- Truncated suffix trees and their application to data compression.
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
- Universal prediction of random binary sequences in a noisy environment
- 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
- Approximate string matching with compressed indexes
- Linear-time text compression by longest-first substitution
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files
- Adaptive vector quantization for lossy compression of image sequences
- On optimal parsing for LZ78-like compressors
- Lempel-Ziv data compression on parallel and distributed systems
- The smallest grammar problem as constituents choice and minimal grammar parsing
- Computing the longest previous factor
- Parallel Lempel Ziv coding
- Comparison of protein secondary structures based on backbone dihedral angles
- Data compression and genomes: a two-dimensional life domain map
- Strongly consistent nonparametric forecasting and regression for stationary ergodic sequences.
- Optimal data compression algorithm
- Transducers and repetitions
- Regular expression searching on compressed text
- Approximate string matching on Ziv--Lempel compressed text
- Compror: On-line lossless data compression with a factor oracle.
- Collage system: A unifying framework for compressed pattern matching.
- Uniform words
- Finite-state dimension
- Robust universal complete codes for transmission and compression
- Unified compression-based acceleration of edit-distance computation
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- Dimension is compression
- Colored operads, series on colored operads, and combinatorial generating systems
- On the complexity of the smallest grammar problem over fixed alphabets
- Computing absolutely normal numbers in nearly linear time
- Complexity-based permutation entropies: from deterministic time series to white noise
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Metric properties about Banach averages and super simply normal numbers
- Factorizing strings into repetitions
- Contrasting stochasticity with chaos in a permutation Lempel-Ziv complexity -- Shannon entropy plane
- On the approximation ratio of LZ-end to LZ77
- Phase transitions in tumor growth. VI: Epithelial-mesenchymal transition
- A parametrized family of Tversky metrics connecting the Jaccard distance to an analogue of the normalized information distance
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report)
- A search for good pseudo-random number generators: survey and empirical studies
- Color image steganography scheme using gray invariant in AMBTC compression domain
- A combinatorial view on string attractors
- Selection of a metric for the nearest neighbor entropy estimators
- Phylogenetic analysis of DNA sequences based on the generalized pseudo-amino acid composition
- Distance measures for biological sequences: some recent approaches
- Lempel-Ziv compressed structures for document retrieval
- Direct merging of delta encoded files
- Finger search in grammar-compressed strings
- A non-parametric symbolic approximate representation for long time series
- Sampling automata and programs
- Approximate pattern matching in LZ77-compressed texts
- Compressed automata for dictionary matching
- Constructing LZ78 tries and position heaps in linear time for large alphabets
- Fast distance multiplication of unit-Monge matrices
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Universal coding for memoryless sources with countably infinite alphabets
- Fast gapped variants for Lempel-Ziv-Welch compression
- Dimensions of Copeland-Erdös sequences
- Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
- Succinct 2D dictionary matching
- Sublinear algorithms for approximating string compressibility
- Stronger Lempel-Ziv based compressed text indexing
- Note on the greedy parsing optimality for dictionary-based text compression
- Burrows-Wheeler compression: Principles and reflections
- Compressing table data with column dependency
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- Opportunistic data structures for range queries
- The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems
- A fully linear-time approximation algorithm for grammar-based compression
- Finite state incompressible infinite sequences
- Grammar-compressed indexes with logarithmic search time
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- Optimal in-place suffix sorting
- Recurrence times, waiting times and universal entropy production estimators
- Sensitivity of string compressors and repetitiveness measures
- Convergence properties of functional estimates for discrete distributions
- Size and path length of Patricia tries: Dynamical sources context
- Information entropy as a basic building block of complexity theory
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- General document retrieval in compact space
- Random access to high-order entropy compressed text
- Normality and finite-state dimension of Liouville numbers
- Computing \(q\)-gram non-overlapping frequencies on SLP compressed texts
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)
