Sequential operator for filtering cycles in Boolean networks
Goles
E
author
Salinas
L
author
2010
Given a Boolean network without negative circuits, we propose a polynomial algorithm to build another network such that, when updated in parallel, it has the same fixed points than the original one, but it does not have any dynamical cycle. To achieve that, we apply a network transformation related to the sequential update. As a corollary, we can find a fixed point in polynomial time for this kind of networks. (C) 2010 Elsevier Inc. All rights reserved.
WOS:000281294000004
exported from refbase (show.php?record=94), last updated on Mon, 22 Dec 2014 15:01:28 -0300
text
files/94_Goles+Salinas2010.pdf
10.1016/j.aam.2010.03.002
Goles+Salinas2010
Advances In Applied Mathematics
Adv. Appl. Math.
2010
continuing
periodical
academic journal
45
3
346
358
0196-8858