arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.07221eess.SYcs.SY
收藏

基于分解的方法在布尔网络控制中的应用(技术报告)

A Decomposition-based Approach towards the Control of Boolean Networks (Technical Report)

SnT, University of Luxembourg(卢森堡大学 SnT);SnT & FSTC, University of Luxembourg(卢森堡大学 SnT 和 FSTC);LCSB, University of Luxembourg(卢森堡大学 LCSB)

Soumya Paul, Cui Su, Jun Pang, Andrzej Mizera

AI总结:

本文提出基于分解的布尔网络最小控制方法,通过利用网络结构和动态特性提高大规模网络的计算效率,并在生物网络和随机网络中验证了其有效性。

摘要:

我们研究了计算给定异步布尔网络中需要控制的最小节点子集的问题,以将动态从初始稳态(或吸引子)驱动到目标稳态。由于状态空间爆炸现象,对整个网络进行全局计算的简单方法可能无法在大规模网络中扩展。我们相信,针对此类网络的高效算法必须利用网络的结构及其动态特性。采取这种思路,我们推导出一个基于分解的最小控制问题解决方案,该方案在大规模网络上显著快于现有方法。我们应用我们的解决方案到实际生物网络和随机生成的网络中,展示了有希望的结果。

英文摘要:

We study the problem of computing a minimal subset of nodes of a given asynchronous Boolean network that need to be controlled to drive its dynamics from an initial steady state (or attractor) to a target steady state. Due to the phenomenon of state-space explosion, a simple global approach that performs computations on the entire network, may not scale well for large networks. We believe that efficient algorithms for such networks must exploit the structure of the networks together with their dynamics. Taking such an approach, we derive a decomposition-based solution to the minimal control problem which can be significantly faster than the existing approaches on large networks. We apply our solution to both real-life biological networks and randomly generated networks, demonstrating promising results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑