Relationship Between the Reprogramming Determinants of Boolean Networks and Their Interaction Graph
- Cite this paper as:
- Mandon H., Haar S., Paulevé L. (2016) Relationship Between the Reprogramming Determinants of Boolean Networks and Their Interaction Graph. In: Cinquemani E., Donzé A. (eds) Hybrid Systems Biology. HSB 2016. Lecture Notes in Computer Science, vol 9957. Springer, Cham
In this paper, we address the formal characterization of targets triggering cellular trans-differentiation in the scope of Boolean networks with asynchronous dynamics. Given two fixed points of a Boolean network, we are interested in all the combinations of mutations which allow to switch from one fixed point to the other, either possibly, or inevitably. In the case of existential reachability, we prove that the set of nodes to (permanently) flip are only and necessarily in certain connected components of the interaction graph. In the case of inevitable reachability, we provide an algorithm to identify a subset of possible solutions.