Modeling Gene Regulatory Networks with Delayed Stochastic Dynamics
Bibliographic record
Abstract
We present a recently developed modeling strategy of gene regulatory networks (GRN) that uses the delayed stochastic simulation algorithm to drive its dynamics. First, we present experimental evidence that led us to use this strategy. Next, we describe the stochastic simulation algorithm (SSA), and the delayed SSA, able to simulate time-delayed events. We then present a model of single gene expression. From this, we present the general modeling strategy of GRN. Specific applications of the approach are presented, beginning with the model of single gene expression which mimics a recent experimental measurement of gene expression at single-protein level, to validate our modeling strategy. We also model a toggle switch with realistic noise and delays, used in cells as differentiation pathway switches. We show that its dynamics differs from previous modeling strategies predictions. As a final example, we model the P53-Mdm2 feedback loop, whose malfunction is associated to 50% of cancers, and can induce cells apoptosis. In the end, we briefly discuss some issues in modeling the evolution of GRNs, and outline some directions for further research.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".