On the robustness of update schedules in Boolean networks
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. © 2009 Elsevier Ireland Ltd. All rights reserved.
|Título según WOS:||On the robustness of update schedules in Boolean networks|
|Título según SCOPUS:||On the robustness of update schedules in Boolean networks|
|Título de la Revista:||BIOSYSTEMS|
|Editorial:||ELSEVIER SCI LTD|
|Fecha de publicación:||2009|
|Página de inicio:||1|