Deconstruction and Dynamical Robustness of Regulatory Networks: Application to the Yeast Cell Cycle Networks
Goles
E
author
Montalva
M
author
Ruz
G
A
author
2013
English
Analyzing all the deterministic dynamics of a Boolean regulatory network is a difficult problem since it grows exponentially with the number of nodes. In this paper, we present mathematical and computational tools for analyzing the complete deterministic dynamics of Boolean regulatory networks. For this, the notion of alliance is introduced, which is a subconfiguration of states that remains fixed regardless of the values of the other nodes. Also, equivalent classes are considered, which are sets of updating schedules which have the same dynamics. Using these techniques, we analyze two yeast cell cycle models. Results show the effectiveness of the proposed tools for analyzing update robustness as well as the discovery of new information related to the attractors of the yeast cell cycle models considering all the possible deterministic dynamics, which previously have only been studied considering the parallel updating scheme.
Boolean networks
Attractors
Update robustness
Alliances
Dynamics
WOS:000321220400005
exported from refbase (show.php?record=288), last updated on Thu, 01 Aug 2013 15:55:00 -0400
text
files/241_Goles_etal2013.pdf
10.1007/s11538-012-9794-1
Goles_etal2013
Bulletin Of Mathematical Biology
Bull. Math. Biol.
2013
Springer
continuing
periodical
academic journal
75
6
939
966
0092-8240