Completing networks using observed data
From MaRDI portal
Recommendations
- On learning gene regulatory networks under the Boolean network model
- Control of Boolean networks: hardness results and algorithms for tree structured networks
- Algorithms for Inference, Analysis and Control of Boolean Networks
- Observability of Boolean networks: a graph-theoretic approach
- Algorithms for analysis, inference, and control of Boolean networks
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Computational limitations on learning from examples
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model.
- Learning a circuit by injecting values
- Learning acyclic probabilistic circuits using test paths
- Learning large-alphabet and analog circuits with value injection queries
- Structure of regulatory networks and diversity of gene expression patterns
Cited in
(7)- Modeling delayed dynamics in biological regulatory networks from time series data
- Learning explanations for biological feedback with delays using an event calculus
- Learning from interpretation transition
- Completing causal networks by meta-level abduction
- Learning Boolean logic models of signaling networks with ASP
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- Completing SBGN-AF networks by logic-based hypothesis finding
This page was built for publication: Completing networks using observed data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648747)
