The following pages link to (Q4386970):
Displaying 28 items.
- XML compression via directed acyclic graphs (Q269349) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- Adaptive text mining: inferring structure from sequences (Q876712) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- The smallest grammar problem as constituents choice and minimal grammar parsing (Q1736491) (← links)
- Learning grammars for architecture-specific facade parsing (Q1800054) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Exact variable-length anomaly detection algorithm for univariate and multivariate time series (Q2287723) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- Learning deterministic context free grammars: the Omphalos competition (Q2384127) (← links)
- LARS: a learning algorithm for rewriting systems (Q2384128) (← links)
- Compact representations as a search strategy: compression EDAs (Q2503341) (← links)
- A fully linear-time approximation algorithm for grammar-based compression (Q2569418) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- Learning the Language of Biological Sequences (Q2963599) (← links)
- (Q4797060) (← links)
- (Q5088899) (← links)
- Forecasting market states (Q5234372) (← links)
- Time Series Data Mining with an Application to the Measurement of Underwriting Cycles (Q5241947) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)
- Data compression with long repeated strings (Q5944433) (← links)
- Haar-like wavelets on hierarchical trees (Q6123347) (← links)
- Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings (Q6536243) (← links)
- Rpair: rescaling RePair with Rsync (Q6536245) (← links)
