布尔网络重编程行列式与其交互图的关系
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
