Cited by 1,667Gene Regulatory Network AnalysisMicrobial Metabolic Engineering and BioproductionBioinformatics and Genomic Networks

Wisdom of crowds for robust gene network inference

Open access
The DREAM5 Consortium, Marbach, Daniel, Costello, James C, Küffner, Robert, Vega, Nicole M, Prill, Robert J, Camacho, Diogo M, Allison, Kyle R +3 more·2012·Nature Methods

Abstract

Reconstructing gene regulatory networks from high-throughput data is a long-standing challenge. Through the Dialogue on Reverse Engineering Assessment and Methods (DREAM) project, we performed a comprehensive blind assessment of over 30 network inference methods on Escherichia coli, Staphylococcus aureus, Saccharomyces cerevisiae and in silico microarray data. We characterize the performance, data requirements and inherent biases of different inference approaches, and we provide guidelines for algorithm application and development. We observed that no single inference method performs optimally across all data sets. In contrast, integration of predictions from multiple inference methods shows robust and high performance across diverse data sets. We thereby constructed high-confidence networks for E. coli and S. aureus, each comprising ~1,700 transcriptional interactions at a precision of ~50%. We experimentally tested 53 previously unobserved regulatory interactions in E. coli, of which 23 (43%) were supported. Our results establish community-based methods as a powerful and robust tool for the inference of transcriptional gene regulatory networks.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/nmeth.2016

Cites

52 of 52 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Ensemble inference methodologies were identified as more robust for identification of gene-gene interactions from coexpression data.

    “where ensemble inference methodologies were identified as more robust for identification of gene-gene interactions from coexpression data.”
  • To obtain module-level reproducibility, 20 independent samples are usually sufficient, but systematic and accurate reconstruction of specific edges may require hundreds of samples.

    “To obtain module-level reproducibility, 20 independent samples are usually sufficient40, but systematic and accurate reconstruction of specific edges, particularly for systematic regulatory relationship discovery, may require hundreds of samples49.”
  • At currently available sample sizes, networks are most reproducible at module level, then hub gene level, and least at precise gene connectivity rankings or module memberships.

    “At currently available sample sizes, networks are most reproducible at a module level35,38,39, then at the hub gene level41,223 and, last, at the level of precise gene connectivity rankings or precise module memberships of genes40,49.”
  • The DREAM challenge identified that integration of multiple network methods yields the most robust regulatory relationship predictions.

    “The DREAM challenge identified that the integration of multiple network methods yields the most robust regulatory relationship predictions49.”
  • To obtain module-level reproducibility, 20 independent samples are typically considered adequate.

    “To obtain module-level reproducibility, 20 independent samples are typically considered adequate; however, systematic consistency at the more granular hub and module membership levels may require hundreds of samples [61, 93, 94].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. [39]Mani S Cooper GF A Bayesian Local Causal Discovery Algorithm Proceedings of the World Congress on Medical Informatics 731 735 2004 15360909
  2. [41]Aliferis CF Statnikov A Tsamardinos I Mani S Koutsoukos XD Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part I: Algorithm and Empirical Evaluation Journal of Machine Learning Research 11 171 234 2010

Cited by

Sorted by citations

Authors
The DREAM5 Consortium, Marbach, D., Costello, J. C., Küffner, R., Vega, N. M., Prill, R. J., Camacho, D. M., Allison, K. R., Kellis, M., Collins, J. J., & Stolovitzky, G.
Affiliations
  • MIT Computer Science and Artificial Intelligence Laboratory (US)
  • Boston University (US)
  • Ludwig-Maximilians-Universität München (DE)
  • IBM (United States) (US)
  • Broad Institute (US)
Corresponding author
Stolovitzky, Gustavo
Venue
Nature Methods
Published
2012-07-15
Volume
9
Issue
8
Pages
796-804
ISSN
  • 1548-7091 (ISSN-L)
  • 1548-7105
OpenAlex
W1543475572
Cited by
1,667
References
52
Citations by year
2026: 76 · 2025: 70 · 2024: 90 · 2023: 102 · 2022: 112 · 2021: 136 · 2020: 147 · 2019: 133 · 2018: 140 · 2017: 147 · 2016: 154 · 2015: 142 · 2014: 118 · 2013: 82 · 2012: 18
FWCI
46.38
Type
journal article
Language
en
Open access
Locations
  • Nature Methods (publishedVersion)
  • PubMed (publishedVersion)
  • Europe PMC (PubMed Central) (acceptedVersion)
  • PubMed Central (acceptedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion)
  • Ghent University Academic Bibliography (Ghent University) (submittedVersion)
  • CINECA IRIS Institutial research information system (University of Pisa) (submittedVersion)
  • Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) (submittedVersion)
  • ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam) (submittedVersion)
  • UNICA IRIS Institutional Research Information System (University of Cagliari) (submittedVersion)
  • Institutional Research Information System University of Turin (University of Turin) (submittedVersion)
  • mediaTUM (Technical University of Munich) (submittedVersion)
  • mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) (submittedVersion, other-oa)
  • ORBi (University of Liège) (submittedVersion)
  • Use Siena air (University of Siena) (submittedVersion)
  • PMC
Funders
  • National Science Foundation (U54CA132383, 0420407)
  • Howard Hughes Medical Institute
  • Agence Nationale de la Recherche (ANR-09-BLAN-0051, ANR-07-BLAN-0311)
  • Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (200767)
  • Irish Research Council
  • Fonds De La Recherche Scientifique - FNRS
  • Fédération Wallonie-Bruxelles
  • Fonds Wetenschappelijk Onderzoek
  • Tel Aviv University
  • Vlaamse regering
  • Irish Centre for High-End Computing
  • National Institutes of Health (DP1OD003644)
  • National Human Genome Research Institute (R01HG004037)
  • National Cancer Institute (U54CA121852, U54CA132383)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Gene Regulatory Network Analysis
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Microbial Metabolic Engineering and Bioproduction
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
Keywords
gene regulatory network inference, wisdom of crowds, ensemble methods, DREAM challenge, Escherichia coli, Staphylococcus aureus, Saccharomyces cerevisiae, methodological bias
MeSH terms
Algorithms, Escherichia coli, Saccharomyces cerevisiae, Software, Staphylococcus aureus, Transcription, Genetic, Gene Expression Regulation, Bacterial, Computational Biology, Oligonucleotide Array Sequence Analysis, Gene Regulatory Networks

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review