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.
School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China and Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China and School of Computer Information management, Inner Mongolia University of Finance and Economics, Hohhot 010051, China.
Bo
B
Gao
Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China.
Lixiang
L
Li
Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China.
Haipeng
H
Peng
Potsdam Institute for Climate Impact Research, Potsdam D-14473, Germany.
Jürgen
J
Kurths
College of Animal Science, Inner Mongolia Agricultural University, Hohhot 010018, China.
Wenguang
W
Zhang
School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China and Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China.
Yixian
Y
Yang
D000465:Algorithms; D053263:Gene Regulatory Networks; D008957:Models, Genetic