量化离散多状态网络中边干预的总效应
Quantifying the Total Effect of Edge Interventions in Discrete Multistate Networks
AI总结:
本文针对离散多状态网络,利用嵌套渠化函数的多项式正规形式,提出计算边删除后状态空间最大转移变化数的公式,并在随机网络上验证了上界的锐利程度。
摘要:
开发高效的计算方法来评估外部干预对网络模型动力学的影响是系统生物学中的一个重要问题。本文聚焦于量化因施加干预以产生期望效果而导致的全局变化,我们将这种变化定义为干预的总效应。我们考虑的数学模型类型是离散动力系统,其中包括广泛使用的布尔网络及其推广形式。潜在干预可以用一组可被操控以对系统产生期望效果的节点和边来表示。我们使用一类称为嵌套渠化函数的调控规则,这类函数经常出现在已发表的模型中,并受到进化生物学中渠化概念的启发。在本文中,我们基于调控函数的渠化性质提供了一个多项式正规形式。利用该多项式正规形式,我们给出一组公式,用于计算在连线图中删除一条边后状态空间中将会改变的最大转移数。这些公式依赖于目标函数的渠化结构,因为改变转移的数量取决于包含待删除输入的渠化层。我们还在随机网络上进行了计算,将精确的变化数量与我们的公式所提供的上界进行比较。最后,我们给出了这些上界在随机网络中锐利程度的统计数据。
英文摘要:
Developing efficient computational methods to assess the impact of external interventions on the dynamics of a network model is an important problem in systems biology. This paper focuses on quantifying the global changes that result from the application of an intervention to produce a desired effect, which we define as the total effect of the intervention. The type of mathematical models that we will consider are discrete dynamical systems which include the widely used Boolean networks and their generalizations. The potential interventions can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. We use a class of regulatory rules called nested canalizing functions that frequently appear in published models and were inspired by the concept of canalization in evolutionary biology. In this paper, we provide a polynomial normal form based on the canalizing properties of regulatory functions. Using this polynomial normal form, we give a set of formulas for counting the maximum number of transitions that will change in the state space upon an edge deletion in the wiring diagram. These formulas rely on the canalizing structure of the target function since the number of changed transitions depends on the canalizing layer that includes the input to be deleted. We also present computations on random networks to compare the exact number of changes with the upper bounds provided by our formulas. Finally, we provide statistics on the sharpness of these upper bounds in random networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。