Evidence map›Paper›PMID 21685069›Full record

ArticleBioinformatics (Oxford, England)2011

Identification of metabolic network models from incomplete high-throughput datasets.

Sara Berthoumieux, Matteo Brilli, Hidde de Jong, Daniel Kahn, Eugenio Cinquemani

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.

0numbers the graph read from it
0cells of the map it votes in
8citing 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

8 citing papers in PubMed.

  1. Article
  2. Qualitative Modeling, Analysis and Control of Synthetic Regulatory Circuits.Methods in molecular biology (Clifton, N.J.) · 2021
    Review
  3. Review
  4. Article
  5. Article
  6. On the identifiability of metabolic network models.Journal of mathematical biology · 2013
    Article
  7. Review
  8. 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

5 authors.

Sara BerthoumieuxINRIA Grenoble-Rhône-Alpes, Montbonnot, France. sara.berthoumieux@inria.fr
Matteo Brilli
Hidde de Jong
Daniel Kahn
Eugenio Cinquemani

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationHigh-throughput measurement techniques for metabolism and gene expression provide a wealth of information for the identification of metabolic network models. Yet, missing observations scattered over the dataset restrict the number of effectively available datapoints and make classical regression techniques inaccurate or inapplicable. Thorough exploitation of the data by identification techniques that explicitly cope with missing observations is therefore of major importance.

resultsWe develop a maximum-likelihood approach for the estimation of unknown parameters of metabolic network models that relies on the integration of statistical priors to compensate for the missing data. In the context of the linlog metabolic modeling framework, we implement the identification method by an Expectation-Maximization (EM) algorithm and by a simpler direct numerical optimization method. We evaluate performance of our methods by comparison to existing approaches, and show that our EM method provides the best results over a variety of simulated scenarios. We then apply the EM algorithm to a real problem, the identification of a model for the Escherichia coli central carbon metabolism, based on challenging experimental data from the literature. This leads to promising results and allows us to highlight critical identification issues.

Indexed as

AlgorithmsMetabolic Networks and PathwaysComputational BiologyEscherichia coliModels, Biological

Identifiers

PMID21685069
PMCPMC3117355

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.