Skip to main content

Table 2 The logical update function modifications considered in this article

From: Stabilization of perturbed Boolean network attractors through compensatory interactions

ON to OFF corrections OFF to ON corrections
f x  = … AND a new f x  = … OR p new
f x  = … AND NOT p new f x  = … OR NOT a new
f x  = … AND (a orig OR a new ) f x  = … OR (p orig AND p new )
f x  = … AND (NOT p new OR a orig ) f x  = … OR (NOT a new AND p orig )
f x  = … AND (NOT p new OR NOT p orig ) f x  = … OR (NOT a new AND NOT a orig )
f x  = … AND (a new OR NOT p orig ) f x  = … OR (p new AND NOT a orig )
  1. The rule modifications considered for a node x. Initial dots are placeholders for the original rule for the node, which could be, e.g., f x  = y. p indicates an arbitrary node that is present (ON) in the current state of the network, a indicates an arbitrary node that is absent (OFF) in the current state of the network. Subscripts indicate whether the node in question is a new regulator for this node (i.e., did not exist in the original update rule) or existed as an original regulator. The top two rules in either column are the simplest, but place the greatest regulatory weight on the new interaction.