On the number of different dynamics in Boolean networks with deterministic update schedules
Aracena
J
author
Demongeot
J
author
Fanchon
E
author
Montalva
M
author
2013
English
Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction digraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. (C) 2013 Elsevier Inc. All rights reserved.
Boolean network
Update schedule
Update digraph
Dynamics
WOS:000317164700008
exported from refbase (show.php?record=275), last updated on Thu, 09 May 2013 08:29:24 -0400
text
files/267_Aracena_etal2013.pdf
10.1016/j.mbs.2013.01.007
Aracena_etal2013
Mathematical Biosciences
Math. Biosci.
2013
Elsevier Science Inc
continuing
periodical
academic journal
242
2
188
194
0025-5564