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):
Displaying 50 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)
- Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← 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)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- Inductive synthesis of cover-grammars with the help of ant colony optimization (Q1692068) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- The smallest grammar problem as constituents choice and minimal grammar parsing (Q1736491) (← links)
- Collage system: A unifying framework for compressed pattern matching. (Q1874240) (← links)
- Using ideas of Kolmogorov complexity for studying biological texts (Q1946512) (← links)
- Time-universal data compression (Q2004897) (← links)
- Compaction of Church numerals (Q2005559) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Asymptotically most powerful tests for random number generators (Q2059421) (← links)
- Grammar index by induced suffix sorting (Q2146128) (← links)
- An LMS-based grammar self-index with local consistency properties (Q2146131) (← links)
- On stricter reachable repetitiveness measures (Q2146140) (← links)
- GraCT: a grammar-based compressed index for trajectory data (Q2212550) (← links)
- Block trees (Q2221797) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← 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)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Syntactic Methods for ECG Signal Diagnosis and QRS Complexes Recognition (Q3297211) (← links)
- A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA (Q3395142) (← links)
- Grammar-Based Tree Compression (Q3451087) (← 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)
- (Q5009616) (← links)
- UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS (Q5044311) (← links)
- Optimal rank and select queries on dictionary-compressed text (Q5088891) (← links)
- (Q5088899) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
