Frontiers of Information Technology & Electronic Engineering
>> 2020,
Volume 21,
Issue 2
doi:
10.1631/FITEE.1900411
Orginal Article
Optimal one-bit perturbation in Boolean networks based on cascading aggregation
1. School of Mathematics and Information Sciences, Weifang University, Weifang 261061, China
2. School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapore |
Available online: 2020-04-01
Next
Previous
Abstract
We investigate the problem of finding optimal one-bit perturbation that maximizes the size of the basin of attractions (BOAs) of desired attractors and minimizes the size of the BOAs of undesired attractors for large-scale Boolean networks by cascading aggregation. First, via the aggregation, a necessary and sufficient condition is given to ensure the invariance of desired attractors after one-bit perturbation. Second, an algorithm is proposed to identify whether the one-bit perturbation will cause the emergence of new attractors or not. Next, the change of the size of BOAs after one-bit perturbation is provided in an algorithm. Finally, the efficiency of the proposed method is verified by a T-cell receptor network.
京公网安备 11010502051620号
