Principle for performing attractor transits with single control in Boolean networks.

We present an algebraic approach to reveal attractor transitions in Boolean networks under single control based on the recently developed matrix semitensor product theory. In this setting, the reachability of attractors is estimated by the state transition matrices. We then propose procedures that compute the shortest control sequence and the result of each step of input (control) exactly. The general derivation is exemplified by numerical simulations for two kinds of gene regulation networks, the protein-nucleic acid interactions network and the cAMP receptor of Dictyostelium discoideum network.