Inferring chemical reaction networks (CRN) from concentration time series is a challenge encouragedby the growing availability of quantitative temporal data at the cellular level. This motivates thedesign of algorithms to infer the preponderant reactions between the molecular species observed ina given biochemical process, and build CRN structure and kinetics models. Existing ODE-basedinference methods such as SINDy resort to least square regression combined with sparsity-enforcingpenalization, such as Lasso. However, we observe that these methods fail to learn sparse modelswhen the input time series are only available in wild type conditions, i.e. without the possibility toplay with combinations of zeroes in the initial conditions. We present a CRN inference algorithmwhich enforces sparsity by inferring reactions in a sequential fashion within a search tree of boundeddepth, ranking the inferred reaction candidates according to the variance of their kinetics on theirsupporting transitions, and re-optimizing the kinetic parameters of the CRN candidates on the wholetrace in a final pass. We show that Reactmine succeeds both on simulation data by retrievinghidden CRNs where SINDy fails, and on two real datasets, one of fluorescence videomicroscopyof cell cycle and circadian clock markers, the other one of biomedical measurements of systemiccircadian biomarkers possibly acting on clock gene expression in peripheral organs, by inferringpreponderant regulations in agreement with previous model-based analyses. The code is available athttps://gitlab.inria.fr/julmarti/crninf/ together with introductory notebooks.
翻译:从浓度时间序列中推断出化学反应网络(CRN)是一个挑战,因为蜂窝一级数量时间数据的供应量越来越多,因此,这些方法无法了解稀有模型,因为输入时间序列只能在野生类型中提供,也就是说,无法在初始条件下使用零的组合。我们展示了CRN推推论算法,该算法通过在封闭深度的搜索树上以顺序推论反应,根据支持性过渡(如Lasso)的动因变化,将推断反应对象排序。然而,我们发现,这些方法无法了解在输入时间序列仅在野生类型中提供时,即无法在初始条件下使用零的组合进行。我们展示了CRNRN推论法,该算法通过测深的搜索树里,根据他们支持性转变的动因变异变,重新定义CRR候选人在全程中的动变异变数参数。我们展示了Reactnder Rickralalalal dealalalal dealations the labild droal deal deals revial exal lactions lactions exaltistrations, ex suplicial ex suplibliblibliblibrial ex exal extial ex lating exal lating lating ex ex ex ex ex ex ex ex ex ex ex ex la ex ex ex latingaltialtibilts,在最后通过一个前期,我们算算算算算算算算算算算算算算算法。