Cargando…
Building a Hierarchical Organization of Protein Complexes Out of Protein Association Data
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 f...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4076247/ https://www.ncbi.nlm.nih.gov/pubmed/24978199 http://dx.doi.org/10.1371/journal.pone.0100098 |
_version_ | 1782323461528485888 |
---|---|
author | Stojmirović, Aleksandar Yu, Yi-Kuo |
author_facet | Stojmirović, Aleksandar Yu, Yi-Kuo |
author_sort | Stojmirović, Aleksandar |
collection | PubMed |
description | 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/. |
format | Online Article Text |
id | pubmed-4076247 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2014 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-40762472014-07-02 Building a Hierarchical Organization of Protein Complexes Out of Protein Association Data Stojmirović, Aleksandar Yu, Yi-Kuo PLoS One Research Article 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/. Public Library of Science 2014-06-30 /pmc/articles/PMC4076247/ /pubmed/24978199 http://dx.doi.org/10.1371/journal.pone.0100098 Text en https://creativecommons.org/publicdomain/zero/1.0/ This is an open-access article distributed under the terms of the Creative Commons Public Domain declaration, which stipulates that, once placed in the public domain, this work may be freely reproduced, distributed, transmitted, modified, built upon, or otherwise used by anyone for any lawful purpose. |
spellingShingle | Research Article Stojmirović, Aleksandar Yu, Yi-Kuo Building a Hierarchical Organization of Protein Complexes Out of Protein Association Data |
title | Building a Hierarchical Organization of Protein Complexes Out of Protein Association Data |
title_full | Building a Hierarchical Organization of Protein Complexes Out of Protein Association Data |
title_fullStr | Building a Hierarchical Organization of Protein Complexes Out of Protein Association Data |
title_full_unstemmed | Building a Hierarchical Organization of Protein Complexes Out of Protein Association Data |
title_short | Building a Hierarchical Organization of Protein Complexes Out of Protein Association Data |
title_sort | building a hierarchical organization of protein complexes out of protein association data |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4076247/ https://www.ncbi.nlm.nih.gov/pubmed/24978199 http://dx.doi.org/10.1371/journal.pone.0100098 |
work_keys_str_mv | AT stojmirovicaleksandar buildingahierarchicalorganizationofproteincomplexesoutofproteinassociationdata AT yuyikuo buildingahierarchicalorganizationofproteincomplexesoutofproteinassociationdata |