Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 51 of the 53 references it cites were found in a registry or an index.

Inferring Regulatory Networks from Expression Data Using Tree-Based Methods

Open access
Huynh-Thu, Vân Anh, Irrthum, Alexandre, Wehenkel, Louis, Geurts, Pierre · 2010 · PLoS ONE

Abstract

One of the pressing open problems of computational systems biology is the elucidation of the topology of genetic regulatory networks (GRNs) using high throughput genomic data, in particular microarray gene expression data. The Dialogue for Reverse Engineering Assessments and Methods (DREAM) challenge aims to evaluate the success of GRN inference algorithms on benchmarks of simulated data. In this article, we present GENIE3, a new algorithm for the inference of GRNs that was best performer in the DREAM4 In Silico Multifactorial challenge. GENIE3 decomposes the prediction of a regulatory network between p genes into p different regression problems. In each of the regression problems, the expression pattern of one of the genes (target gene) is predicted from the expression patterns of all the other genes (input genes), using tree-based ensemble methods Random Forests or Extra-Trees. The importance of an input gene in the prediction of the target gene expression pattern is taken as an indication of a putative regulatory link. Putative regulatory links are then aggregated over all genes to provide a ranking of interactions from which the whole network is reconstructed. In addition to performing well on the DREAM4 In Silico Multifactorial challenge simulated data, we show that GENIE3 compares favorably with existing algorithms to decipher the genetic regulatory network of Escherichia coli. It doesn't make any assumption about the nature of gene regulation, can deal with combinatorial and non-linear interactions, produces directed GRNs, and is fast and scalable. In conclusion, we propose a new algorithm for GRN inference that performs well on both synthetic and real gene expression data. The algorithm, based on feature selection with tree-based ensemble methods, is simple and generic, making it adaptable to other types of genomic data and interactions.

Overview

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.1371/journal.pone.0012776

Cites

51 of 51 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 GENIE3 procedure. For each gene , a learning sample is generated with expression levels of j as output values and expression levels of all other genes as input values. A function is learned from and a local ranking of all genes except j is computed. The p local rankings are then aggregated to get a global ranking of all regulatory links.
Figure 1 GENIE3 procedure. For each gene , a learning sample is generated with expression levels of j as output values and expression levels of all other genes as input values. A function is learned from and a local ranking of all genes except j is computed. The p local rankings are then aggregated to get a global ranking of all regulatory links.CC BY · PubMed Central
Figure 2 Detailed results on DREAM4 NET3. Ranking of the regulators for all genes. Each row corresponds to a gene. Dots in each row represent the positions in the Random Forests ranking of the regulators of this gene. Genes are ordered on the y-axis according to their number of regulators in the gold standard network; those having the same number of regulators are grouped inside an horizontal block (from no regulator at the top to 6 regulators at the bottom). Inside each block, genes are ordered according to the median rank of their regulators. The ranking of interactions was obtained with Random Forests and .
Figure 2 Detailed results on DREAM4 NET3. Ranking of the regulators for all genes. Each row corresponds to a gene. Dots in each row represent the positions in the Random Forests ranking of the regulators of this gene. Genes are ordered on the y-axis according to their number of regulators in the gold standard network; those having the same number of regulators are grouped inside an horizontal block (from no regulator at the top to 6 regulators at the bottom). Inside each block, genes are ordered according to the median rank of their regulators. The ranking of interactions was obtained with Random Forests and .CC BY · PubMed Central
Figure 3 Rank of regulators as a function of the in-degree of the target. The in-degree of a target is its number of regulators. The dot corresponding to in-degree n is the median rank of regulators that regulate a gene with in-degree n, over the five networks. The rank is presented here as a percentage, such that the first and last regulators of each ranking have a rank equal to 100% and 0% respectively. The ranking of interactions was obtained with Random Forests and .
Figure 3 Rank of regulators as a function of the in-degree of the target. The in-degree of a target is its number of regulators. The dot corresponding to in-degree n is the median rank of regulators that regulate a gene with in-degree n, over the five networks. The rank is presented here as a percentage, such that the first and last regulators of each ranking have a rank equal to 100% and 0% respectively. The ranking of interactions was obtained with Random Forests and .CC BY · PubMed Central
Figure 4 Precision-Recall curves for the E. coli network. Only known transcription factors were used as input genes. A. Comparison between the four different settings of the tree procedure. B. Comparison to other approaches.
Figure 4 Precision-Recall curves for the E. coli network. Only known transcription factors were used as input genes. A. Comparison between the four different settings of the tree procedure. B. Comparison to other approaches.CC BY · PubMed Central

Verification

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?

Self-check

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

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

Citations

Cites

Show all 53 references

Research works printed but not linked: 2

  1. TM Cover, 2006, Elements of Information Theory 2nd Edition
  2. J Schäfer, 2006, Reverse engineering genetic networks using the GeneNet package., R News 6/, 5, 50

Cited by

See all 2,131

Metadata

Authors
Huynh-Thu, V. A., Irrthum, A., Wehenkel, L., & Geurts, P.
Affiliations
University of Liège (BE)
Venue
PLoS ONE
Published
2010-09-28
Volume
5
Issue
9
Pages
e12776
ISSN
1932-6203 (ISSN-L)
OpenAlex
W2076513103
Cited by
2,131
References
53
Citations by year
2026: 237 · 2025: 273 · 2024: 274 · 2023: 241 · 2022: 225 · 2021: 194 · 2020: 146 · 2019: 120 · 2018: 95 · 2017: 79 · 2016: 59 · 2015: 63 · 2014: 53 · 2013: 36 · 2012: 25
FWCI
9.24
Type
journal article
Language
en
Open access
Locations
  • PLoS ONE (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Figshare (submittedVersion, cc-by)
  • Open Repository and Bibliography (University of Liège) (submittedVersion)
  • ORBi (University of Liège) (submittedVersion, other-oa)
  • ORBi (University of Liège) (submittedVersion)
Funders
  • Fonds De La Recherche Scientifique - FNRS
  • Fédération Wallonie-Bruxelles
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Gene Regulatory Network Analysis
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Microbial Metabolic Engineering and Bioproduction
Keywords
GENIE3, random forest, extra trees, microarray gene expression, Escherichia coli, feature selection, network topology
MeSH terms
Algorithms, Escherichia coli, Gene Expression Regulation, 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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Inferring Regulatory Networks from Expression Data Using Tree-Based Methods. https://app.cochat.ai/papers/10.1371/journal.pone.0012776
The paper
Huynh-Thu, V. A., Irrthum, A., Wehenkel, L., & Geurts, P. (2010). Inferring Regulatory Networks from Expression Data Using Tree-Based Methods. PLoS ONE. https://doi.org/10.1371/journal.pone.0012776

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.