Relationship Between the Reprogramming Determinants of Boolean Networks and Their Interaction Graph
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.
- 1.Abou-Jaoudé, W., Monteiro, P.T., Naldi, A., Grandclaudon, M., Soumelis, V., Chaouiya, C., Thieffry, D.: Model checking to assess T-helper cell plasticity. Front. Bioeng. Biotechnol. 2 (2015)Google Scholar
- 8.Gao, Z., Chen, X., Başar, T.: On the stability of conjunctive boolean networks, March 2016Google Scholar
- 12.Rackham, O.J.L., Firas, J., Fang, H., Oates, M.E., Holmes, M.L., Knaupp, A.S., Suzuki, H., Nefzger, C.M., Daub, C.O., Shin, J.W., Petretto, E., Forrest, A.R.R., Hayashizaki, Y., Polo, J.M., Gough, J.: A predictive computational framework for direct reprogramming between human cell types. Nat. Genet. 48(3), 331–335 (2016)CrossRefGoogle Scholar