Resolution:
## Figure 3.
Partition sequences in the example Boolean network model. (A) 10 partition sequences are identified for the example model in Fig. 2. Each
column in each sequence corresponds to a node in the model, whilst each row corresponds
to a partial state. White/Black corresponds to the node having state 1/0 in the partial
state. Eight of these (P_{3 }– P_{10}) are also intersection sequences, whilst the remaining two (P_{1 }and P_{2}, starred) are core sequences that underlie multiple intersection sequences (see Tables
1 and 2). (B, C) Examples of hierarchy amongst the sequences in A. In each case, node
i corresponds to the partial state sequence P_{i}. In each case, if a link joins a partial state sequence P_{x }(top) to another P_{y }(bottom), P_{x }occurs in P_{y }and is conserved across a greater number of attractors. (B) Hierarchy between intersection
sequences. (C) Hierarchy between partition sequences. Orange nodes correspond to sequences
with sub-dynamics that are distinct from those in sequences further up the hierarchy.
These 6 distinct sub-dynamics are the subsystems (see Table 3). White nodes correspond
to sequences that are just a combination of sequences further up the hierarchy.
Irons and Monk |