Control of Boolean networks: hardness results and algorithms for tree structured networks.

By Tatsuya Akutsu, M. Hayashida, Wai Ki Ching, Michael Kwok-Po Ng. Journal of Theoretical Biology, 2007

546 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Observability, Reconstructibility and State Observers of Boolean Control Networks (2013, background): “lated further research in this area (see, for instance [1], [9], [16],”
Input-state incidence matrix of Boolean control networks and its applications (2010, background): “The main efforts have been put on the controllability of Boolean networks [7] [8] [9].”
Control Principles of Complex Networks (2015, background): “The controllability of Boolean networks, a class of discrete-time nonlinear systems that are often used to model gene regulations, has been intensively studied (Akutsu et al., 2007; Cheng and Qi, 2009).”
Stability and stabilization of Boolean networks (2011, background): “So far, there are only few results because we are short of systematic tool to deal with logical dynamic systems [3, 4].”
Analysis and control of Boolean networks: A semi-tensor product approach (2010, unknown): “Their structure matrices are as follows: M¬ := Mn = δ2[2, 1]; M∨ := Md = δ2[1, 1, 1, 2]; M∧ := Mc = δ2[1, 2, 2, 2]; M→ := Mi = δ2[1, 2, 1, 1]; M↔ := Me = δ2[1, 2, 2, 1].”
Controllability of Boolean control networks via the Perron-Frobenius theory (2012, background): “Akutsu et al. (2007) showed that control problems for BCNs are in general NP-hard.”