布尔网络的最容许语义
Most Permissive Semantics of Boolean Networks
摘要:
如(http://dx.doi.org/10.1101/2020.03.22.998377)中所示,布尔网络(BN)的通常更新模式(包括同步和(广义)异步)无法捕获由多值细化引入的行为。因此,更新模式不允许对生物系统的动态进行正确的抽象推理,因为它们可能导致拒绝有效的BN模型。本技术报告列出了在http://dx.doi.org/10.1101/2020.03.22.998377中介绍的BN的最许可语义的主要定义和属性。这种语义符合任何多值细化的正确抽象,具有任何更新模式。它包含了所有常见的更新模式,同时使新的行为可以通过更具体的模型实现。此外,它似乎是经典的动力学分析的可达性和吸引子有一个简单的计算复杂性:-可达性可以评估在一个多项式数量的迭代。迭代的计算在非常一般的情况下是NP的,并且当局部函数是单调的时是线性的,或者具有BN的函数的一些常见表示(二元决策图、Petri网、自动机网络等)。因此,可达性在具有局部单调BN的P中,否则在P中为$^{\text{NP}}$(而不是具有更新模式的PSPACE完成);- 在具有局部单调BN的coNP中决定配置属于吸引子的位置,否则在coNP $^{\text{coNP}}$中决定此外,我们证明了语义完全捕获了BN的任何多级或ODE细化可实现的任何行为;并且语义相对于该模型细化标准是最小的:对于任何最许可的轨迹,存在可以再现它的BN的多级细化。简而言之,BN的最许可的语义使得能够对BN的动态进行正确的抽象推理,具有比先前引入的更新模式更大的易处理性。
英文摘要:
As shown in (http://dx.doi.org/10.1101/2020.03.22.998377), the usual update modes of Boolean networks (BNs), including synchronous and (generalized) asynchronous, fail to capture behaviors introduced by multivalued refinements. Thus, update modes do not allow a correct abstract reasoning on dynamics of biological systems, as they may lead to reject valid BN models.This technical report lists the main definitions and properties of the most permissive semantics of BNs introduced in http://dx.doi.org/10.1101/2020.03.22.998377. This semantics meets with a correct abstraction of any multivalued refinements, with any update mode. It subsumes all the usual updating modes, while enabling new behaviors achievable by more concrete models. Moreover, it appears that classical dynamical analyzes of reachability and attractors have a simpler computational complexity:- reachability can be assessed in a polynomial number of iterations. The computation of iterations is in NP in the very general case, and is linear when local functions are monotonic, or with some usual representations of functions of BNs (binary decision diagrams, Petri nets, automata networks, etc.). Thus, reachability is in P with locally-monotonic BNs, and P$^{\text{NP}}$ otherwise (instead of being PSPACE-complete with update modes);- deciding wherever a configuration belongs to an attractor is in coNP with locally-monotonic BNs, and coNP$^{\text{coNP}}$ otherwise (instead of PSPACE-complete with update modes).Furthermore, we demonstrate that the semantics completely captures any behavior achievable with any multilevel or ODE refinement of the BN; and the semantics is minimal with respect to this model refinement criteria: to any most permissive trajectory, there exists a multilevel refinement of the BN which can reproduce it.In brief, the most permissive semantics of BNs enables a correct abstract reasoning on dynamics of BNs, with a greater tractability than previously introduced update modes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。