Algorithms for Inference, Analysis and Control of Boolean Networks
From MaRDI portal
Publication:3599189
DOI10.1007/978-3-540-85101-1_1zbMath1171.92330OpenAlexW1833452641MaRDI QIDQ3599189
Morihiro Hayashida, Takeyuki Tamura, Tatsuya Akutsu
Publication date: 3 February 2009
Published in: Algebraic Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85101-1_1
Biochemistry, molecular biology (92C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Unnamed Item
- Identification of all steady states in large networks by logical analysis
- An analytical study of the number of steady states in gene regulatory networks
- Performance analysis of a greedy algorithm for inferring Boolean functions
- External control in Markovian genetic regulatory networks
- Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model.
- Learning functions of \(k\) relevant variables
- Control of Boolean networks: hardness results and algorithms for tree structured networks
- Improving the efficiency of attractor cycle identification in Boolean networks
- Superpolynomial Growth in the Number of Attractors in Kauffman Networks
- A Control Model for Markovian Genetic Regulatory Networks
- An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
- When Does Greedy Learning of Relevant Attributes Succeed?
- Optimal infinite-horizon control for probabilistic Boolean networks
This page was built for publication: Algorithms for Inference, Analysis and Control of Boolean Networks