We study the target control problem of asynchronous Boolean networks, to identify a set of nodes, the perturbation of which can drive the dynamics of the network from any initial state to the desired steady state (or attractor). We are particularly interested in temporary perturbations, which are applied for sufficient time and then released to retrieve the original dynamics. Temporary perturbations have the apparent advantage of averting unforeseen consequences, which might be induced by permanent perturbations. Despite the infamous state-space explosion problem, in this work, we develop an efficient method to compute the temporary target control for a given target attractor of a Boolean network. We apply our method to a number of real-life biological networks and compare its performance with the stable motif-based control method to demonstrate its efficacy and efficiency.
Minimal Controllability of Conjunctive Boolean Networks is NP-Complete
Tel Aviv University(特拉维夫大学);School of Electrical Engineering-Systems, Tel Aviv University(特拉维夫大学电气工程系);Sagol School of Neuroscience, Tel Aviv University(特拉维夫大学萨戈尔神经科学学院)
The School of Computer and Information Science, Southwest University(西南大学计算机与信息科学学院);Birkbeck, University of London(伦敦大学伯贝克学院);University of Luxembourg(卢森堡大学)
Stochastic Average Consensus Filtering and Distributed State Estimation for Boolean Control Networks
School of Mathematics, Southwestern University of Finance and Economics(西南财经大学数学学院);School of Computing and Artificial Intelligence, Southwestern University of Finance and Economics(西南财经大学计算机与人工智能学院)
Towards the Existential Control of Boolean Networks: A Preliminary Report (Extended Abstract)
Interdisciplinary Centre for Security, Reliability and Trust(安全、可靠性与信任跨学科中心);Faculty of Science, Technology and Communication, University of Luxembourg(卢森堡大学科学与技术传播学院)
Infinite-Horizon Optimal Control of Switched Boolean Control Networks with Average Cost: An Efficient Graph-Theoretical Approach
本研究探讨具有平均成本准则之切换式布林控制网路之无限时域最佳控制问题。这个问题的一个主要挑战是在处理大规模网络时的高计算成本。我们试图开发一个更有效的和可扩展的方法,从图论的角度来看。首先,一个加权有向图结构称为$\textit{optimal state transition graph}$(OSTG)的建立,其边缘编码的最佳行动,从一个给定的初始状态之间的状态可达的一步之间的转换受到各种约束。然后,我们减少了无限时域最优控制问题的最小平均周期(MMC)问题的OSTG。最后,我们开发了一种新的算法,可以快速找到一个特定的MMC诉诸Karp算法在图论中,然后构造一个最优的开关和控制律的基础上的状态反馈。时间复杂度分析表明,我们的算法可以优于现有的方法在时间效率方面。一个16节点的白血病信号网络被用来作为一个基准来测试其有效性。结果表明,所提出的图论方法的计算效率要高得多:它的运行速度比现有方法快数百甚至数千倍。
Categorization Problem on Controllability of Boolean Control Networks
School of Mathematical Sciences, Fudan University(复旦大学数学科学学院);Booth School of Business, University of Chicago(芝加哥大学布斯商学院);School of Mathematics and Computer Science, Zhejiang Normal University(浙江师范大学数学与计算机科学学院);School of Information Science and Engineering, Central South University(中南大学信息科学与工程学院)
Measurement-Induced Boolean Dynamics and Controllability for Quantum Networks
Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院);The Australian National University(澳大利亚国立大学);The University of Sydney(悉尼大学)
CANA: A python package for quantifying control and canalization in Boolean Networks
School of Informatics, Computing, and Engineering Indiana University(印第安纳大学信息学、计算与工程学院);CAPES Foundation, Ministry of Education of Brazil(巴西教育部CAPAS基金会);Center for Complex Networks Research, Northeastern University(东北大学复杂网络研究中心)