Effects of ordered mutations on dynamics in signaling networks

摘要

An example of mutation-sensitivity and order-specificity computation. Given a network ( ,  ) with a set of wild-type update rules , let and be a pair of nodes subject to a double-mutation with a time gap , and 0100 ∈  an initial state. denotes a -mutant update rule set where every gene in  ⊆  is frozen. In this example, the wild-type attractor (Att1) is computed by applying all the time. On the other hand, a ( ,  )-ordered (or ( ,  )-ordered) mutant attractor denoted by Att2 (resp. Att3) is computed by assuming that (resp. ) and apply for 0 ≤   T and  ≤  , respectively. The mutation-sensitivity of ( ,  )-ordered (or ( ,  )-ordered) double-mutation is computed by comparing Att1 and Att2 (resp. Att3). The order-specificity is computed by comparing Att2 and Att3