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 (P3 P10) are also intersection sequences, whilst the remaining two (P1 and P2, 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 Pi. In each case, if a link joins a partial state sequence Px (top) to another Py (bottom), Px occurs in Py 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 BMC Bioinformatics 2007 8:413   doi:10.1186/1471-2105-8-413
Download authors' original image