Fixed-time and fixed-destination optimal control of Boolean control networks reduce to shortest path problems in time-expanded state transition graphs, solvable by dynamic programming or Dijkstra's algorithm.
Boolean modeling of biological regulatory networks: a methodology tutorial,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Finite-Horizon Optimal Control of Boolean Control Networks: A Unified Graph-Theoretical Approach
Fixed-time and fixed-destination optimal control of Boolean control networks reduce to shortest path problems in time-expanded state transition graphs, solvable by dynamic programming or Dijkstra's algorithm.