IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1000659.html
   My bibliography  Save this article

Protein Interaction Networks—More Than Mere Modules

Author

Listed:
  • Stefan Pinkert
  • Jörg Schultz
  • Jörg Reichardt

Abstract

It is widely believed that the modular organization of cellular function is reflected in a modular structure of molecular networks. A common view is that a “module” in a network is a cohesively linked group of nodes, densely connected internally and sparsely interacting with the rest of the network. Many algorithms try to identify functional modules in protein-interaction networks (PIN) by searching for such cohesive groups of proteins. Here, we present an alternative approach independent of any prior definition of what actually constitutes a “module”. In a self-consistent manner, proteins are grouped into “functional roles” if they interact in similar ways with other proteins according to their functional roles. Such grouping may well result in cohesive modules again, but only if the network structure actually supports this. We applied our method to the PIN from the Human Protein Reference Database (HPRD) and found that a representation of the network in terms of cohesive modules, at least on a global scale, does not optimally represent the network's structure because it focuses on finding independent groups of proteins. In contrast, a decomposition into functional roles is able to depict the structure much better as it also takes into account the interdependencies between roles and even allows groupings based on the absence of interactions between proteins in the same functional role. This, for example, is the case for transmembrane proteins, which could never be recognized as a cohesive group of nodes in a PIN. When mapping experimental methods onto the groups, we identified profound differences in the coverage suggesting that our method is able to capture experimental bias in the data, too. For example yeast-two-hybrid data were highly overrepresented in one particular group. Thus, there is more structure in protein-interaction networks than cohesive modules alone and we believe this finding can significantly improve automated function prediction algorithms.Author Summary: Cellular function is widely believed to be organized in a modular fashion. On all scales and at all levels of complexity, relatively independent sub-units perform relatively independent sub-tasks. This functional modularity must be reflected in the topology of molecular networks. But how a functional module should be represented in an interaction network is an open question. On a small scale, one can identify a protein-complex as a module in protein-interaction networks (PIN), i.e., modules are understood as densely linked (interacting) groups of proteins, that are only sparsely interacting with the rest of the network. In this contribution, we show that extrapolating this concept of cohesively linked clusters of proteins as modules to the scale of the entire PIN inevitably misses important and functionally relevant structure inherent in the network. As an alternative, we introduce a novel way of decomposing a network into functional roles and show that this represents network structure and function more efficiently. This finding should have a profound impact on all module assisted methods of protein function prediction and should shed new light on how functional modules can be represented in molecular interaction networks in general.

Suggested Citation

  • Stefan Pinkert & Jörg Schultz & Jörg Reichardt, 2010. "Protein Interaction Networks—More Than Mere Modules," PLOS Computational Biology, Public Library of Science, vol. 6(1), pages 1-13, January.
  • Handle: RePEc:plo:pcbi00:1000659
    DOI: 10.1371/journal.pcbi.1000659
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1000659
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1000659&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1000659?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Gergely Palla & Imre Derényi & Illés Farkas & Tamás Vicsek, 2005. "Uncovering the overlapping community structure of complex networks in nature and society," Nature, Nature, vol. 435(7043), pages 814-818, June.
    2. Roger Guimerà & Luís A. Nunes Amaral, 2005. "Functional cartography of complex metabolic networks," Nature, Nature, vol. 433(7028), pages 895-900, February.
    3. Stephen Oliver, 2000. "Guilt-by-association goes global," Nature, Nature, vol. 403(6770), pages 601-602, February.
    4. J. Reichardt & D. R. White, 2007. "Role models for complex networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 60(2), pages 217-224, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Blagus, Neli & Šubelj, Lovro & Weiss, Gregor & Bajec, Marko, 2015. "Sampling promotes community structure in social and information networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 432(C), pages 206-215.
    2. Bai, Xiwen & Ma, Zhongjun & Zhou, Yaoming, 2023. "Data-driven static and dynamic resilience assessment of the global liner shipping network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 170(C).
    3. Barigozzi, Matteo & Fagiolo, Giorgio & Mangioni, Giuseppe, 2011. "Identifying the community structure of the international-trade multi-network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(11), pages 2051-2066.
    4. Beiró, Mariano G. & Busch, Jorge R. & Grynberg, Sebastian P. & Alvarez-Hamelin, J. Ignacio, 2013. "Obtaining communities with a fitness growth process," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(9), pages 2278-2293.
    5. Šubelj, Lovro & Bajec, Marko, 2014. "Group detection in complex networks: An algorithm and comparison of the state of the art," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 397(C), pages 144-156.
    6. Eustace, Justine & Wang, Xingyuan & Cui, Yaozu, 2015. "Community detection using local neighborhood in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 665-677.
    7. Xiao‐Bing Hu & Hang Li & XiaoMei Guo & Pieter H. A. J. M. van Gelder & Peijun Shi, 2019. "Spatial Vulnerability of Network Systems under Spatially Local Hazards," Risk Analysis, John Wiley & Sons, vol. 39(1), pages 162-179, January.
    8. Minchao Wang & Wu Zhang & Wang Ding & Dongbo Dai & Huiran Zhang & Hao Xie & Luonan Chen & Yike Guo & Jiang Xie, 2014. "Parallel Clustering Algorithm for Large-Scale Biological Data Sets," PLOS ONE, Public Library of Science, vol. 9(4), pages 1-9, April.
    9. Tinic, Murat & Sensoy, Ahmet & Demir, Muge & Nguyen, Duc Khuong, 2020. "Broker Network Connectivity and the Cross-Section of Expected Stock Returns," MPRA Paper 104719, University Library of Munich, Germany.
    10. Jorge Peña & Yannick Rochat, 2012. "Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games," PLOS ONE, Public Library of Science, vol. 7(9), pages 1-13, September.
    11. Pirvu Daniela & Barbuceanu Mircea, 2016. "Recent Contributions Of The Statistical Physics In The Research Of Banking, Stock Exchange And Foreign Exchange Markets," Annals - Economy Series, Constantin Brancusi University, Faculty of Economics, vol. 2, pages 85-92, April.
    12. Daniel M. Ringel & Bernd Skiera, 2016. "Visualizing Asymmetric Competition Among More Than 1,000 Products Using Big Search Data," Marketing Science, INFORMS, vol. 35(3), pages 511-534, May.
    13. Yu, Shuo & Alqahtani, Fayez & Tolba, Amr & Lee, Ivan & Jia, Tao & Xia, Feng, 2022. "Collaborative Team Recognition: A Core Plus Extension Structure," Journal of Informetrics, Elsevier, vol. 16(4).
    14. Shang, Jiaxing & Liu, Lianchen & Li, Xin & Xie, Feng & Wu, Cheng, 2016. "Targeted revision: A learning-based approach for incremental community detection in dynamic networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 443(C), pages 70-85.
    15. Roth, Camille, 2007. "Empiricism for descriptive social network models," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(1), pages 53-58.
    16. Christian F A Negre & Hayato Ushijima-Mwesigwa & Susan M Mniszewski, 2020. "Detecting multiple communities using quantum annealing on the D-Wave system," PLOS ONE, Public Library of Science, vol. 15(2), pages 1-14, February.
    17. Ying Song & Zhiwen Zheng & Yunmei Shi & Bo Wang, 2023. "GLOD: The Local Greedy Expansion Method for Overlapping Community Detection in Dynamic Provenance Networks," Mathematics, MDPI, vol. 11(15), pages 1-16, July.
    18. Shiau, Wen-Lung & Dwivedi, Yogesh K. & Yang, Han Suan, 2017. "Co-citation and cluster analyses of extant literature on social networks," International Journal of Information Management, Elsevier, vol. 37(5), pages 390-399.
    19. Zhang, Zhiwei & Wang, Zhenyu, 2015. "Mining overlapping and hierarchical communities in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 421(C), pages 25-33.
    20. J. Sylvan Katz & Guillermo Armando Ronda-Pupo, 2019. "Cooperation, scale-invariance and complex innovation systems: a generalization," Scientometrics, Springer;Akadémiai Kiadó, vol. 121(2), pages 1045-1065, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pcbi00:1000659. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.