Skip to main content

Advertisement

Table 3 Results of our attractors enumeration implementation

From: ASP-based method for the enumeration of attractors in non-deterministic synchronous and asynchronous multi-valued networks

Models n Attractors enumeration
Asynchronous scheme Synchronous scheme
\(\Delta t\) (ms) \(\exists ?\mathbf {A}\) \(\Delta t\) (ms) \(\exists ?\mathbf {A}\)
Example 2 7 Yes 7 Yes
4 16 Yes 14 No
8 98 No 75 No
Lambda phage 2 14 Yes 14 Yes
10 1352 No 842 No
20 15,656 No 14,452 No
Trp-reg 2 8 No 7 No
4 14 Yes 15 No
20 3908 No 3808 No
Fission- yeast 2 16 No 16 Yes
10 1011 No 807 No
20 17,302 No 16,313 No
Mamm. 2 12 No 12 No
7 177 No 147 Yes
10 720 No 605 No
20 58,133 No 9253 No
Tcrsig 2 26 No 25 No
6 353 No 288 Yes
10 2420 No 1841 No
20 85,599 No 27,078 No
FGF 2 38 No 36 No
10 2080 No 1953 No
20 30,861 No 29,838 No
T-helper 2 180 No 125 Yes
3 391 No 301 Yes
4 782 No 1064 No
6 4271 No 2372 Yes
7 7909 No 3522 Yes
9 26,443 No 7042 Yes
10 44,924 No 12,208 Yes
12 107,358 No 28,520 Yes
20 4,230,836 \(\sim \) 1h17 No 187,105 \(\sim \) 3min No
  1. The successive lines sum up the information regarding models detailed in Table 1. For each model and for both update schemes (asynchronous and synchronous), the table shows, depending on the given path length n, the computation time for the first attractor found by the solver (\(\Delta t\)), and the conclusion regarding the existence or not of at least one attractor (\(\exists ?\mathbf {A}\))