Pages that link to "Item:Q1401326"
From MaRDI portal
The following pages link to Application of Lempel-Ziv factorization to the approximation of grammar-based compression. (Q1401326):
Displaying 50 items.
- Finite state incompressible infinite sequences (Q259039) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Straight-line programs: a practical test (extended abstract) (Q376125) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Compact q-gram profiling of compressed strings (Q401308) (← links)
- 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)
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs (Q456098) (← links)
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Leaf languages and string compression (Q550251) (← links)
- On z-factorization and c-factorization of standard episturmian words (Q719264) (← links)
- Finite state complexity (Q719308) (← links)
- LZ77 computation based on the run-length encoded BWT (Q724214) (← links)
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings (Q832954) (← links)
- Speeding up HMM decoding and training by exploiting sequence repetitions (Q834590) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- Prime normal form and equivalence of simple grammars (Q860856) (← links)
- Binary jumbled pattern matching on trees and tree-like structures (Q893318) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Comparison of LZ77-type parsings (Q1621503) (← links)
- A separation between RLSLPs and LZ77 (Q1632509) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← 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)
- Tree compression using string grammars (Q1742370) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Balancing straight-line programs for strings and trees (Q2106614) (← links)
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words (Q2136272) (← links)
- An LMS-based grammar self-index with local consistency properties (Q2146131) (← links)
- On the approximation ratio of LZ-end to LZ77 (Q2146133) (← links)
- Block trees (Q2221797) (← links)
- Cadences in grammar-compressed strings (Q2232293) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- Approximate pattern matching in LZ77-compressed texts (Q2343301) (← links)
- Compressed automata for dictionary matching (Q2344744) (← links)
- Block graphs in practice (Q2363994) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Generalized substring compression (Q2437745) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- Finding the smallest binarization of a CFG is NP-hard (Q2637648) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
