Relationship between the reprogramming determinants of Boolean networks and their interaction graph
From MaRDI portal
Abstract: 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.
Recommendations
- Temporal reprogramming of Boolean networks
- Sequential reprogramming of Boolean networks made practical
- Uncovering operational interactions in genetic networks using asynchronous Boolean dynamics
- Sequential temporary and permanent control of Boolean networks
- Function perturbations in Boolean networks with its application in a \textit{D. melanogaster} gene network
Cited in
(3)
This page was built for publication: Relationship between the reprogramming determinants of Boolean networks and their interaction graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204377)
