Fig. 5
From: An efficient algorithm for identifying primary phenotype attractors of a large-scale Boolean network
Simplified MAPK network for proliferation attractors. When finding attractors for proliferation in the MAPK model, the original update rules for MAPK network is divided into two parts. The first is fixed state values of ESENs and PSPNs. The second is the simplified update rules for nodes (N) except both ESENs and PSPNs. The network in this figure is the hierarchically partitioned network with the simplified update rules for the nodes N. There exist only two SCCs V 1,1 and V 4,1 that have more than one node. The nodes in V 1,1 and V 4,1 are colored with green and red, respectively. The yellow boxes denote the nodes used in the constraint equations (MAX|AKT = 1, ! AKT & p53 = 0)