Table 1.
Method | Control objective(s) | Control action(s) | Requirements | References |
---|---|---|---|---|
Algebraic methods | Transform transient state into a steady state; Transform steady state into a transient state; Eliminate transition between two states | Assign node to specified value; Activate or inhibit specific edge | Regulatory network structure; Boolean functions written as polynomials | Murrugarra et al. (Sep 2016); Vieira et al. (2020) |
Control Kernel | Force the system to have one stable attractor | Assign node to specified value | Boolean functions written as polynomials | Choo et al. (2018); Borriello and Daniels (2021) |
Feedback Vertex Set | Force the system to have one stable attractor | Assign node to its value in the target attractor | Regulatory network structure; Node activities in target attractor | Mochizuki et al. (2013); Zañudo et al. (2017) |
Stable Motifs | Force any initial state toward a pre-existing attractor; Transform a steady-state into a transient state | Assign node to its stable motif value; Inhibit interaction to disrupt stable motif of a steady-state | Regulatory network structure; Boolean rules written in DNF | Zañudo and Albert (2015) |
This table contains a summary of the target identification techniques discussed, as well as their key features. Namely, we summarize their objectives, induced control actions, and the necessary components to use each method. Software for these methods can be found in the “Appendix”