Skip to main content

Table 2 Partition sequences in the example Boolean network model

From: Identifying dynamical modules from genetic regulatory systems: applications to the segment polarity network

Partition sequences

Core to ...

Exclusive to ...

Independently Oscillating with ...

P 1

{A1, A2, A3}

×

×

P 2

{A1, A2}

×

×

P 3

×

{A1, A2, A3}

P 5

P 4

{A3, A4}

{A3, A4}

×

P 5

×

×

P3 and P6

P 6

×

×

P 5

P 7

{A1}

{A1}

×

P 8

{A2}

{A2}

×

P 9

{A3}

{A3}

×

P 10

{A4}

{A4}

×

  1. 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)
Back to article page

BMC Bioinformatics

ISSN: 1471-2105

Contact us