Evidence map›Paper›PMID 20066032›Full record

ArticlePLoS computational biology2010

Network-free inference of knockout effects in yeast.

Tal Peleg, Nir Yosef, Eytan Ruppin, Roded Sharan

Open access · goldAbstract read
In one paragraph

Article in PLoS computational biology, 2010. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

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

9 citing papers in PubMed, 14 citations in OpenAlex.

  1. Signing protein-protein interaction networks.Bioinformatics (Oxford, England) · 2026
    Article
  2. Article
  3. An optimization framework for network annotation.Bioinformatics (Oxford, England) · 2018
    Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Review
  9. 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

4 authors at 1 institution in 1 country.

Tal PelegBlavatnik School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel.
Nir Yosef
Eytan Ruppin
Roded Sharan
Tel Aviv University · IL

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Perturbation experiments, in which a certain gene is knocked out and the expression levels of other genes are observed, constitute a fundamental step in uncovering the intricate wiring diagrams in the living cell and elucidating the causal roles of genes in signaling and regulation. Here we present a novel framework for analyzing large cohorts of gene knockout experiments and their genome-wide effects on expression levels. We devise clustering-like algorithms that identify groups of genes that behave similarly with respect to the knockout data, and utilize them to predict knockout effects and to annotate physical interactions between proteins as inhibiting or activating. Differing from previous approaches, our prediction approach does not depend on physical network information; the latter is used only for the annotation task. Consequently, it is both more efficient and of wider applicability than previous methods. We evaluate our approach using a large scale collection of gene knockout experiments in yeast, comparing it to the state-of-the-art SPINE algorithm. In cross validation tests, our algorithm exhibits superior prediction accuracy, while at the same time increasing the coverage by over 25-fold. Significant coverage gains are obtained also in the annotation of the physical network.

Indexed as

Gene Regulatory NetworksAlgorithmsCluster AnalysisGene Knockout TechniquesGenes, FungalLinear ModelsReproducibility of ResultsSystems BiologyYeasts

Identifiers

PMID20066032
PMCPMC2795781
OpenAlexW2038236366

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.