Pages that link to "Item:Q4503585"
From MaRDI portal
The following pages link to Grammar-based codes: a new class of universal lossless source codes (Q4503585):
Displayed 25 items.
- A bisection algorithm for grammar-based compression of ordered trees (Q407558) (← links)
- Searching for smallest grammars on large sequences and application to DNA (Q414452) (← links)
- Quasi-distinct parsing and optimal compression methods (Q417983) (← links)
- Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
- Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617) (← links)
- On bounded redundancy of universal codes (Q712553) (← links)
- Universal codes as a basis for time series testing (Q713722) (← links)
- Variable-length coding of two-sided asymptotically mean stationary measures (Q966513) (← links)
- XML compression techniques: A survey and comparison (Q1021579) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression. (Q1401326) (← links)
- Collage system: A unifying framework for compressed pattern matching. (Q1874240) (← links)
- Using ideas of Kolmogorov complexity for studying biological texts (Q1946512) (← links)
- A fast and efficient nearly-optimal adaptive Fano coding scheme (Q2489208) (← links)
- Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series (Q2503313) (← links)
- Universal codes as a basis for nonparametric testing of serial independence for time series (Q2507879) (← links)
- A fully linear-time approximation algorithm for grammar-based compression (Q2569418) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA (Q3395142) (← links)
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (Q3602815) (← links)
- Quasi-distinct Parsing and Optimal Compression Methods (Q3637102) (← links)
- IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS (Q3655534) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS (Q5714664) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
