scientific article; zbMATH DE number 1149447
From MaRDI portal
Publication:4386970
zbMATH Open0894.68072MaRDI QIDQ4386970FDOQ4386970
Authors: C. Nevill-Manning, Ian H. Witten 
Publication date: 13 May 1998
Title of this publication is not available (Why is that?)
Recommendations
- A hierarchical clustering algorithm for categorical sequence data
- scientific article; zbMATH DE number 1881087
- The method for identification of hierarchical organization of protein sequences
- Sequential Prediction Over Hierarchical Structures
- Linear-time algorithms for encoding trees as sequences of node labels
- Hierarchies of weighted closed partially-ordered patterns for enhancing sequential data analysis
- Efficient relaxed search in hierarchically clustered sequence datasets
- scientific article; zbMATH DE number 7696008
- Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
Cited In (29)
- Finger search in grammar-compressed strings
- XML compression via directed acyclic graphs
- The smallest grammar problem as constituents choice and minimal grammar parsing
- Adaptive text mining: inferring structure from sequences
- Learning the language of biological sequences
- Forecasting market states
- Exact variable-length anomaly detection algorithm for univariate and multivariate time series
- Time series data mining with an application to the measurement of underwriting cycles
- Linear-time text compression by longest-first substitution
- On the complexity of the smallest grammar problem over fixed alphabets
- Random access to grammar-compressed strings and trees
- A fully linear-time approximation algorithm for grammar-based compression
- Data compression with long repeated strings
- Compressibility of Finite Languages by Grammars
- Learning deterministic context free grammars: the Omphalos competition
- Compact representations as a search strategy: compression EDAs
- Approximation of smallest linear tree grammar
- Learning grammars for architecture-specific facade parsing
- Approximation of grammar-based compression via recompression
- A \textit{really} simple approximation of smallest grammar
- Sensitivity of string compressors and repetitiveness measures
- Balancing run-length straight-line programs
- Title not available (Why is that?)
- On the compressibility of finite languages and formal proofs
- Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings
- Rpair: rescaling RePair with Rsync
- Haar-like wavelets on hierarchical trees
- LARS: a learning algorithm for rewriting systems
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386970)
