FINDING AND ANALYZING THE MINIMUM SET OF DRIVER NODES IN CONTROL OF BOOLEAN NETWORKS-Reference-Cited by-同舟云学术

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

Published:2016-05 Issue:03 Volume:19 Page:1650006
ISSN:0219-5259
Container-title:Advances in Complex Systems
language:en
Short-container-title:Advs. Complex Syst.

Author:

HOU WENPIN¹,TAMURA TAKEYUKI²,CHING WAI-KI¹,AKUTSU TATSUYA²^ORCID

Affiliation:

1. Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong 999077, Hong Kong

2. Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto 611-0011, Japan

Abstract

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.

Funder

Japan Society for the Promotion of Science

Publisher

World Scientific Pub Co Pte Lt

Subject

Control and Systems Engineering

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219525916500065

Reference80 articles.

1. Control of Boolean networks: Hardness results and algorithms for tree structured networks

2. Analyses and Algorithms for Predecessor and Control Problems for Boolean Networks of Bounded Indegree

3. Inferring qualitative relations in genetic networks and metabolic pathways

4. Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A practically efficient algorithm for identifying critical control proteins in directed probabilistic biological networks;npj Systems Biology and Applications;2024-08-12

2. UNCERTAINTY VISUALIZATION FOR CHARACTERIZING HETEROGENEOUS HUMAN BEHAVIORS IN DISCRETE DYNAMICAL SYSTEM MODELS;Advances in Complex Systems;2023-08-24

3. On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors;Journal of Theoretical Biology;2019-02

4. On the Number of Driver Nodes for Controlling a Boolean Network to Attractors;2018-08-20

5. Evolution of control with learning classifier systems;Applied Network Science;2018-08-13