热力学束缚网络的计算性质:整数规划方法
Computing properties of thermodynamic binding networks: An integer programming approach
摘要:
热力学结合网络(TBN)模型是研究工程分子系统的一种工具。TBN模型允许人们通过简化的抽象来推理它们的行为,忽略了分子组成的细节,专注于任何化学底物共同的系统能量的两个关键决定因素:形成多少分子键,以及系统中存在多少单独的复合物。我们将计算稳定(也称为,最小能量)构型:使键和络合物的数目最大化的那些构型。我们提供开源软件解决这个整数规划。我们给出的经验证据表明,这种方法可以显着更快的计算TBN稳定的配置比以前的方法的基础上SAT求解器。此外,与基于SAT的方法不同,我们的整数规划公式可以推理其中一些分子具有无限计数的TBN。这些改进反过来又使我们能够有效地自动验证实际TBN的所需特性。最后,我们表明,TBN有一个自然的表示与一个独特的希尔伯特基描述的“基本组件”,其中局部最小的能量配置组成。这种表征不仅有助于验证稳定构型的正确性,而且有助于验证TBN中整个“动力学途径”的正确性。
英文摘要:
The thermodynamic binding networks (TBN) model is a tool for studying engineered molecular systems. The TBN model allows one to reason about their behavior through a simplified abstraction that ignores details about molecular composition, focusing on two key determinants of a system's energetics common to any chemical substrate: how many molecular bonds are formed, and how many separate complexes exist in the system. We formulate as an integer program the NP-hard problem of computing stable (a.k.a., minimum energy) configurations of a TBN: those configurations that maximize the number of bonds and complexes. We provide open-source software solving this integer program. We give empirical evidence that this approach enables dramatically faster computation of TBN stable configurations than previous approaches based on SAT solvers. Furthermore, unlike SAT-based approaches, our integer programming formulation can reason about TBNs in which some molecules have unbounded counts. These improvements in turn allow us to efficiently automate verification of desired properties of practical TBNs. Finally, we show that the TBN has a natural representation with a unique Hilbert basis describing the "fundamental components" out of which locally minimal energy configurations are composed. This characterization helps verify correctness of not only stable configurations, but entire "kinetic pathways" in a TBN.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。