Evidence map›Paper›PMID 27221101›Full record

ArticleJournal of mathematical biology2017

Graphical reduction of reaction networks by linear elimination of species.

Meritxell Sáez, Carsten Wiuf, Elisenda Feliu

Abstract read
PubMed Publisher
In one paragraph

Article in Journal of mathematical biology, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

0numbers the graph read from it
0cells of the map it votes in
6citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

6 citing papers in PubMed.

  1. Review
  2. Article
  3. Article
  4. Joining and decomposing reaction networks.Journal of mathematical biology · 2020
    Article
  5. Review
  6. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Meritxell SáezDepartment of Mathematical Sciences. University of Copenhagen, Universitetsparken 5, 2100, Copenhagen, Denmark.ORCID 0000-0002-2991-3183
Carsten WiufDepartment of Mathematical Sciences. University of Copenhagen, Universitetsparken 5, 2100, Copenhagen, Denmark.ORCID 0000-0002-1302-4445
Elisenda FeliuDepartment of Mathematical Sciences. University of Copenhagen, Universitetsparken 5, 2100, Copenhagen, Denmark. efeliu@math.ku.dk.ORCID 0000-0001-7205-6511

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The quasi-steady state approximation and time-scale separation are commonly applied methods to simplify models of biochemical reaction networks based on ordinary differential equations (ODEs). The concentrations of the "fast" species are assumed effectively to be at steady state with respect to the "slow" species. Under this assumption the steady state equations can be used to eliminate the "fast" variables and a new ODE system with only the slow species can be obtained. We interpret a reduced system obtained by time-scale separation as the ODE system arising from a unique reaction network, by identification of a set of reactions and the corresponding rate functions. The procedure is graphically based and can easily be worked out by hand for small networks. For larger networks, we provide a pseudo-algorithm. We study properties of the reduced network, its kinetics and conservation laws, and show that the kinetics of the reduced network fulfil realistic assumptions, provided the original network does. We illustrate our results using biological examples such as substrate mechanisms, post-translational modification systems and networks with intermediates (transient) steps.

Indexed as

Models, BiologicalAlgorithmsBiochemical PhenomenaKineticsProtein Processing, Post-TranslationalDynamical systemNoninteractingPositivityQuasi-steady-stateReduced networkSpecies graph

Identifiers

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.