期刊
ADVANCES IN COMPLEX SYSTEMS
卷 19, 期 3, 页码 -出版社
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0219525916500065
关键词
Boolean networks; Boolean control; integer linear programming; genetic networks; driver nodes
资金
- JSPS, Japan [25730005, 25250028, 26240034]
- Grants-in-Aid for Scientific Research [25250028, 26540125, 25730005, 16K00391] Funding Source: KAKEN
We study the minimum number of driver nodes control of which leads a Boolean network (BN) from an initial state to a target state in a specified number of time steps. We show that the problem is NP-hard and present an integer linear programming-based method that solves the problem exactly. We mathematically analyze the average size of the minimum set of driver nodes for random Boolean networks with bounded in-degree and with a small number of time steps. The results of computational experiments using randomly generated BNs show good agreements with theoretical analyses. A further examination in realistic BNs demonstrates the efficiency and generality of our theoretical analyses.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据