On the robustness of update schedules in Boolean networks
On the robustness of update schedules in Boolean networks
复制标题
DOI：
10.1016/j.biosystems.2009.03.006
复制
发表时间：
2009-07-01
期刊：
影响因子：
1.6
通讯作者：
Salinas, L.
中科院分区：
文献类型：
--
作者：
Aracena, J.;Goles, E.;Salinas, L.
确定性布尔网络已被用作基因调控和其他生物网络的模型。这些模型中的一个关键元素是更新计划，它指示状态更新的顺序。我们研究了布尔网络的动态行为相对于不同的更新时间表（同步，块顺序，顺序）的鲁棒性，这可以提供建模者更好地了解在这方面的模型的变化的后果。对于一个给定的布尔网络，我们定义等价类的更新时间表具有相同的动态行为，引入一个标记的图形，这有助于了解的动态更新的依赖性，并确定其时间可能是至关重要的存在下的系统的一个特定的吸引子的相互作用。其他几个结果的鲁棒性的更新计划和动态周期更新计划。最后，我们证明了我们的等价类推广了序列动力系统中的等价类。(C)2009爱思唯尔爱尔兰有限公司保留所有权利。
Deterministic Boolean networks have been used as models of gene regulation and other biological networks. One key element in these models is the update schedule, which indicates the order in which states are to be updated. We study the robustness of the dynamical behavior of a Boolean network with respect to different update schedules (synchronous, block-sequential, sequential), which can provide modelers with a better understanding of the consequences of changes in this aspect of the model. For a given Boolean network, we define equivalence classes of update schedules with the same dynamical behavior, introducing a labeled graph which helps to understand the dependence of the dynamics with respect to the update, and to identify interactions whose timing may be crucial for the presence of a particular attractor of the system. Several other results on the robustness of update schedules and of dynamical cycles with respect to update schedules are presented. Finally, we prove that our equivalence classes generalize those found in sequential dynamical systems. (C) 2009 Elsevier Ireland Ltd. All rights reserved.