NetComm: a network analysis tool based on communicability. Motivation: Set-based network similarity metrics are increasingly used to productively analyze genome-wide data. Conventional approaches, such as mean shortest path and clique-based metrics, have been useful but are not well suited to all applications. Computational scientists in other disciplines have developed communicability as a complementary metric. Network communicability considers all paths of all lengths between two network members. Given the success of previous network analyses of protein–protein interactions, we applied the concepts of network communicability to this problem. Here we show that our communicability implementation has advantages over traditional approaches. Overall, analyses suggest network communicability has considerable utility in analysis of large-scale biological networks. Availability and implementation: We provide our method as an R package for use in both human protein–protein interaction network analyses and analyses of arbitrary networks along with a tutorial at http://www.shawlab.org/NetComm/.
References in zbMATH (referenced in 1 article )
Showing result 1 of 1.
- Alalwan, Najlaa; Arenas, Alex; Estrada, Ernesto: “Melting” of complex networks. A mathematical model of complex networks resilience to external stress (2019)