Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

37
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
37

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Random-with-constraints: Constructing minimal models for high-dimensional biology.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same author

Emergent frequency-dependent selection predicts mutation outcomes in complex ecological communities.

bioRxiv : the preprint server for biology·2026
Same author

Ecology of metagenomes: incorporating genotype-to-phenotype maps into ecological models.

bioRxiv : the preprint server for biology·2026
Same author

From genes to collective modes: biological constraints shape metabolic evolution.

bioRxiv : the preprint server for biology·2026
Same author

Inferring genotype-phenotype maps using attention models.

PNAS nexus·2026
Same author

Parameter-free representations outperform single-cell foundation models on downstream benchmarks.

bioRxiv : the preprint server for biology·2026

Related Experiment Video

Updated: May 21, 2025

Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks
07:50

Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks

Published on: November 25, 2015

14.3K

A differentiable Gillespie algorithm for simulating chemical kinetics, parameter estimation, and designing synthetic

Krishna Rijal1, Pankaj Mehta1

  • 1Department of Physics, Boston University, Boston, United States.

Elife
|March 17, 2025
PubMed
Summary

We developed a differentiable Gillespie algorithm (DGA) using deep learning to analyze complex chemical reactions. This method accurately learns kinetic parameters and designs biochemical networks, advancing systems and synthetic biology.

Keywords:
cell biologydifferentiable Gillespie algorithmgene regulatory networksnoneparameter estimationphysics of living systemsstochastic simulationsynthetic biology

More Related Videos

A Multilayer Microfluidic Platform for the Conduction of Prolonged Cell-Free Gene Expression
11:23

A Multilayer Microfluidic Platform for the Conduction of Prolonged Cell-Free Gene Expression

Published on: October 6, 2019

10.1K
Automated Robotic Liquid Handling Assembly of Modular DNA Devices
11:22

Automated Robotic Liquid Handling Assembly of Modular DNA Devices

Published on: December 1, 2017

12.3K

Related Experiment Videos

Last Updated: May 21, 2025

Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks
07:50

Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks

Published on: November 25, 2015

14.3K
A Multilayer Microfluidic Platform for the Conduction of Prolonged Cell-Free Gene Expression
11:23

A Multilayer Microfluidic Platform for the Conduction of Prolonged Cell-Free Gene Expression

Published on: October 6, 2019

10.1K
Automated Robotic Liquid Handling Assembly of Modular DNA Devices
11:22

Automated Robotic Liquid Handling Assembly of Modular DNA Devices

Published on: December 1, 2017

12.3K

Area of Science:

  • Computational Biology
  • Systems Biology
  • Synthetic Biology

Background:

  • The Gillespie algorithm is a standard for simulating chemical reaction networks.
  • Analyzing these networks often requires parameter estimation and network design.
  • Deep learning offers new approaches for complex modeling tasks.

Purpose of the Study:

  • To develop a fully differentiable variant of the Gillespie algorithm using deep learning.
  • To enable gradient-based optimization for kinetic parameter learning and network design.
  • To apply the differentiable Gillespie algorithm to stochastic models of gene promoters.

Main Methods:

  • Leveraging deep learning breakthroughs to create a differentiable Gillespie algorithm (DGA).
  • Approximating discontinuous operations in the Gillespie algorithm with smooth functions.
  • Utilizing backpropagation for gradient calculation.

Main Results:

  • The DGA accurately learns kinetic parameters from experimental mRNA expression data.
  • Successfully applied to two distinct *Escherichia coli* promoter systems.
  • Enabled the design of nonequilibrium promoter architectures with specific input-output relationships.

Conclusions:

  • The differentiable Gillespie algorithm provides a powerful tool for analyzing stochastic chemical kinetics.
  • Facilitates efficient kinetic parameter learning and biochemical network design.
  • Broadly applicable to problems in systems and synthetic biology.