Table 1.
Boolean model of TF-network oscillations. Logic Rules (A), attractors (B) and robustness to starting state (C) of a synchronously updating Boolean network constructed from the network in (Figure 2J; also see Figure S2).
| A | ||||
|---|---|---|---|---|
| TF | A | B | C | D |
| SBF | MCM1 ^ ¬ YHP1 | MCM1 ^ ¬ YHP1 | MCM1 ^ ¬ YHP1 | MCM1 ^ ¬ YHP1 |
| HCM1 | (SBF ⋁ MCM1) ^ ¬ ASH1 | (SBF ⋁ MCM1) ^ ¬ ASH1 | (SBF ⋁ MCM1) ^ ¬ ASH1 | (SBF ⋁ MCM1) ^ ¬ ASH1 |
| YHP1 | (MCM1 ⋁ SBF ⋁ HCM1) ^ ¬ ASH1 | (MCM1 ⋁ SBF ⋁ HCM1) ^ ¬ ASH1 | (MCM1 ⋁ SBF ⋁ HCM1) ^ ¬ ASH1 | (MCM1 ⋁ SBF ⋁ HCM1) ^ ¬ ASH1 |
| SFF/FHL1 | HCM1 ⋁ SBF | HCM1 ^ SBF | HCM1 ⋁ SBF | HCM1 ^ SBF |
| ACE2/SWI5 | SFF/FHL1 | SFF/FHL1 | SFF/FHL1 | SFF/FHL1 |
| MCM1 | SFF/FHL1 | SFF/FHL1 | SFF/FHL1 | SFF/FHL1 |
| ASH1 | ACE2/SWI5 ⋁ MCM1 | ACE2/SWI5 ⋁ MCM1 | ACE2/SWI5 ^ MCM1 | ACE2/SWI5 ^ MCM1 |
| B | |||||||
|---|---|---|---|---|---|---|---|
| Attractor #1 | SBF | YHP1 | HCM1 | SFF/FHL1 | ACE2/SWI5 | MCM1 | ASH1 |
| State 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 |
| State 2 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| State 3 | 0 | 0 | 0 | 0 | 1 | 1 | 0 |
| Attractor #2 | SBF | YHP1 | HCM1 | SFF/FHL1 | ACE2/SWI5 | MCM1 | ASH1 |
|---|---|---|---|---|---|---|---|
| State 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| Attractor #3 | SBF | YHP1 | HCM1 | SFF/FHL1 | ACE2/SWI5 | MCM1 | ASH1 |
|---|---|---|---|---|---|---|---|
| State 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |
| C | |||
|---|---|---|---|
| Activation Logic | Attractor #1 | Attractor #2 | Attractor #3 |
| A | 87.50% | 7.81% | 4.69% |
| B | 28.12% | 71.88% | 0.00% |
| C | 89.84% | 7.81% | 2.34% |
| D | 35.94% | 64.06% | 0.00% |