Improved time complexities for learning Boolean networks
From MaRDI portal
Recommendations
- An efficient top-down search algorithm for learning Boolean networks of gene expression
- Algorithms for Inference, Analysis and Control of Boolean Networks
- Temporal Boolean network models of genetic networks and their inference from gene expression time series.
- Differentiable learning of matricized DNFs and its application to Boolean networks
- On learning gene regulatory networks under the Boolean network model
Cites work
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 3205804 (Why is no real title available?)
- A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
- Algorithms for inferring functional dependencies from relations
- An efficient top-down search algorithm for learning Boolean networks of gene expression
- Decision lists and related Boolean functions
- Decision tree approximations of Boolean functions
- Exact learning Boolean functions via the monotone theory
- Inferring Boolean functions via higher-order correlations
- Learning functions of \(k\) relevant variables
- Learning juntas in the presence of noise
- On learning gene regulatory networks under the Boolean network model
- On restricted-focus-of-attention learnability of Boolean functions
- On the complexity of inferring functional dependencies
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
Cited in
(3)
This page was built for publication: Improved time complexities for learning Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280576)
