Evidence map›Paper›PMID 24978199›Full record

ArticlePloS one2014

Building a hierarchical organization of protein complexes out of protein association data.

Aleksandar Stojmirović, Yi-Kuo Yu

Abstract read
In one paragraph

Article in PloS one, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
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

1 citing paper in PubMed.

  1. 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.

Aleksandar StojmirovićNational Center for Biotechnology Information, National Library of Medicine, National Institutes of Health, Bethesda, Maryland, United States.
Yi-Kuo YuNational Center for Biotechnology Information, National Library of Medicine, National Institutes of Health, Bethesda, Maryland, United States.

Funding

Robust Accurate Identification of peptides from tandem mass spectrometry dataZIALM092404 · NLM · NATIONAL LIBRARY OF MEDICINE · PI YU, YI-KUO · 2009 to 2025
$13.2M
Intramural NIH HHS
6 · The paper itself

Abstract

Organizing experimentally determined protein associations as a hierarchy can be a good approach to elucidating the content of protein complexes and the modularity of subcomplexes. Several challenges exist. First, intrinsically sticky proteins, such as chaperones, are often falsely assigned to many functionally unrelated complexes. Second, the reported collections of proteins may not be true "complexes" in the sense that they bind together and perform a joint cellular function. Third, due to imperfect sensitivity of protein detection methods, both false positive and false negative assignments of a protein to complexes may occur. We mitigate the first issue by down-weighting sticky proteins by their occurrence frequencies. We approach the other two problems by merging nearly identical complexes and by constructing a directed acyclic graph (DAG) based on the relationship of partial inclusion. The constructed DAG, within which smaller complexes form parts of the larger, can reveal how different complexes are joined. By merging almost identical complexes one can deemphasize the influence of false positives, while allowing false negatives to be rescued by other nearly identical association data. We investigate several protein weighting schemes and compare their corresponding DAGs using yeast and human complexes. We find that the scheme incorporating weights based on information flow in the network of direct protein-protein interactions produces biologically most meaningful DAGs. In either yeast or human, isolated nodes form a large proportion of the final hierarchy. While most connected components encompass very few nodes, the largest one for each species contains a sizable portion of all nodes. By considering examples of subgraphs composed of nodes containing a specified protein, we illustrate that the graphs' topological features can correctly suggest the biological roles of protein complexes. The input data, final results and the source code are available at ftp://ftp.ncbi.nlm.nih.gov/pub/qmbpmn/ProteinComplexDAG/.

Indexed as

AlgorithmsGene Regulatory NetworksProtein Interaction MappingSoftwareComputer GraphicsDatabases, GeneticData MiningGene ExpressionHumansMolecular ChaperonesProtein BindingProtein MultimerizationProteomeSaccharomyces cerevisiaeSystems BiologyMolecular ChaperonesProteome

Identifiers

PMID24978199
PMCPMC4076247

What OpenQuestion holds

Textmetadata
LicenceCC0
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.