scientific article; zbMATH DE number 1149447
From MaRDI portal
Publication:4386970
zbMath0894.68072MaRDI QIDQ4386970
Craig Nevill-Manning, Ian H. Witten
Publication date: 13 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
XML compression via directed acyclic graphs, Learning deterministic context free grammars: the Omphalos competition, LARS: a learning algorithm for rewriting systems, Approximation of smallest linear tree grammar, Linear-time text compression by longest-first substitution, Adaptive text mining: inferring structure from sequences, Balancing run-length straight-line programs, Haar-like wavelets on hierarchical trees, Sensitivity of string compressors and repetitiveness measures, Learning the Language of Biological Sequences, A \textit{really} simple approximation of smallest grammar, On the compressibility of finite languages and formal proofs, The smallest grammar problem as constituents choice and minimal grammar parsing, Approximation of grammar-based compression via recompression, Data compression with long repeated strings, Unnamed Item, Compact representations as a search strategy: compression EDAs, On the complexity of the smallest grammar problem over fixed alphabets, Exact variable-length anomaly detection algorithm for univariate and multivariate time series, Learning grammars for architecture-specific facade parsing, Forecasting market states, Finger search in grammar-compressed strings, Time Series Data Mining with an Application to the Measurement of Underwriting Cycles, Compressibility of Finite Languages by Grammars, A fully linear-time approximation algorithm for grammar-based compression, Random Access to Grammar-Compressed Strings and Trees
