Table 2

Partition sequences in the example Boolean network model

Partition sequences

Core to ...

Exclusive to ...

Independently Oscillating with ...


P1

{A1, A2, A3}

×

×

P2

{A1, A2}

×

×

P3

×

{A1, A2, A3}

P5

P4

{A3, A4}

{A3, A4}

×

P5

×

×

P3 and P6

P6

×

×

P5

P7

{A1}

{A1}

×

P8

{A2}

{A2}

×

P9

{A3}

{A3}

×

P10

{A4}

{A4}

×


The following table gives all the partition sequences for the simple example model (in Fig. 2 and Fig. 3). The partition sequences (P1 P10) can be seen in Fig. 3, whilst the attractors (A1 A4) can be seen in Fig. 2. The table also shows which properties they satisfy in Definition 5 (× implies that property is not satisfied)

Irons and Monk BMC Bioinformatics 2007 8:413   doi:10.1186/1471-2105-8-413

Open Data