The Inferelator: an algorithm for learning parsimonious regulatory networks from systems-biology data sets de novo
Open accessThe DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Abstract
We present a method (the Inferelator) for deriving genome-wide transcriptional regulatory interactions, and apply the method to predict a large portion of the regulatory network of the archaeon Halobacterium NRC-1. The Inferelator uses regression and variable selection to identify transcriptional influences on genes based on the integration of genome annotation and expression data. The learned network successfully predicted Halobacterium's global expression under novel perturbations with predictive power similar to that seen over training data. Several specific regulatory predictions were experimentally tested and verified.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures







![Figure 8 Selection of model for bicluster using cross-validation (CV). The ordinate represents an estimate of prediction error (ErrCV) from tenfold CV (the mean of the error in the 10 leave-out samples used is the CV error estimate). The shrinkage parameter t allows us to select subsets of predictors continuously. We evaluate our fitted model for a range of values of t (with t = 0 [the null model] and t = 1 [the ordinary least squares solution]). The error bars denote the standard error of ErrCV (the standard deviation of the 10 leave-out samples' error estimates). The red line shows the value of t selected for our final model for this cluster - the most parsimonious model within 1 standard error of the minimum on the ErrCV versus t curve.](https://figures.cochat.ai/paper-figures/2e12aba74cee4d8d94a19e0eaacf35d7/the-inferelator-an-algorithm-for-learning-parsimonious-regulatory-networks-from-figure-8.jpg)
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
In the citing paper
“The combination of CLR with another method, the Inferelator [78], became one of the top performers at the DREAM4 100-gene in silico network inference challenge [79].”
From Reverse engineering and identification in systems biology: strategies, perspectives and challenges (2014) · cites this paper as [78]
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482 · cited 1×
“Here, we adopt the L1 shrinkage or the LASSO [48,53] for predictor selection, which involves the following minimization: Subject to the following additional constraint: where β ols is the ordinary least squares estimate of β .”
MethodEmergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
The Pfam Protein Families Database
Bateman, A. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.276 · Cited by 14,000
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Using Bayesian Networks to Analyze Expression Data
Friedman, N., Linial, M., Nachman, I., & Pe'er, D. (2000) · Journal of Computational Biology · doi:10.1089/106652700750050961 · Cited by 3,266 · cited 1×
“Recent probabilistic approaches to modeling regulatory network on the genome-wide scale use Bayesian networks to model regulatory structure, de novo , at the Boolean level [6-11].”
The Pfam protein families database
Bateman, A. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh121 · Cited by 3,127
Transcriptional Regulatory Networks in Saccharomyces cerevisiae
Lee, T. I., Rinaldi, N. J., Robert, F., Odom, D. T., Bar-Joseph, Z., Gerber, G. K., Hannett, N. M., Harbison, C. T., Thompson, C. M., Simon, I., et al. (2002) · Science · doi:10.1126/science.1075090 · Cited by 2,956
Network motifs in the transcriptional regulation network of Escherichia coli
Shen-Orr, S. S., Milo, R., Mangan, S., & Alon, U. (2002) · Nature Genetics · doi:10.1038/ng881 · Cited by 2,952 · cited 1×
“This assumption breaks down when activators are self-activating and correctly included in biclusters that they regulate [40].”
BackgroundModeling and Simulation of Genetic Regulatory Systems: A Literature Review
de Jong, H. (2002) · Journal of Computational Biology · doi:10.1089/10665270252833208 · Cited by 2,663 · cited 2×
“com/2006/7/5/R36 or when the system is confronted with novel stimulatory factors or novel combinations of perturbations? A significant body of work has been devoted to the modeling and learning of regulatory networks [1-3].”
Background
Cited by
Two new Later Stone Age sites from the Final Pleistocene in the Falémé Valley, eastern Senegal
Ndiaye, M., Lespez, L., Tribolo, C., Rassé, M., Hadjas, I., Davidoux, S., Huysecom, É., & Douze, K. (2024) · Monash University Research Portal (Monash University) · doi:10.3929/ethz-b-000667478 · Cited by 23,868
TopHat: discovering splice junctions with RNA-Seq
Trapnell, C., Pachter, L., & Salzberg, S. L. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp120 · Cited by 11,617
Inferring Regulatory Networks from Expression Data Using Tree-Based Methods
Huynh-Thu, V. A., Irrthum, A., Wehenkel, L., & Geurts, P. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012776 · Cited by 2,131
“Nevertheless, hybrid methods involving ordinary differential equations have shown good performances on real-life genome-wide GRN inference [8].”
BackgroundSparse and Compositionally Robust Inference of Microbial Ecological Networks
Kurtz, Z. D., Müller, C. L., Miraldi, E. R., Littman, D. R., Blaser, M. J., & Bonneau, R. A. (2015) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004226 · Cited by 1,799
“Second, SPIEC-EASI estimates the interaction graph from the transformed data using one of two methods: (i) neighborhood selection [20, 21] and (ii) sparse inverse covariance selection [22, 23].”
MethodSelf-citationFaith, J. J., Hayete, B., Thaden, J. T., Mogno, I., Wierzbowski, J., Cottarel, G., Kasif, S., Collins, J. J., & Gardner, T. S. (2007) · PLoS Biology · doi:10.1371/journal.pbio.0050008 · Cited by 1,563
“…used machine-learning algorithms to identify cis -regulatory motifs or transcription factor target genes using a large set of expression arrays [2–18], genome-wide location analysis chromatin immunoprecipitation (ChIP-Chip) [19,20], or a combination of these and other high-throughput methods…”
Method
Metadata
- Authors
- Bonneau, R., Reiss, D. J., Shannon, P., Facciotti, M., Hood, L., Baliga, N. S., & Thorsson, V.
- Affiliations
- Courant Institute of Mathematical Sciences (US)
- Institute for Systems Biology (US)
- Corresponding author
- Bonneau, Richard
- Venue
- Genome Biology
- Published
- 2006-05-10
- Volume
- 7
- Issue
- 5
- Pages
- R36-R36
- ISSN
- 1465-6906 (ISSN-L)
- 1474-760X
- PMC
- PMC1779511
- OpenAlex
- W2129265801
- Cited by
- 510
- References
- 54
- Citations by year
- 2026: 14 · 2025: 8 · 2024: 15 · 2023: 17 · 2022: 21 · 2021: 27 · 2020: 25 · 2019: 23 · 2018: 29 · 2017: 24 · 2016: 39 · 2015: 33 · 2014: 26 · 2013: 34 · 2012: 35
- FWCI
- 10.62
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/2.0/ (tdm)
- creativecommons.org/licenses/by/2.0/ (vor)
- Locations
- Genome biology (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- Funders
- National Science Foundation (0220153, 0313754)
- U.S. Department of Energy (FG02-04ER63807)
- Deutscher Akademischer Austauschdienst
- National Institutes of Health
- National Institute of General Medical Sciences (P20GM064361, P20 GM64361)
- 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
- transcriptional regulatory networks, archaea, gene expression prediction, feature selection, regression analysis, perturbation prediction, regulatory interactions
- MeSH terms
- Adenosine Triphosphatases, Algorithms, Halobacterium, Homeostasis, Ribosomal Proteins, Transcription Factors, Cluster Analysis, Archaeal Proteins, Gene Expression Regulation, Archaeal, Oligonucleotide Array Sequence Analysis, Gene Expression Profiling, Genomics, Cation Transport Proteins, Systems Biology
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: The Inferelator: an algorithm for learning parsimonious regulatory networks from systems-biology data sets de novo. https://app.cochat.ai/papers/10.1186/gb-2006-7-5-r36
- The paper
- Bonneau, R., Reiss, D. J., Shannon, P., Facciotti, M., Hood, L., Baliga, N. S., & Thorsson, V. (2006). The Inferelator: an algorithm for learning parsimonious regulatory networks from systems-biology data sets de novo. Genome Biology. https://doi.org/10.1186/gb-2006-7-5-r36
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.