Improved time complexities for learning Boolean networks
From MaRDI portal
Publication:280576
DOI10.3390/E15093762zbMATH Open1357.68191OpenAlexW2126782682MaRDI QIDQ280576FDOQ280576
Publication date: 10 May 2016
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e15093762
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
Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Title not available (Why is that?)
- On the complexity of inferring functional dependencies
- On restricted-focus-of-attention learnability of Boolean functions
- On learning gene regulatory networks under the Boolean network model
- A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
- Learning functions of \(k\) relevant variables
- Inferring Boolean functions via higher-order correlations
- Learning juntas in the presence of noise
- Exact learning Boolean functions via the monotone theory
- Algorithms for inferring functional dependencies from relations
- Title not available (Why is that?)
- Decision lists and related Boolean functions
- Decision tree approximations of Boolean functions
- An efficient top-down search algorithm for learning Boolean networks of gene expression
Cited In (2)
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)
