FINDING AND ANALYZING THE MINIMUM SET OF DRIVER NODES IN CONTROL OF BOOLEAN NETWORKS

被引：4
|
作者：
Hou, Wenpin [1 ]
Tamura, Takeyuki [2 ]
Ching, Wai-Ki [1 ]
Akutsu, Tatsuya [2 ]
机构：
[1] Univ Hong Kong, Dept Math, Pokfulam Rd, Hong Kong 999077, Hong Kong, Peoples R China
[2] Kyoto Univ, Inst Chem Res, Bioinformat Ctr, Kyoto 6110011, Japan
来源：
ADVANCES IN COMPLEX SYSTEMS | 2016年 / 19卷 / 03期
关键词：
Boolean networks; Boolean control; integer linear programming; genetic networks; driver nodes; GENE REGULATORY NETWORKS; YEAST-CELL-CYCLE; CONTROLLABILITY; DYNAMICS; MODEL; SYSTEMS; PREDICTS; BIOLOGY; TARGET; CANCER;
D O I：
10.1142/S0219525916500065
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页数：32
相关论文
共 50 条
  • [1] Finding and analysing the minimum set of driver nodes required to control multilayer networks
    Nacher, Jose C.
    Ishitsuka, Masayuki
    Miyazaki, Shuichi
    Akutsu, Tatsuya
    SCIENTIFIC REPORTS, 2019, 9 (1)
  • [2] Finding and analysing the minimum set of driver nodes required to control multilayer networks
    Jose C. Nacher
    Masayuki Ishitsuka
    Shuichi Miyazaki
    Tatsuya Akutsu
    Scientific Reports, 9
  • [3] Finding complete minimum driver node set with guaranteed control capacity
    Jia, Shuai
    Xi, Yugeng
    Li, Dewei
    Shao, Haibin
    NEUROCOMPUTING, 2022, 500 : 949 - 964
  • [4] Determining minimum set of driver nodes in protein-protein interaction networks
    Xiao-Fei Zhang
    Le Ou-Yang
    Yuan Zhu
    Meng-Yun Wu
    Dao-Qing Dai
    BMC Bioinformatics, 16
  • [5] Determining minimum set of driver nodes in protein-protein interaction networks
    Zhang, Xiao-Fei
    Le Ou-Yang
    Zhu, Yuan
    Wu, Meng-Yun
    Dai, Dao-Qing
    BMC BIOINFORMATICS, 2015, 16
  • [6] Minimum Driver Nodes Selection in Complex Networks
    Zhang, Pingping
    Ji, Zhijian
    Li, Ziqiang
    PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017), 2017, : 8461 - 8466
  • [7] Minimum Node Control of Boolean Networks
    Pan, Jinfeng
    Feng, Jun-e
    Wang, Biao
    PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, : 468 - 472
  • [8] On Minimum Realization of Boolean Control Networks
    Yu, Yongyuan
    Wang, Caixia
    Feng, Jun-e
    Chen, Ge
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2024, 69 (06) : 4094 - 4101
  • [9] Finding Influential Nodes in Social Networks Using Minimum k-Hop Dominating Set
    Basuchowdhuri, Partha
    Majumder, Subhashis
    APPLIED ALGORITHMS, 2014, 8321 : 137 - 151
  • [10] On the complexity of finding control strategies for Boolean networks
    Akutsu, T
    Hayashida, M
    Ching, WK
    Ng, MK
    Proceedings of the 4th Asia-Pacific Bioinformatics Conference, 2006, 3 : 99 - 108
12345