Reactmine: a search algorithm for inferring chemical reaction networks from time series data

• URL: http://arxiv.org/abs/2209.03185v1
• Date: Wed, 7 Sep 2022 14:30:33 GMT
• Title: Reactmine: a search algorithm for inferring chemical reaction networks from time series data
• Authors: Julien Martinelli, Jeremy Grignard (IRS), Sylvain Soliman, Annabelle Ballesta, Fran\c{c}ois Fages
• Abstract summary: Inferring chemical reaction networks (CRN) from time series data is a challenge encouraged by the growing availability of quantitative temporal data at the cellular level. We present Reactmine, a CRN learning algorithm which enforces sparsity by inferring reactions in a sequential fashion within a search tree of bounded depth. We show that Reactmine succeeds both on simulation data by retrieving hidden CRNs where SINDy fails, and on the two real datasets by inferring reactions in agreement with previous studies.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Inferring chemical reaction networks (CRN) from time series data is a challenge encouraged by the growing availability of quantitative temporal data at the cellular level. This motivates the design of algorithms to infer the preponderant reactions between the molecular species observed in a given biochemical process, and help to build CRN model structure and kinetics. Existing ODE-based inference methods such as SINDy resort to least square regression combined with sparsity-enforcing penalization, such as Lasso. However, when the input time series are only available in wild type conditions in which all reactions are present, we observe that current methods fail to learn sparse models. Results: We present Reactmine, a CRN learning algorithm which enforces sparsity by inferring reactions in a sequential fashion within a search tree of bounded depth, ranking the inferred reaction candidates according to the variance of their kinetics, and re-optimizing the CRN kinetic parameters on the whole trace in a final pass to rank the inferred CRN candidates. We first evaluate its performance on simulation data from a benchmark of hidden CRNs, together with algorithmic hyperparameter sensitivity analyses, and then on two sets of real experimental data: one from protein fluorescence videomicroscopy of cell cycle and circadian clock markers, and one from biomedical measurements of systemic circadian biomarkers possibly acting on clock gene expression in peripheral organs. We show that Reactmine succeeds both on simulation data by retrieving hidden CRNs where SINDy fails, and on the two real datasets by inferring reactions in agreement with previous studies.

Related papers

• REST: Efficient and Accelerated EEG Seizure Analysis through Residual State Updates [54.96885726053036]
  This paper introduces a novel graph-based residual state update mechanism (REST) for real-time EEG signal analysis. By leveraging a combination of graph neural networks and recurrent structures, REST efficiently captures both non-Euclidean geometry and temporal dependencies within EEG data. Our model demonstrates high accuracy in both seizure detection and classification tasks.
  arXiv  Detail & Related papers  (2024-06-03T16:30:19Z)
• Regressor-free Molecule Generation to Support Drug Response Prediction [83.25894107956735]
  Conditional generation based on the target IC50 score can obtain a more effective sampling space. Regressor-free guidance combines a diffusion model's score estimation with a regression controller model's gradient based on number labels.
  arXiv  Detail & Related papers  (2024-05-23T13:22:17Z)
• Information geometric bound on general chemical reaction networks [0.0]
  We employ an information geometric approach, using the natural gradient, to develop a nonlinear system that yields an upper bound for CRN dynamics. We validate our approach through numerical simulations, demonstrating faster convergence in a specific class of CRNs. While our study focuses on CRNs, the ubiquity of hypergraphs in fields from natural sciences to engineering suggests that our method may find broader applications.
  arXiv  Detail & Related papers  (2023-09-19T05:37:13Z)
• Continuous time recurrent neural networks: overview and application to forecasting blood glucose in the intensive care unit [56.801856519460465]
  Continuous time autoregressive recurrent neural networks (CTRNNs) are a deep learning model that account for irregular observations. We demonstrate the application of these models to probabilistic forecasting of blood glucose in a critical care setting.
  arXiv  Detail & Related papers  (2023-04-14T09:39:06Z)
• Bayesian Inference for Jump-Diffusion Approximations of Biochemical Reaction Networks [26.744964200606784]
  We develop a tractable Bayesian inference algorithm based on Markov chain Monte Carlo. The algorithm is numerically evaluated for a partially observed multi-scale birth-death process example.
  arXiv  Detail & Related papers  (2023-04-13T14:57:22Z)
• DriPP: Driven Point Processes to Model Stimuli Induced Patterns in M/EEG Signals [62.997667081978825]
  We develop a novel statistical point process model-called driven temporal point processes (DriPP) We derive a fast and principled expectation-maximization (EM) algorithm to estimate the parameters of this model. Results on standard MEG datasets demonstrate that our methodology reveals event-related neural responses.
  arXiv  Detail & Related papers  (2021-12-08T13:07:21Z)
• Convolutional generative adversarial imputation networks for spatio-temporal missing data in storm surge simulations [86.5302150777089]
  Generative Adversarial Imputation Nets (GANs) and GAN-based techniques have attracted attention as unsupervised machine learning methods. We name our proposed method as Con Conval Generative Adversarial Imputation Nets (Conv-GAIN)
  arXiv  Detail & Related papers  (2021-11-03T03:50:48Z)
• Programming and Training Rate-Independent Chemical Reaction Networks [9.001036626196258]
  Natural biochemical systems are typically modeled by chemical reaction networks (CRNs) CRNs can be used as a specification language for synthetic chemical computation. We show a technique to program NC-CRNs using well-founded deep learning methods.
  arXiv  Detail & Related papers  (2021-09-20T15:31:03Z)
• Retro*: Learning Retrosynthetic Planning with Neural Guided A* Search [83.22850633478302]
  Retrosynthetic planning identifies a series of reactions that can lead to the synthesis of a target product. Existing methods either require expensive return estimation by rollout with high variance, or optimize for search speed rather than the quality. We propose Retro*, a neural-based A*-like algorithm that finds high-quality synthetic routes efficiently.
  arXiv  Detail & Related papers  (2020-06-29T05:53:33Z)
• RED: Deep Recurrent Neural Networks for Sleep EEG Event Detection [0.0]
  We propose a deep learning approach for sleep EEG event detection called Recurrent Event Detector (RED) RED uses one of two input representations: a) the time-domain EEG signal, or b) a complex spectrogram of the signal obtained with the Continuous Wavelet Transform (CWT) When evaluated on the MASS dataset, our detectors outperform the state of the art in both sleep spindle and K-complex detection with a mean F1-score of at least 80.9% and 82.6%, respectively.
  arXiv  Detail & Related papers  (2020-05-15T21:48:26Z)
• Automated Deep Abstractions for Stochastic Chemical Reaction Networks [0.0]
  Low-level chemical reaction network (CRN) models give raise to a highly-dimensional continuous-time Markov chain (CTMC) A recently proposed abstraction method uses deep learning to replace this CTMC with a discrete-time continuous-space process. In this paper, we propose to further automatise deep abstractions for CRNs, through learning the optimal neural network architecture.
  arXiv  Detail & Related papers  (2020-01-30T13:49:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.