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

Identification of Important Nodes in Directed Biological Networks: A Network Motif Approach

Author

Listed:
  • Pei Wang
  • Jinhu Lü
  • Xinghuo Yu

Abstract

Identification of important nodes in complex networks has attracted an increasing attention over the last decade. Various measures have been proposed to characterize the importance of nodes in complex networks, such as the degree, betweenness and PageRank. Different measures consider different aspects of complex networks. Although there are numerous results reported on undirected complex networks, few results have been reported on directed biological networks. Based on network motifs and principal component analysis (PCA), this paper aims at introducing a new measure to characterize node importance in directed biological networks. Investigations on five real-world biological networks indicate that the proposed method can robustly identify actually important nodes in different networks, such as finding command interneurons, global regulators and non-hub but evolutionary conserved actually important nodes in biological networks. Receiver Operating Characteristic (ROC) curves for the five networks indicate remarkable prediction accuracy of the proposed measure. The proposed index provides an alternative complex network metric. Potential implications of the related investigations include identifying network control and regulation targets, biological networks modeling and analysis, as well as networked medicine.

Suggested Citation

  • Pei Wang & Jinhu Lü & Xinghuo Yu, 2014. "Identification of Important Nodes in Directed Biological Networks: A Network Motif Approach," PLOS ONE, Public Library of Science, vol. 9(8), pages 1-15, August.
  • Handle: RePEc:plo:pone00:0106132
    DOI: 10.1371/journal.pone.0106132
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0106132
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0106132&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0106132?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. Réka Albert & Hawoong Jeong & Albert-László Barabási, 2000. "Error and attack tolerance of complex networks," Nature, Nature, vol. 406(6794), pages 378-382, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Satyaki Roy & Ahmad F. Al Musawi & Preetam Ghosh, 2023. "Inferring links in directed complex networks through feed forward loop motifs," Palgrave Communications, Palgrave Macmillan, vol. 10(1), pages 1-13, December.
    2. Hongping Wang & Yajuan Zhang & Zili Zhang & Sankaran Mahadevan & Yong Deng, 2015. "PhysarumSpreader: A New Bio-Inspired Methodology for Identifying Influential Spreaders in Complex Networks," PLOS ONE, Public Library of Science, vol. 10(12), pages 1-21, December.

    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. Sanjeev Goyal & Fernando Vega-Redondo, 2000. "Learning, Network Formation and Coordination," Econometric Society World Congress 2000 Contributed Papers 0113, Econometric Society.
    2. Quayle, A.P. & Siddiqui, A.S. & Jones, S.J.M., 2006. "Preferential network perturbation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 371(2), pages 823-840.
    3. Chen, Lei & Yue, Dong & Dou, Chunxia, 2019. "Optimization on vulnerability analysis and redundancy protection in interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1216-1226.
    4. Bálint Mészáros & István Simon & Zsuzsanna Dosztányi, 2009. "Prediction of Protein Binding Regions in Disordered Proteins," PLOS Computational Biology, Public Library of Science, vol. 5(5), pages 1-18, May.
    5. Irina Rish & Guillermo Cecchi & Benjamin Thyreau & Bertrand Thirion & Marion Plaze & Marie Laure Paillere-Martinot & Catherine Martelli & Jean-Luc Martinot & Jean-Baptiste Poline, 2013. "Schizophrenia as a Network Disease: Disruption of Emergent Brain Function in Patients with Auditory Hallucinations," PLOS ONE, Public Library of Science, vol. 8(1), pages 1-15, January.
    6. Wang, Zhuoyang & Chen, Guo & Hill, David J. & Dong, Zhao Yang, 2016. "A power flow based model for the analysis of vulnerability in power networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 460(C), pages 105-115.
    7. Bellingeri, Michele & Cassi, Davide & Vincenzi, Simone, 2014. "Efficiency of attack strategies on complex model and real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 414(C), pages 174-180.
    8. Bech, Morten L. & Atalay, Enghin, 2010. "The topology of the federal funds market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(22), pages 5223-5246.
    9. Valentini, Luca & Perugini, Diego & Poli, Giampiero, 2007. "The “small-world” topology of rock fracture networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 377(1), pages 323-328.
    10. Enrico Zio & Giovanni Sansavini, 2011. "Component Criticality in Failure Cascade Processes of Network Systems," Risk Analysis, John Wiley & Sons, vol. 31(8), pages 1196-1210, August.
    11. Ryan M. Hynes & Bernardo S. Buarque & Ronald B. Davies & Dieter F. Kogler, 2020. "Hops, Skip & a Jump - The Regional Uniqueness of Beer Styles," Working Papers 202013, Geary Institute, University College Dublin.
    12. Pi, Xiaochen & Tang, Longkun & Chen, Xiangzhong, 2021. "A directed weighted scale-free network model with an adaptive evolution mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    13. Lenore Newman & Ann Dale, 2007. "Homophily and Agency: Creating Effective Sustainable Development Networks," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 9(1), pages 79-90, February.
    14. Aybike Ulusan & Ozlem Ergun, 2018. "Restoration of services in disrupted infrastructure systems: A network science approach," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-28, February.
    15. Yang, Hyeonchae & Jung, Woo-Sung, 2016. "Structural efficiency to manipulate public research institution networks," Technological Forecasting and Social Change, Elsevier, vol. 110(C), pages 21-32.
    16. Deng, Ye & Wu, Jun & Tan, Yue-jin, 2016. "Optimal attack strategy of complex networks based on tabu search," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 442(C), pages 74-81.
    17. Blagus, Neli & Šubelj, Lovro & Bajec, Marko, 2012. "Self-similar scaling of density in complex real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2794-2802.
    18. Alexander Shiroky & Andrey Kalashnikov, 2021. "Mathematical Problems of Managing the Risks of Complex Systems under Targeted Attacks with Known Structures," Mathematics, MDPI, vol. 9(19), pages 1-11, October.
    19. Anand, Kartik & Gai, Prasanna & Marsili, Matteo, 2012. "Rollover risk, network structure and systemic financial crises," Journal of Economic Dynamics and Control, Elsevier, vol. 36(8), pages 1088-1100.
    20. Zhao, Jiuhua & Liu, Qipeng & Wang, Lin & Wang, Xiaofan, 2017. "Competitive seeds-selection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 467(C), pages 240-248.

    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:pone00:0106132. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.