信令网逻辑可编程模型
Logic Integer Programming Models for Signaling Networks
摘要:
我们提出了一种静态和动态的方法来模拟生物信号网络,并展示了如何使用它们来回答相关的生物学问题。为此,我们使用两种不同的数学工具命题逻辑和可编程逻辑。迄今为止,离散数学处理定性和定量数据的能力尚未在分子生物学中得到利用,分子生物学主要由实验研究驱动,依赖于一阶或统计模型。对产生的逻辑语句和整数程序进行分析,并用标准软件进行求解。对于一类受限的问题,逻辑模型简化为多项式时间可解的可满足性算法。此外,更动态的模型使得能够枚举多对数时间中可能的时间分辨率。包括计算实验。
英文摘要:
We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in Molecular Biology, which is mostly driven by experimental research, relying on first-order or statistical models. The arising logic statements and integer programs are analyzed and can be solved with standard software. For a restricted class of problems the logic models reduce to a polynomial-time solvable satisfiability algorithm. Additionally, a more dynamic model enables enumeration of possible time resolutions in poly-logarithmic time. Computational experiments are included.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。