Systems Biology and Mathematical Modeling Group, Max Planck Institute of Molecular Plant Physiology, Potsdam 14476, Germany.
Chaos. 2019 Nov;29(11):113121. doi: 10.1063/1.5120598.
Understanding the structure of reaction networks along with the underlying kinetics that lead to particular concentration readouts of the participating components is the first step toward optimization and control of (bio-)chemical processes. Yet, solutions to the problem of inferring the structure of reaction networks, i.e., characterizing the stoichiometry of the participating reactions provided concentration profiles of the participating components, remain elusive. Here, we present an approach to infer the stoichiometric subspace of a chemical reaction network from steady-state concentration data profiles obtained from a continuous isothermal reactor. The subsequent problem of finding reactions consistent with the observed subspace is cast as a series of mixed-integer linear programs whose solution generates potential reaction vectors together with a measure of their likelihood. We demonstrate the efficiency and applicability of the proposed approach using data obtained from synthetic reaction networks and from a well-established biological model for the Calvin-Benson cycle. Furthermore, we investigate the effect of missing information, in the form of unmeasured species or insufficient diversity within the data set, on the ability to accurately reconstruct the network reactions. The proposed framework is, in principle, applicable to many other reaction systems, thus providing future extensions to understanding reaction networks guiding chemical reactors and complex biological mixtures.
理解反应网络的结构以及导致特定参与成分浓度读数的基础动力学是优化和控制(生物)化学过程的第一步。然而,推断反应网络结构的问题(即,表征参与反应的化学计量学,提供参与成分的浓度曲线)仍然难以解决。在这里,我们提出了一种从连续等温反应器获得的稳态浓度数据曲线中推断化学反应网络的化学计量子空间的方法。随后,找到与观察到的子空间一致的反应的问题被表述为一系列混合整数线性规划问题,其解决方案生成潜在的反应向量及其可能性的度量。我们使用从合成反应网络和卡尔文-本森循环的成熟生物学模型获得的数据来演示所提出方法的效率和适用性。此外,我们研究了缺失信息(未测量的物质或数据集中的多样性不足)对准确重建网络反应的能力的影响。所提出的框架原则上适用于许多其他反应系统,从而为理解指导化学反应器和复杂生物混合物的反应网络提供了未来的扩展。