ArticlePloS one2010
DREAM3: network inference using dynamic context likelihood of relatedness and the inferelator.
Article in PloS one, 2010. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 46 papers.
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.
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.
Who cites it
46 citing papers in PubMed.
- Article
- GeneSNAKE: a Python package for simulation of gene regulatory networks and perturbation-induced expression data.Bioinformatics advances · 2026Article
- Mapping the transcriptional regulatory network of a fungal pathogen by exploiting transcription factor perturbation.bioRxiv : the preprint server for biology · 2025Article
- QACDes: QoS-aware context-sensitive design of cyber-physical systems.Scientific reports · 2024Article
- Structure-primed embedding on the transcription factor manifold enables transparent model architectures for gene regulatory network and latent activity inference.Genome biology · 2024Article
- Knowledge of the perturbation design is essential for accurate gene regulatory network inference.Scientific reports · 2022Article
- Optimal Sparsity Selection Based on an Information Criterion for Accurate Gene Regulatory Network Inference.Frontiers in genetics · 2022Article
- Biological network analysis with deep learning.Briefings in bioinformatics · 2021Review
- Causal network inference from gene transcriptional time-series response to glucocorticoids.PLoS computational biology · 2021Article
- Quantitative Translation of Dog-to-Human Aging by Conserved Remodeling of the DNA Methylome.Cell systems · 2020Article
- Inference of Bacterial Small RNA Regulatory Networks and Integration with Transcription Factor-Driven Regulatory Networks.mSystems · 2020Article
- LiPLike: towards gene regulatory network predictions of high certainty.Bioinformatics (Oxford, England) · 2020Article
- Reverse engineering gene networks using global-local shrinkage rules.Interface focus · 2020Article
- Article
- A Comprehensive Map of the Monocyte-Derived Dendritic Cell Transcriptional Network Engaged upon Innate Sensing of HIV.Cell reports · 2020Article
- Network inference performance complexity: a consequence of topological, experimental and algorithmic determinants.Bioinformatics (Oxford, England) · 2019Article
- Leveraging chromatin accessibility for transcriptional regulatory network inference in T Helper 17 Cells.Genome research · 2019Article
- Inferring transcriptional logic from multiple dynamic experiments.Bioinformatics (Oxford, England) · 2017Article
- The G-Box Transcriptional Regulatory Code in Arabidopsis.Plant physiology · 2017Article
- Gene Regulatory Network Inference from Single-Cell Data Using Multivariate Information Measures.Cell systems · 2017Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
Abstract
backgroundMany current works aiming to learn regulatory networks from systems biology data must balance model complexity with respect to data availability and quality. Methods that learn regulatory associations based on unit-less metrics, such as Mutual Information, are attractive in that they scale well and reduce the number of free parameters (model complexity) per interaction to a minimum. In contrast, methods for learning regulatory networks based on explicit dynamical models are more complex and scale less gracefully, but are attractive as they may allow direct prediction of transcriptional dynamics and resolve the directionality of many regulatory interactions. METHODOLOGY: We aim to investigate whether scalable information based methods (like the Context Likelihood of Relatedness method) and more explicit dynamical models (like Inferelator 1.0) prove synergistic when combined. We test a pipeline where a novel modification of the Context Likelihood of Relatedness (mixed-CLR, modified to use time series data) is first used to define likely regulatory interactions and then Inferelator 1.0 is used for final model selection and to build an explicit dynamical model. CONCLUSIONS/SIGNIFICANCE: Our method ranked 2nd out of 22 in the DREAM3 100-gene in silico networks challenge. Mixed-CLR and Inferelator 1.0 are complementary, demonstrating a large performance gain relative to any single tested method, with precision being especially high at low recall values. Partitioning the provided data set into four groups (knock-down, knock-out, time-series, and combined) revealed that using comprehensive knock-out data alone provides optimal performance. Inferelator 1.0 proved particularly powerful at resolving the directionality of regulatory interactions, i.e. "who regulates who" (approximately of identified true positives were correctly resolved). Performance drops for high in-degree genes, i.e. as the number of regulators per target gene increases, but not with out-degree, i.e. performance is not affected by the presence of regulatory hubs.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.