Department of Mathematics San José State University San José, CA, 95192 USA.
Math Biosci. 2017 Dec;294:130-142. doi: 10.1016/j.mbs.2017.10.003. Epub 2017 Oct 10.
Recent work of Johnston et al. has produced sufficient conditions on the structure of a chemical reaction network which guarantee that the corresponding discrete state space system exhibits an extinction event. The conditions consist of a series of systems of equalities and inequalities on the edges of a modified reaction network called a domination-expanded reaction network. In this paper, we present a computational implementation of these conditions written in Python and apply the program on examples drawn from the biochemical literature. We also run the program on 458 models from the European Bioinformatics Institute's BioModels Database and report our results.
约翰斯顿等人最近的工作提出了化学反应网络结构的充分条件，这些条件保证了相应的离散状态空间系统会出现灭绝事件。这些条件由一系列关于一个称为控制扩展反应网络的修改后的反应网络的边的等式和不等式系统组成。在本文中，我们使用 Python 编写了这些条件的计算实现，并将程序应用于从生化文献中提取的示例。我们还在欧洲生物信息学研究所的 BioModels 数据库中的 458 个模型上运行了程序，并报告了结果。
