Fig. 1

An example of mutation-sensitivity and order-specificity computation. Given a network G(V, A) with a set of wild-type update rules F, let v₃ and v₄ be a pair of nodes subject to a double-mutation with a time gap T, and 0100 ∈ S an initial state. F^W denotes a W-mutant update rule set where every gene in W ⊆ V is frozen. In this example, the wild-type attractor (Att1) is computed by applying F all the time. On the other hand, a (v₃, v₄)-ordered (or (v₄, v₃)-ordered) mutant attractor denoted by Att2 (resp. Att3) is computed by assuming that \( {F}^{\left\{{v}_3\right\}} \) (resp. \( {F}^{\left\{{v}_4\right\}} \)) and \( {F}^{\left\{{v}_3,{v}_4\right\}} \) apply for 0 ≤ t < T and T ≤ t, respectively. The mutation-sensitivity of (v₃, v₄)-ordered (or (v₄, v₃)-ordered) double-mutation is computed by comparing Att1 and Att2 (resp. Att3). The order-specificity is computed by comparing Att2 and Att3