Evidence map›Paper›PMID 20587029›Full record

ArticleBMC bioinformatics2010

Inference of sparse combinatorial-control networks from gene-expression data: a message passing approach.

Marc Bailly-Bechet, Alfredo Braunstein, Andrea Pagnani, Martin Weigt, Riccardo Zecchina

Open access · goldAbstract read
In one paragraph

Article in BMC bioinformatics, 2010. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 18 papers.

0numbers the graph read from it
0cells of the map it votes in
18citing papers in PubMed
2.0field-weighted citation impact, top 14% of its field
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

18 citing papers in PubMed, 39 citations in OpenAlex.

  1. Article
  2. Review
  3. Review
  4. Article
  5. Article
  6. Article
  7. Predicting protein-ligand affinity with a random matrix framework.Proceedings of the National Academy of Sciences of the United States of America · 2016
    Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Simultaneous reconstruction of multiple signaling pathways via the prize-collecting steiner forest problem.Journal of computational biology : a journal of computational molecular cell biology · 2013
    Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Optimization-based inference for temporally evolving networks with applications in biology.Journal of computational biology : a journal of computational molecular cell biology · 2012
    Article
  18. 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 at 3 institutions in 2 countries.

Marc Bailly-BechetISI Foundation Viale Settimio Severo 65, Villa Gualino, I-10133 Torino, Italy.
Alfredo Braunstein
Andrea Pagnani
Martin Weigt
Riccardo Zecchina
Institute for Scientific Interchange · ITItalian institute for Genomic Medicine · ITPolytechnic University of Turin · IT

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundTranscriptional gene regulation is one of the most important mechanisms in controlling many essential cellular processes, including cell development, cell-cycle control, and the cellular response to variations in environmental conditions. Genes are regulated by transcription factors and other genes/proteins via a complex interconnection network. Such regulatory links may be predicted using microarray expression data, but most regulation models suppose transcription factor independence, which leads to spurious links when many genes have highly correlated expression levels.

resultsWe propose a new algorithm to infer combinatorial control networks from gene-expression data. Based on a simple model of combinatorial gene regulation, it includes a message-passing approach which avoids explicit sampling over putative gene-regulatory networks. This algorithm is shown to recover the structure of a simple artificial cell-cycle network model for baker's yeast. It is then applied to a large-scale yeast gene expression dataset in order to identify combinatorial regulations, and to a data set of direct medical interest, namely the Pleiotropic Drug Resistance (PDR) network.

conclusionsThe algorithm we designed is able to recover biologically meaningful interactions, as shown by recent experimental results 1. Moreover, new cases of combinatorial control are predicted, showing how simple models taking this phenomenon into account can lead to informative predictions and allow to extract more putative regulatory interactions from microarray databases.

Indexed as

AlgorithmsGene Expression Regulation, FungalGene Regulatory NetworksCell CycleGene Expression ProfilingModels, GeneticOligonucleotide Array Sequence AnalysisSaccharomyces cerevisiaeSaccharomyces cerevisiae ProteinsTranscription FactorsTranscription, GeneticSaccharomyces cerevisiae ProteinsTranscription Factors

Identifiers

PMID20587029
PMCPMC2909222
OpenAlexW2120801957

What OpenQuestion holds

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