Open AccessAlgorithm to identify the optimal perturbation based on the net basin‐of‐state of perturbed states in Boolean network
Author(s) -
Shen Liangzhong,
Zan Xiangzhen,
Liu Wenbin
Publication year - 2018
Publication title -
iet systems biology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.367
H-Index - 50
eISSN - 1751-8857
pISSN - 1751-8849
DOI - 10.1049/iet-syb.2017.0091
Subject(s) - attractor , perturbation (astronomy) , boolean network , mathematics , biological network , gene regulatory network , computer science , boolean function , algorithm , physics , combinatorics , mathematical analysis , biology , gene , biochemistry , gene expression , quantum mechanics
Boolean networks are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long‐term behavior of systems. Here, the authors investigate the 1 bit perturbation, which falls under the category of structural intervention. The authors’ idea is that, if and only if a perturbed state evolves from a desirable attractor to an undesirable attractor or from an undesirable attractor to a desirable attractor, then the size of basin of attractor of a desirable attractor may decrease or increase. In this case, if the authors obtain the net BOS of the perturbed states, they can quickly obtain the optimal 1 bit perturbation by finding the maximum value of perturbation gain. Results from both synthetic and real biological networks show that the proposed algorithm is not only simpler and but also performs better than the previous basin‐of‐states (BOS)‐based algorithm by Hu et al. .