|
|
Frontiers of Information Technology & Electronic Engineering
ISSN 2095-9184 (print), ISSN 2095-9230 (online)
2020 Vol.21 No.2 P.294-303
Optimal one-bit perturbation in Boolean networks based on cascading aggregation
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.
Key words: Large-scale Boolean network, Attractor, Cascading aggregation, One-bit perturbation
1潍坊学院数学与信息科学学院，中国潍坊市，261061
2南洋理工大学电气与电子工程学院，新加坡，639798
摘要：研究级联聚合算法分割下的大型布尔网络最优单点摄动问题；最大化期望吸引子吸引域，同时最小化非期望吸引子吸引域。首先，通过级联聚合算法给出一个在单点摄动下保持期望吸引子不变的充要条件。其次，提出一个判定是否出现新吸引子的算法。然后，提出另一算法给出单点摄动下吸引子吸引域的大小变化。最后，将本文理论应用于寻找T细胞受体网络的最优单点摄动问题。
关键词组：
References:
Open peer comments: Debate/Discuss/Question/Opinion
<1>
DOI:
10.1631/FITEE.1900411
CLC number:
O223
Download Full Text:
Downloaded:
1684
Download summary:
<Click Here>Downloaded:
1503Clicked:
4497
Cited:
0
On-line Access:
2020-03-04
Received:
2019-08-17
Revision Accepted:
2019-10-19
Crosschecked:
2019-11-15