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 条

[31] Set controllability of Boolean control networks with impulsive effects
Li, Yiliang
Li, Jinjin
Feng, Jun-e
NEUROCOMPUTING, 2020, 418 : 263 - 269
[32] A minimum-time control for Boolean control networks with impulsive disturbances
Chen, Hongwei
Wu, Bo
Lu, Jianquan
APPLIED MATHEMATICS AND COMPUTATION, 2016, 273 : 477 - 483
[33] Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes
Imae, Takanobu
Cai, Kai
SYSTEMS & CONTROL LETTERS, 2021, 156
[34] Finding all controllers for disturbance decoupling of Boolean control networks
Yang, Meng
Chu, Tianguang
PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 1344 - 1349
[35] Minimum-Time Control of Boolean Networks: An Algebraic Approach
Laschov, Dmitriy
Margaliot, Michael
2014 IEEE 53RD ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2014, : 1545 - 1550
[36] Minimum dominating set-based methods for analyzing biological networks
Nacher, Jose C.
Akutsu, Tatsuya
METHODS, 2016, 102 : 57 - 63
[37] Set Invariance and Optimal Set Stabilization of Boolean Control Networks: A Graphical Approach
Gao, Shuhua
Xiang, Cheng
Lee, Tong Heng
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2021, 8 (01): : 400 - 412
[38] Set stability and set stabilization of Boolean control networks based on invariant subsets
Guo, Yuqian
Wang, Pan
Gui, Weihua
Yang, Chunhua
AUTOMATICA, 2015, 61 : 106 - 112
[39] Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks
Tamura, Takeyuki
Akutsu, Tatsuya
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2010, E93A (08): : 1497 - 1507
[40] Structure-based approach to identify driver nodes in ensembles of biologically inspired Boolean networks
Newby, Eli
Zanudo, Jorge Gomez Tejeda
Albert, Reka
PHYSICAL REVIEW RESEARCH, 2023, 5 (03):

← 1 2 3 4 5 →