Evidence map›Paper›PMID 18421371›Full record

ArticlePLoS computational biology2008

Predicting co-complexed protein pairs from heterogeneous data.

Jian Qiu, William Stafford Noble

Open access · goldAbstract read
In one paragraph

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

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

29 citing papers in PubMed, 72 citations in OpenAlex.

  1. Defining the extent of gene function using ROC curvature.Bioinformatics (Oxford, England) · 2022
    Article
  2. Article
  3. Review
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Review
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. 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

2 authors at 1 institution in 1 country.

Jian QiuDepartment of Genome Sciences, University of Washington, Seattle, Washington, United States of America.
William Stafford Noble
University of Washington · US

Funding

ZDS2P REGULATES SWE1P-DEPENDENT POLARIZED CELL GROWTH IN S CEREVISIAEP41RR011823 · NCRR · UNIVERSITY OF WASHINGTON · PI DAVIS, TRACY · 1996 to 2011
$24.7M
Detecting relations among heterogeneous genomic datasetsR33HG003070 · NHGRI · UNIVERSITY OF WASHINGTON · PI NOBLE, WILLIAM STAFFORD · 2004 to 2006
$1.2M
NCRR NIH HHS P41 RR011823NCRR NIH HHS P41 RR11823NHGRI NIH HHS R33 HG003070
6 · The paper itself

Abstract

Proteins do not carry out their functions alone. Instead, they often act by participating in macromolecular complexes and play different functional roles depending on the other members of the complex. It is therefore interesting to identify co-complex relationships. Although protein complexes can be identified in a high-throughput manner by experimental technologies such as affinity purification coupled with mass spectrometry (APMS), these large-scale datasets often suffer from high false positive and false negative rates. Here, we present a computational method that predicts co-complexed protein pair (CCPP) relationships using kernel methods from heterogeneous data sources. We show that a diffusion kernel based on random walks on the full network topology yields good performance in predicting CCPPs from protein interaction networks. In the setting of direct ranking, a diffusion kernel performs much better than the mutual clustering coefficient. In the setting of SVM classifiers, a diffusion kernel performs much better than a linear kernel. We also show that combination of complementary information improves the performance of our CCPP recognizer. A summation of three diffusion kernels based on two-hybrid, APMS, and genetic interaction networks and three sequence kernels achieves better performance than the sequence kernels or diffusion kernels alone. Inclusion of additional features achieves a still better ROC(50) of 0.937. Assuming a negative-to-positive ratio of 600ratio1, the final classifier achieves 89.3% coverage at an estimated false discovery rate of 10%. Finally, we applied our prediction method to two recently described APMS datasets. We find that our predicted positives are highly enriched with CCPPs that are identified by both datasets, suggesting that our method successfully identifies true CCPPs. An SVM classifier trained from heterogeneous data sources provides accurate predictions of CCPPs in yeast. This computational method thereby provides an inexpensive method for identifying protein complexes that extends and complements high-throughput experimental data.

Indexed as

Models, ChemicalModels, MolecularAmino Acid SequenceBinding SitesComputer SimulationDatabases, ProteinInformation Storage and RetrievalMolecular Sequence DataMultiprotein ComplexesProtein BindingProtein ConformationProtein Interaction MappingProteinsSequence Analysis, ProteinMultiprotein ComplexesProteins

Identifiers

PMID18421371
PMCPMC2275314
OpenAlexW2014594785

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.