TL;DR
This paper introduces an integer programming method to efficiently compute stable configurations of thermodynamic binding networks, enabling faster analysis and verification of molecular systems compared to previous SAT-based approaches.
Contribution
The authors develop an integer programming formulation for TBN stability analysis, providing open-source software and demonstrating significant computational improvements over prior methods.
Findings
Faster computation of TBN stable configurations than SAT solvers.
Ability to handle molecules with unbounded counts.
Verification of entire kinetic pathways in TBNs.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
