Algorithm to identify the optimal perturbation based on the net basin‐of‐state of perturbed states in Boolean network |
| |
| Authors: | Liangzhong Shen Xiangzhen Zan Wenbin Liu |
| |
| Affiliation: | 1. Department of Information Engineering, Wenzhou Business College, Wenzhou Zhejiang, People''s Republic of China ; 2. Institute of Computational Science and Technology, Guangzhou University, Guangzhou Guangdong, People''s Republic of China |
| |
| Abstract: | 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..Inspec keywords: perturbation theory, genetics, Boolean functionsOther keywords: optimal perturbation, perturbed states, Boolean network, gene regulatory networks, basin‐of‐states‐based algorithm, state‐transition diagram, structural intervention, perturbation gain, synthetic biological networks, real biological networks, 1 bit perturbation |
| |
| Keywords: | |
|
|
