Control of Boolean networks: hardness results and algorithms for tree structured networks
DOI10.1016/j.jtbi.2006.09.023zbMath1450.92040OpenAlexW2077895748WikidataQ51930042 ScholiaQ51930042MaRDI QIDQ2209150
Wai-Ki Ching, Tatsuya Akutsu, Morihiro Hayashida, Michael Kwok-Po Ng
Publication date: 28 October 2020
Published in: Journal of Theoretical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jtbi.2006.09.023
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Systems biology, networks (92C42) Boolean control/observation systems (93C29) Networked control (93B70)
Related Items (only showing first 100 items - show all)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Synthesis of optimal controllers for piecewise affine systems with sampled-data switching
- External control in Markovian genetic regulatory networks
- Boolean dynamics of networks with scale-free topology
- The computational complexity of probabilistic inference using Bayesian belief networks
- Superpolynomial Growth in the Number of Attractors in Kauffman Networks
- A Control Model for Markovian Genetic Regulatory Networks
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications
- Optimal infinite-horizon control for probabilistic Boolean networks
- Emergence of complex dynamics in a simple model of signaling networks
This page was built for publication: Control of Boolean networks: hardness results and algorithms for tree structured networks