Fig. 3: Allowed changes of component states in Most Permissive Boolean Networks. | Nature Communications

Fig. 3: Allowed changes of component states in Most Permissive Boolean Networks.

From: Reconciling qualitative, abstract, and scalable modeling of biological networks

Fig. 3

Conditions are expressed for a component i {1, …, n} from a most-permissive configuration x {0, , , 1}n. The increasing state is represented by a top-left white and bottom-right blue square, the decreasing state by a bottom-left blue and top-right white square. The function γ gives the admissible Boolean interpretations of x: \(\gamma ({\bf{x}})=\{{\bf{z}}\in {{\mathbb{B}}}^{n}| \forall i\in \{1,\ldots ,n\},{{\bf{x}}}_{i}\in {\mathbb{B}}\Rightarrow {{\bf{z}}}_{i}={{\bf{x}}}_{i}\}\), i.e., all the components in Boolean states are fixed, and the others are free.

Back to article page