1
|
Chatterjee S, Sanjeev BS. Over-representation analysis of angiogenic factors in immunosuppressive mechanisms in neoplasms and neurological conditions during COVID-19. Microb Pathog 2023; 185:106386. [PMID: 37865274 DOI: 10.1016/j.micpath.2023.106386] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/10/2023] [Revised: 09/27/2023] [Accepted: 10/09/2023] [Indexed: 10/23/2023]
Abstract
BACKGROUND Recent studies emphasized the necessity to identify key (human) biological processes and pathways targeted by the Coronaviridae family of viruses, especially Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). Coronavirus Disease (COVID-19) caused up to 33-55 % death rates in COVID-19 patients with malignant neoplasms and Alzheimer's disease. Given this scenario, we identified biological processes and pathways involved in various diseases which are most likely affected by COVID-19. METHODS The COVID-19 DisGeNET data set (v4.0) contains the associations between various diseases and human genes known to interact with viruses from Coronaviridae family and were obtained from the IntAct Coronavirus data set annotated with DisGeNET data. We constructed the disease-gene network to identify genes that are involved in various comorbid diseased states. Communities from the disease-gene network were identified using Louvain method and functional enrichment through over-representation analysis methodology was used to discover significant biological processes and pathways shared between COVID-19 and other diseases. RESULT The COVID-19 DisGeNET data set (v4.0) comprised of 828 human genes and 10,473 diseases (including various phenotypes) that together constituted nodes in the disease-gene network. Each of the 70,210 edges connects a human gene with an associated disease. The top 10 genes linked to most number of diseases were VEGFA, BCL2, CTNNB1, ALB, COX2, AGT, HLA-A, HMOX1, FGF2 and COMT. The most vulnerable group of patients thus discovered had comorbid conditions such as carcinomas, malignant neoplasms and Alzheimer's disease. Finally, we identified 15 potentially useful biological processes and pathways for improved therapies. Vascular endothelial growth factor (VEGF) is the key mediator of angiogenesis in cancer. It is widely distributed in the brain and plays a crucial role in brain inflammation regulating the level of angiopoietins. With a degree of 1899, VEGFA was associated with maximum number of diseases in the disease-gene network. Previous studies have indicated that increased levels of VEGFA in the blood results in dyspnea, Pulmonary Edema (PE), Acute Lung Injury (ALI) and Acute Respiratory Distress Syndrome (ARDS). In case of COVID-19 patients with neoplasms and other neurological symptoms, our results indicate VEGFA as a therapeutic target for inflammation suppression. As VEGFs are known to disproportionately affect cancer patients, improving endothelial permeability and vasodilation with anti-VEGF therapy could lead to suppression of inflammation and also improve oxygenation. As an outcome of our study, we make case for clinical investigations towards anti-VEGF therapies for such comorbid conditions affected by COVID-19 for better therapeutic outcomes.
Collapse
Affiliation(s)
- S Chatterjee
- Department of Applied Sciences, Indian Institute of Information Technology, Allahabad, India.
| | - B S Sanjeev
- Department of Applied Sciences, Indian Institute of Information Technology, Allahabad, India.
| |
Collapse
|
2
|
Chatterjee S, Sanjeev BS. Community detection in Epstein-Barr virus associated carcinomas and role of tyrosine kinase in etiological mechanisms for oncogenesis. Microb Pathog 2023; 180:106115. [PMID: 37137346 DOI: 10.1016/j.micpath.2023.106115] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/12/2023] [Revised: 04/12/2023] [Accepted: 04/13/2023] [Indexed: 05/05/2023]
Abstract
BACKGROUND Epstein-Barr virus (EBV) affects more than 90% of global population. The role of the virus in causing infectious mononucleosis (IM) affecting B-cells and epithelial cells and in the development of EBV associated cancers is well documented. Investigating the associated interactions can pave way for the discovery of novel therapeutic targets for EBV associated lymphoproliferative (Burkitt's Lymphoma and Hodgkin's Lymphoma) and non-lymphoproliferative diseases (Gastric cancer and Nasopharyngeal cancer). METHODS Based on the DisGeNET (v7.0) data set, we constructed a disease-gene network to identify genes that are involved in various carcinomas, viz. Gastric cancer (GC), Nasopharyngeal cancer (NPC), Hodgkin's lymphoma (HL) and Burkitt's lymphoma (BL). We identified communities in the disease-gene network and performed functional enrichment using over-representation analysis to detect significant biological processes/pathways and the interactions between them. RESULT We identified the modular communities to explore the relation of this common causative pathogen (EBV) with different carcinomas such as GC, NPC, HL and BL. Through network analysis we identified the top 10 genes linked with EBV associated carcinomas as CASP10, BRAF, NFKBIA, IFNA2, GSTP1, CSF3, GATA3, UBR5, AXIN2 and POLE. Further, the tyrosine-protein kinase (ABL1) gene was significantly over-represented in 3 out of 9 critical biological processes, viz. in regulatory pathways in cancer, the TP53 network and the Imatinib and chronic myeloid leukemia biological processes. Consequently, the EBV pathogen appears to target critical pathways involved in cellular growth arrest/apoptosis. We make our case for BCR-ABL1 tyrosine-kinase inhibitors (TKI) for further clinical investigations in the inhibition of BCR-mediated EBV activation in carcinomas for better prognostic and therapeutic outcomes.
Collapse
Affiliation(s)
- S Chatterjee
- Department of Applied Sciences, Indian Institute of Information Technology, Allahabad, India.
| | - B S Sanjeev
- Department of Applied Sciences, Indian Institute of Information Technology, Allahabad, India.
| |
Collapse
|
3
|
Discovering Entities Similarities in Biological Networks Using a Hybrid Immune Algorithm. INFORMATICS 2023. [DOI: 10.3390/informatics10010018] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/05/2023] Open
Abstract
Disease phenotypes are generally caused by the failure of gene modules which often have similar biological roles. Through the study of biological networks, it is possible to identify the intrinsic structure of molecular interactions in order to identify the so-called “disease modules”. Community detection is an interesting and valuable approach to discovering the structure of the community in a complex network, revealing the internal organization of the nodes, and has become a leading research topic in the analysis of complex networks. This work investigates the link between biological modules and network communities in test-case biological networks that are commonly used as a reference point and which include Protein–Protein Interaction Networks, Metabolic Networks and Transcriptional Regulation Networks. In order to identify small and structurally well-defined communities in the biological context, a hybrid immune metaheuristic algorithm Hybrid-IA is proposed and compared with several metaheuristics, hyper-heuristics, and the well-known greedy algorithm Louvain, with respect to modularity maximization. Considering the limitation of modularity optimization, which can fail to identify smaller communities, the reliability of Hybrid-IA was also analyzed with respect to three well-known sensitivity analysis measures (NMI, ARI and NVI) that assess how similar the detected communities are to real ones. By inspecting all outcomes and the performed comparisons, we will see that on one hand Hybrid-IA finds slightly lower modularity values than Louvain, but outperforms all other metaheuristics, while on the other hand, it can detect communities more similar to the real ones when compared to those detected by Louvain.
Collapse
|
4
|
Liu M, Chato C, Poon AFY. From components to communities: bringing network science to clustering for molecular epidemiology. Virus Evol 2023; 9:vead026. [PMID: 37187604 PMCID: PMC10175948 DOI: 10.1093/ve/vead026] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/25/2022] [Revised: 01/30/2023] [Accepted: 04/17/2023] [Indexed: 05/17/2023] Open
Abstract
Defining clusters of epidemiologically related infections is a common problem in the surveillance of infectious disease. A popular method for generating clusters is pairwise distance clustering, which assigns pairs of sequences to the same cluster if their genetic distance falls below some threshold. The result is often represented as a network or graph of nodes. A connected component is a set of interconnected nodes in a graph that are not connected to any other node. The prevailing approach to pairwise clustering is to map clusters to the connected components of the graph on a one-to-one basis. We propose that this definition of clusters is unnecessarily rigid. For instance, the connected components can collapse into one cluster by the addition of a single sequence that bridges nodes in the respective components. Moreover, the distance thresholds typically used for viruses like HIV-1 tend to exclude a large proportion of new sequences, making it difficult to train models for predicting cluster growth. These issues may be resolved by revisiting how we define clusters from genetic distances. Community detection is a promising class of clustering methods from the field of network science. A community is a set of nodes that are more densely inter-connected relative to the number of their connections to external nodes. Thus, a connected component may be partitioned into two or more communities. Here we describe community detection methods in the context of genetic clustering for epidemiology, demonstrate how a popular method (Markov clustering) enables us to resolve variation in transmission rates within a giant connected component of HIV-1 sequences, and identify current challenges and directions for further work.
Collapse
Affiliation(s)
- Molly Liu
- Department of Pathology and Laboratory Medicine, Western University, Dental Sciences Building, Rm. 4044, London, ON N6A 5C1, Canada
| | - Connor Chato
- Department of Pathology and Laboratory Medicine, Western University, Dental Sciences Building, Rm. 4044, London, ON N6A 5C1, Canada
| | | |
Collapse
|
5
|
Xue S, Rogers LR, Zheng M, He J, Piermarocchi C, Mias GI. Applying differential network analysis to longitudinal gene expression in response to perturbations. Front Genet 2022; 13:1026487. [PMID: 36324501 PMCID: PMC9618823 DOI: 10.3389/fgene.2022.1026487] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/23/2022] [Accepted: 10/03/2022] [Indexed: 11/17/2022] Open
Abstract
Differential Network (DN) analysis is a method that has long been used to interpret changes in gene expression data and provide biological insights. The method identifies the rewiring of gene networks in response to external perturbations. Our study applies the DN method to the analysis of RNA-sequencing (RNA-seq) time series datasets. We focus on expression changes: (i) in saliva of a human subject after pneumococcal vaccination (PPSV23) and (ii) in primary B cells treated ex vivo with a monoclonal antibody drug (Rituximab). The DN method enabled us to identify the activation of biological pathways consistent with the mechanisms of action of the PPSV23 vaccine and target pathways of Rituximab. The community detection algorithm on the DN revealed clusters of genes characterized by collective temporal behavior. All saliva and some B cell DN communities showed characteristic time signatures, outlining a chronological order in pathway activation in response to the perturbation. Moreover, we identified early and delayed responses within network modules in the saliva dataset and three temporal patterns in the B cell data.
Collapse
Affiliation(s)
- Shuyue Xue
- Department of Physics and Astronomy, Michigan State University, East Lansing, MI, United States
- Institute for Quantitative Health Science and Engineering, Michigan State University, East Lansing, MI, United States
| | - Lavida R.K. Rogers
- Department of Biological Sciences, University of the Virgin Islands, St Thomas, US Virgin Islands
| | - Minzhang Zheng
- Institute for Quantitative Health Science and Engineering, Michigan State University, East Lansing, MI, United States
| | - Jin He
- Department of Biochemistry and Molecular Biology, Michigan State University, East Lansing, MI, United States
| | - Carlo Piermarocchi
- Department of Physics and Astronomy, Michigan State University, East Lansing, MI, United States
| | - George I. Mias
- Department of Physics and Astronomy, Michigan State University, East Lansing, MI, United States
- Institute for Quantitative Health Science and Engineering, Michigan State University, East Lansing, MI, United States
- Department of Biochemistry and Molecular Biology, Michigan State University, East Lansing, MI, United States
| |
Collapse
|
6
|
Learning software requirements syntax: An unsupervised approach to recognize templates. Knowl Based Syst 2022. [DOI: 10.1016/j.knosys.2022.108933] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/23/2022]
|
7
|
Abstract
Networks can be used to model various aspects of our lives as well as relations among many real-world entities and objects. To detect a community structure in a network can enhance our understanding of the characteristics, properties, and inner workings of the network. Therefore, there has been significant research on detecting and evaluating community structures in networks. Many fields, including social sciences, biology, engineering, computer science, and applied mathematics, have developed various methods for analyzing and detecting community structures in networks. In this paper, a new community detection algorithm, which repeats the process of dividing a community into two smaller communities by finding a minimum cut, is proposed. The proposed algorithm is applied to some example network data and shows fairly good community detection results with comparable modularity Q values.
Collapse
|
8
|
Apollonio N, Franciosa PG, Santoni D. A novel method for assessing and measuring homophily in networks through second-order statistics. Sci Rep 2022; 12:9757. [PMID: 35697749 PMCID: PMC9192693 DOI: 10.1038/s41598-022-12710-7] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/11/2021] [Accepted: 05/06/2022] [Indexed: 11/17/2022] Open
Abstract
We present a new method for assessing and measuring homophily in networks whose nodes have categorical attributes, namely when the nodes of networks come partitioned into classes (colors). We probe this method in two different classes of networks: (i) protein-protein interaction (PPI) networks, where nodes correspond to proteins, partitioned according to their functional role, and edges represent functional interactions between proteins (ii) Pokec on-line social network, where nodes correspond to users, partitioned according to their age, and edges respresent friendship between users.Similarly to other classical and well consolidated approaches, our method compares the relative edge density of the subgraphs induced by each class with the corresponding expected relative edge density under a null model. The novelty of our approach consists in prescribing an endogenous null model, namely, the sample space of the null model is built on the input network itself. This allows us to give exact explicit expression for the [Formula: see text]-score of the relative edge density of each class as well as other related statistics. The [Formula: see text]-scores directly quantify the statistical significance of the observed homophily via Čebyšëv inequality. The expression of each [Formula: see text]-score is entered by the network structure through basic combinatorial invariant such as the number of subgraphs with two spanning edges. Each [Formula: see text]-score is computed in [Formula: see text] time for a network with n nodes and m edges. This leads to an overall efficient computational method for assesing homophily. We complement the analysis of homophily/heterophily by considering [Formula: see text]-scores of the number of isolated nodes in the subgraphs induced by each class, that are computed in O(nm) time. Theoretical results are then exploited to show that, as expected, both the analyzed network classes are significantly homophilic with respect to the considered node properties.
Collapse
Affiliation(s)
- Nicola Apollonio
- Istituto per le Applicazioni del Calcolo "Mauro Picone", Consiglio Nazionale delle Ricerche, Via dei Taurini 19, 00185, Rome, Italy
| | - Paolo G Franciosa
- Dipartimento di Scienze Statistiche, Università di Roma "La Sapienza", piazzale Aldo Moro 5, 00185, Rome, Italy.
| | - Daniele Santoni
- Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti", Consiglio Nazionale delle Ricerche, Via dei Taurini 19, 00185, Rome, Italy
| |
Collapse
|
9
|
Bees colonies for terrorist communities evolution detection. SOCIAL NETWORK ANALYSIS AND MINING 2021. [DOI: 10.1007/s13278-021-00835-y] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/19/2022]
|
10
|
A deep learning approach for semi-supervised community detection in Online Social Networks. Knowl Based Syst 2021. [DOI: 10.1016/j.knosys.2021.107345] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/02/2023]
|
11
|
A survey about community detection over On-line Social and Heterogeneous Information Networks. Knowl Based Syst 2021. [DOI: 10.1016/j.knosys.2021.107112] [Citation(s) in RCA: 15] [Impact Index Per Article: 5.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/02/2023]
|
12
|
An approach based on mixed hierarchical clustering and optimization for graph analysis in social media network: toward globally hierarchical community structure. Knowl Inf Syst 2019. [DOI: 10.1007/s10115-019-01329-2] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/27/2022]
|
13
|
Alcalá-Corona SA, de Anda-Jáuregui G, Espinal-Enríquez J, Hernández-Lemus E. Network Modularity in Breast Cancer Molecular Subtypes. Front Physiol 2017; 8:915. [PMID: 29204123 PMCID: PMC5699328 DOI: 10.3389/fphys.2017.00915] [Citation(s) in RCA: 25] [Impact Index Per Article: 3.6] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/30/2017] [Accepted: 10/30/2017] [Indexed: 01/20/2023] Open
Abstract
Breast cancer is a heterogeneous and complex disease, a clear manifestation of this is its classification into different molecular subtypes. On the other hand, gene transcriptional networks may exhibit different modular structures that can be related to known biological processes. Thus, modular structures in transcriptional networks may be seen as manifestations of regulatory structures that tightly controls biological processes. In this work, we identify modular structures on gene transcriptional networks previously inferred from microarray data of molecular subtypes of breast cancer: luminal A, luminal B, basal, and HER2-enriched. We analyzed the modules (communities) found in each network to identify particular biological functions (described in the Gene Ontology database) associated to them. We further explored these modules and their associated functions to identify common and unique features that could allow a better level of description of breast cancer, particularly in the basal-like subtype, the most aggressive and poor prognosis manifestation. Our findings related to the immune system and a decrease in cell death-related processes in basal subtype could help to understand it and design strategies for its treatment.
Collapse
Affiliation(s)
- Sergio Antonio Alcalá-Corona
- Computational Genomics, National Institute of Genomic Medicine, México City, Mexico.,Centro de Ciencias de la Complejidad, Universidad Nacional Autónoma de México, México City, Mexico
| | - Guillermo de Anda-Jáuregui
- Computational Genomics, National Institute of Genomic Medicine, México City, Mexico.,School of Medicine and Health Sciences, University of North Dakota, Grand Forks, ND, United States
| | - Jesús Espinal-Enríquez
- Computational Genomics, National Institute of Genomic Medicine, México City, Mexico.,Centro de Ciencias de la Complejidad, Universidad Nacional Autónoma de México, México City, Mexico
| | - Enrique Hernández-Lemus
- Computational Genomics, National Institute of Genomic Medicine, México City, Mexico.,Centro de Ciencias de la Complejidad, Universidad Nacional Autónoma de México, México City, Mexico
| |
Collapse
|
14
|
Zhang J, Cao J. Finding Common Modules in a Time-Varying Network with Application to the Drosophila Melanogaster Gene Regulation Network. J Am Stat Assoc 2017. [DOI: 10.1080/01621459.2016.1260465] [Citation(s) in RCA: 8] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/20/2022]
Affiliation(s)
- Jingfei Zhang
- Department of Management Science, School of Business Administration, University of Miami, Miami, FL
| | - Jiguo Cao
- Department of Statistics and Actuarial Science, Simon Fraser University, Burnaby, BC, Canada
| |
Collapse
|
15
|
Alcalá-Corona SA, Velázquez-Caldelas TE, Espinal-Enríquez J, Hernández-Lemus E. Community Structure Reveals Biologically Functional Modules in MEF2C Transcriptional Regulatory Network. Front Physiol 2016; 7:184. [PMID: 27252657 PMCID: PMC4878384 DOI: 10.3389/fphys.2016.00184] [Citation(s) in RCA: 15] [Impact Index Per Article: 1.9] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/09/2016] [Accepted: 05/06/2016] [Indexed: 01/04/2023] Open
Abstract
Gene regulatory networks are useful to understand the activity behind the complex mechanisms in transcriptional regulation. A main goal in contemporary biology is using such networks to understand the systemic regulation of gene expression. In this work, we carried out a systematic study of a transcriptional regulatory network derived from a comprehensive selection of all potential transcription factor interactions downstream from MEF2C, a human transcription factor master regulator. By analyzing the connectivity structure of such network, we were able to find different biologically functional processes and specific biochemical pathways statistically enriched in communities of genes into the network, such processes are related to cell signaling, cell cycle and metabolism. In this way we further support the hypothesis that structural properties of biological networks encode an important part of their functional behavior in eukaryotic cells.
Collapse
Affiliation(s)
- Sergio A Alcalá-Corona
- Computational Genomics Department, National Institute of Genomic MedicineMexico City, Mexico; Complexity in Systems Biology, Center for Complexity Sciences, Universidad Nacional Autónoma de MéxicoMexico City, Mexico
| | | | - Jesús Espinal-Enríquez
- Computational Genomics Department, National Institute of Genomic MedicineMexico City, Mexico; Complexity in Systems Biology, Center for Complexity Sciences, Universidad Nacional Autónoma de MéxicoMexico City, Mexico
| | - Enrique Hernández-Lemus
- Computational Genomics Department, National Institute of Genomic MedicineMexico City, Mexico; Complexity in Systems Biology, Center for Complexity Sciences, Universidad Nacional Autónoma de MéxicoMexico City, Mexico
| |
Collapse
|
16
|
Stopczynski A, Sekara V, Sapiezynski P, Cuttone A, Madsen MM, Larsen JE, Lehmann S. Measuring large-scale social networks with high resolution. PLoS One 2014; 9:e95978. [PMID: 24770359 PMCID: PMC4000208 DOI: 10.1371/journal.pone.0095978] [Citation(s) in RCA: 130] [Impact Index Per Article: 13.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/15/2014] [Accepted: 04/02/2014] [Indexed: 11/29/2022] Open
Abstract
This paper describes the deployment of a large-scale study designed to measure human interactions across a variety of communication channels, with high temporal resolution and spanning multiple years-the Copenhagen Networks Study. Specifically, we collect data on face-to-face interactions, telecommunication, social networks, location, and background information (personality, demographics, health, politics) for a densely connected population of 1000 individuals, using state-of-the-art smartphones as social sensors. Here we provide an overview of the related work and describe the motivation and research agenda driving the study. Additionally, the paper details the data-types measured, and the technical infrastructure in terms of both backend and phone software, as well as an outline of the deployment procedures. We document the participant privacy procedures and their underlying principles. The paper is concluded with early results from data analysis, illustrating the importance of multi-channel high-resolution approach to data collection.
Collapse
Affiliation(s)
| | - Vedran Sekara
- DTU Compute, Technical University of Denmark, Kgs. Lyngby, Denmark
| | | | - Andrea Cuttone
- DTU Compute, Technical University of Denmark, Kgs. Lyngby, Denmark
| | - Mette My Madsen
- Department of Anthropology, University of Copenhagen, Copenhagen, Denmark
| | - Jakob Eg Larsen
- DTU Compute, Technical University of Denmark, Kgs. Lyngby, Denmark
| | - Sune Lehmann
- DTU Compute, Technical University of Denmark, Kgs. Lyngby, Denmark
- The Niels Bohr Institute, University of Copenhagen, Copenhagen, Denmark
| |
Collapse
|
17
|
Dorrian H, Borresen J, Amos M. Community structure and multi-modal oscillations in complex networks. PLoS One 2013; 8:e75569. [PMID: 24130720 PMCID: PMC3794975 DOI: 10.1371/journal.pone.0075569] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/26/2013] [Accepted: 08/14/2013] [Indexed: 11/18/2022] Open
Abstract
In many types of network, the relationship between structure and function is of great significance. We are particularly interested in community structures, which arise in a wide variety of domains. We apply a simple oscillator model to networks with community structures and show that waves of regular oscillation are caused by synchronised clusters of nodes. Moreover, we show that such global oscillations may arise as a direct result of network topology. We also observe that additional modes of oscillation (as detected through frequency analysis) occur in networks with additional levels of topological hierarchy and that such modes may be directly related to network structure. We apply the method in two specific domains (metabolic networks and metropolitan transport) demonstrating the robustness of our results when applied to real world systems. We conclude that (where the distribution of oscillator frequencies and the interactions between them are known to be unimodal) our observations may be applicable to the detection of underlying community structure in networks, shedding further light on the general relationship between structure and function in complex systems.
Collapse
Affiliation(s)
- Henry Dorrian
- School of Computing, Mathematics and Digital Technology, Manchester Metropolitan University, Manchester, United Kingdom
| | - Jon Borresen
- School of Computing, Mathematics and Digital Technology, Manchester Metropolitan University, Manchester, United Kingdom
- * E-mail:
| | - Martyn Amos
- School of Computing, Mathematics and Digital Technology, Manchester Metropolitan University, Manchester, United Kingdom
| |
Collapse
|
18
|
Nair V, Dua S. Folksonomy-based ad hoc community detection in online social networks. SOCIAL NETWORK ANALYSIS AND MINING 2012. [DOI: 10.1007/s13278-012-0081-9] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/28/2022]
|
19
|
Abstract
Many networks of scientific interest naturally decompose into clusters or communities with comparatively fewer external than internal links; however, current Bayesian models of network communities do not exert this intuitive notion of communities. We formulate a nonparametric Bayesian model for community detection consistent with an intuitive definition of communities and present a Markov chain Monte Carlo procedure for inferring the community structure. A Matlab toolbox with the proposed inference procedure is available for download. On synthetic and real networks, our model detects communities consistent with ground truth, and on real networks, it outperforms existing approaches in predicting missing links. This suggests that community structure is an important structural property of networks that should be explicitly modeled.
Collapse
Affiliation(s)
- Morten Mørup
- Section for Cognitive Systems, Technical University of Denmark, 2800 Lyngby, Denmark
| | - Mikkel N. Schmidt
- Section for Cognitive Systems, Technical University of Denmark, 2800 Lyngby, Denmark
| |
Collapse
|
20
|
Expert P, Evans TS, Blondel VD, Lambiotte R. Uncovering space-independent communities in spatial networks. Proc Natl Acad Sci U S A 2011; 108:7663-8. [PMID: 21518910 PMCID: PMC3093492 DOI: 10.1073/pnas.1018962108] [Citation(s) in RCA: 242] [Impact Index Per Article: 18.6] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022] Open
Abstract
Many complex systems are organized in the form of a network embedded in space. Important examples include the physical Internet infrastructure, road networks, flight connections, brain functional networks, and social networks. The effect of space on network topology has recently come under the spotlight because of the emergence of pervasive technologies based on geolocalization, which constantly fill databases with people's movements and thus reveal their trajectories and spatial behavior. Extracting patterns and regularities from the resulting massive amount of human mobility data requires the development of appropriate tools for uncovering information in spatially embedded networks. In contrast with most works that tend to apply standard network metrics to any type of network, we argue in this paper for a careful treatment of the constraints imposed by space on network topology. In particular, we focus on the problem of community detection and propose a modularity function adapted to spatial networks. We show that it is possible to factor out the effect of space in order to reveal more clearly hidden structural similarities between the nodes. Methods are tested on a large mobile phone network and computer-generated benchmarks where the effect of space has been incorporated.
Collapse
Affiliation(s)
- Paul Expert
- Complexity and Networks Group, Imperial College London, London SW7 2AZ, United Kingdom
- Blackett Laboratory, Prince Consort Road, Imperial College London, London SW7 2AZ, United Kingdom
| | - Tim S. Evans
- Blackett Laboratory, Prince Consort Road, Imperial College London, London SW7 2AZ, United Kingdom
| | - Vincent D. Blondel
- Massachusetts Institute of Technology, Laboratory for Information and Decision Systems, 77 Massachusetts Avenue, Cambridge, MA 02139
- Institute of Information and Communication Technologies, Electronics and Applied Mathematics, Université catholique de Louvain, Avenue Georges Lemaitre 4, B-1348 Louvain-la-Neuve, Belgium; and
| | - Renaud Lambiotte
- Complexity and Networks Group, Imperial College London, London SW7 2AZ, United Kingdom
- Naxys, Facultés Universitaires Notre-Dame de la Paix, B-5000 Namur, Belgium
| |
Collapse
|
21
|
Estrada E. Community detection based on network communicability. CHAOS (WOODBURY, N.Y.) 2011; 21:016103. [PMID: 21456845 DOI: 10.1063/1.3552144] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/30/2023]
Abstract
We propose a new method for detecting communities based on the concept of communicability between nodes in a complex network. This method, designated as N-ComBa K-means, uses a normalized version of the adjacency matrix to build the communicability matrix and then applies K-means clustering to find the communities in a graph. We analyze how this method performs for some pathological cases found in the analysis of the detection limit of communities and propose some possible solutions on the basis of the analysis of the ratio of local to global densities in graphs. We use four different quality criteria for detecting the best clustering and compare the new approach with the Girvan-Newman algorithm for the analysis of two "classical" networks: karate club and bottlenose dolphins. Finally, we analyze the more challenging case of homogeneous networks with community structure, for which the Girvan-Newman completely fails in detecting any clustering. The N-ComBa K-means approach performs very well in these situations and we applied it to detect the community structure in an international trade network of miscellaneous manufactures of metal having these characteristics. Some final remarks about the general philosophy of community detection are also discussed.
Collapse
Affiliation(s)
- Ernesto Estrada
- Department of Mathematics and Statistics, Department of Physics, SUPA and Institute of Complex Systems, University of Strathclyde, Glasgow, UK.
| |
Collapse
|
22
|
Kahle JJ, Gulbahce N, Shaw CA, Lim J, Hill DE, Barabási AL, Zoghbi HY. Comparison of an expanded ataxia interactome with patient medical records reveals a relationship between macular degeneration and ataxia. Hum Mol Genet 2010; 20:510-27. [PMID: 21078624 PMCID: PMC3016911 DOI: 10.1093/hmg/ddq496] [Citation(s) in RCA: 39] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/25/2022] Open
Abstract
Spinocerebellar ataxias 6 and 7 (SCA6 and SCA7) are neurodegenerative disorders caused by expansion of CAG repeats encoding polyglutamine (polyQ) tracts in CACNA1A, the alpha1A subunit of the P/Q-type calcium channel, and ataxin-7 (ATXN7), a component of a chromatin-remodeling complex, respectively. We hypothesized that finding new protein partners for ATXN7 and CACNA1A would provide insight into the biology of their respective diseases and their relationship to other ataxia-causing proteins. We identified 118 protein interactions for CACNA1A and ATXN7 linking them to other ataxia-causing proteins and the ataxia network. To begin to understand the biological relevance of these protein interactions within the ataxia network, we used OMIM to identify diseases associated with the expanded ataxia network. We then used Medicare patient records to determine if any of these diseases co-occur with hereditary ataxia. We found that patients with ataxia are at 3.03-fold greater risk of these diseases than Medicare patients overall. One of the diseases comorbid with ataxia is macular degeneration (MD). The ataxia network is significantly (P= 7.37 × 10−5) enriched for proteins that interact with known MD-causing proteins, forming a MD subnetwork. We found that at least two of the proteins in the MD subnetwork have altered expression in the retina of Ataxin-7266Q/+ mice suggesting an in vivo functional relationship with ATXN7. Together these data reveal novel protein interactions and suggest potential pathways that can contribute to the pathophysiology of ataxia, MD, and diseases comorbid with ataxia.
Collapse
Affiliation(s)
- Juliette J Kahle
- Department of Cellular and Human Genetics, Baylor College of Medicine, Houston, TX 77030, USA
| | | | | | | | | | | | | |
Collapse
|
23
|
Hartsperger ML, Blöchl F, Stümpflen V, Theis FJ. Structuring heterogeneous biological information using fuzzy clustering of k-partite graphs. BMC Bioinformatics 2010; 11:522. [PMID: 20961418 PMCID: PMC3247861 DOI: 10.1186/1471-2105-11-522] [Citation(s) in RCA: 16] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/12/2010] [Accepted: 10/20/2010] [Indexed: 11/25/2022] Open
Abstract
Background Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the interpretation of these networks. While most research focuses on the unipartite or bipartite case, we address the more general but common situation of k-partite graphs. These graphs contain k different node types and links are only allowed between nodes of different types. In order to reveal their structural organization and describe the contained information in a more coarse-grained fashion, we ask how to detect clusters within each node type. Results Since entities in biological networks regularly have more than one function and hence participate in more than one cluster, we developed a k-partite graph partitioning algorithm that allows for overlapping (fuzzy) clusters. It determines for each node a degree of membership to each cluster. Moreover, the algorithm estimates a weighted k-partite graph that connects the extracted clusters. Our method is fast and efficient, mimicking the multiplicative update rules commonly employed in algorithms for non-negative matrix factorization. It facilitates the decomposition of networks on a chosen scale and therefore allows for analysis and interpretation of structures on various resolution levels. Applying our algorithm to a tripartite disease-gene-protein complex network, we were able to structure this graph on a large scale into clusters that are functionally correlated and biologically meaningful. Locally, smaller clusters enabled reclassification or annotation of the clusters' elements. We exemplified this for the transcription factor MECP2. Conclusions In order to cope with the overwhelming amount of information available from biomedical literature, we need to tackle the challenge of finding structures in large networks with nodes of multiple types. To this end, we presented a novel fuzzy k-partite graph partitioning algorithm that allows the decomposition of these objects in a comprehensive fashion. We validated our approach both on artificial and real-world data. It is readily applicable to any further problem.
Collapse
Affiliation(s)
- Mara L Hartsperger
- Institute of Bioinformatics and Systems Biology (MIPS), Helmholtz Zentrum München - German Research Center for Environmental Health, Ingolstädter Landstr. 1, 85764 Neuherberg, Germany.
| | | | | | | |
Collapse
|
24
|
Liu X, Murata T. An Efficient Algorithm for Optimizing Bipartite Modularity in Bipartite Networks. JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS 2010. [DOI: 10.20965/jaciii.2010.p0408] [Citation(s) in RCA: 26] [Impact Index Per Article: 1.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
Modularity evaluates the quality of a division of network nodes into communities, and modularity optimization is the most widely used class of methods for detecting communities in networks. In bipartite networks, there are correspondingly bipartite modularity and bipartite modularity optimization. LPAb, a very fast label propagation algorithm based on bipartite modularity optimization, tends to become stuck in poor local maxima, yielding suboptimal community divisions with low bipartite modularity. We therefore propose LPAb+, a hybrid algorithm combining modified LPAb, or LPAb’, and MSG, a multistep greedy agglomerative algorithm, with the objective of using MSG to drive LPAb out of local maxima. We use four commonly used real-world bipartite networks to demonstrate LPAb+ capability in detecting community divisions with remarkably higher bipartite modularity than LPAb. We show how LPAb+ outperforms other bipartite modularity optimization algorithms, without compromising speed.
Collapse
|
25
|
Herrera M, Roberts DC, Gulbahce N. Mapping the evolution of scientific fields. PLoS One 2010; 5:e10355. [PMID: 20463949 PMCID: PMC2864309 DOI: 10.1371/journal.pone.0010355] [Citation(s) in RCA: 29] [Impact Index Per Article: 2.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/15/2009] [Accepted: 03/16/2010] [Indexed: 11/26/2022] Open
Abstract
Despite the apparent cross-disciplinary interactions among scientific fields, a formal description of their evolution is lacking. Here we describe a novel approach to study the dynamics and evolution of scientific fields using a network-based analysis. We build an idea network consisting of American Physical Society Physics and Astronomy Classification Scheme (PACS) numbers as nodes representing scientific concepts. Two PACS numbers are linked if there exist publications that reference them simultaneously. We locate scientific fields using a community finding algorithm, and describe the time evolution of these fields over the course of 1985-2006. The communities we identify map to known scientific fields, and their age depends on their size and activity. We expect our approach to quantifying the evolution of ideas to be relevant for making predictions about the future of science and thus help to guide its development.
Collapse
Affiliation(s)
- Mark Herrera
- Department of Physics and Institute for Research in Electronics and Applied Physics, University of Maryland, College Park, Maryland, United States of America
| | - David C. Roberts
- Theoretical Division and Center for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, New Mexico, United States of America
| | - Natali Gulbahce
- Department of Physics and Center for Complex Networks Research, Northeastern University, Boston, Massachusetts, United States of America
- Center for Cancer Systems Biology, Dana Farber Cancer Institute, Boston, Massachusetts, United States of America
| |
Collapse
|
26
|
Quantification of spatial parameters in 3D cellular constructs using graph theory. J Biomed Biotechnol 2009; 2009:928286. [PMID: 19920859 PMCID: PMC2775910 DOI: 10.1155/2009/928286] [Citation(s) in RCA: 10] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/16/2008] [Revised: 06/22/2009] [Accepted: 08/16/2009] [Indexed: 11/23/2022] Open
Abstract
Multispectral three-dimensional (3D) imaging provides spatial information for biological structures that cannot be measured by traditional methods. This work presents a method of tracking 3D biological structures to quantify changes over time using graph theory. Cell-graphs were generated based on the pairwise distances, in 3D-Euclidean space, between nuclei during collagen I gel compaction. From these graphs quantitative features are extracted that measure both the global topography and the frequently occurring local structures of the “tissue constructs.” The feature trends can be controlled by manipulating compaction through cell density and are significant when compared to random graphs. This work presents a novel methodology to track a simple 3D biological event and quantitatively analyze the underlying structural change. Further application of this method will allow for the study of complex biological problems that require the quantification of temporal-spatial information in 3D and establish a new paradigm in understanding structure-function relationships.
Collapse
|
27
|
Ostilli M, Mendes JFF. Communication and correlation among communities. PHYSICAL REVIEW. E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS 2009; 80:011142. [PMID: 19658688 DOI: 10.1103/physreve.80.011142] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 03/03/2009] [Indexed: 05/28/2023]
Abstract
Given a network and a partition in communities, we consider the issues "how communities influence each other" and "when two given communities do communicate." Specifically, we address these questions in the context of small-world networks, where an arbitrary quenched graph is given and long-range connections are randomly added. We prove that, among the communities, a superposition principle applies and gives rise to a natural generalization of the effective field theory already presented by M. Ostilli and J. F. F. Mendes [Phys. Rev. E 78, 031102 (2008)] (n=1), which here (n>1) consists in a sort of effective TAP (Thouless, Anderson, and Palmer) equations in which each community plays the role of a microscopic spin. The relative susceptibilities derived from these equations calculated at finite or zero temperature, where the method provides an effective percolation theory, give us the answers to the above issues. Unlike the case n=1, asymmetries among the communities may lead, via the TAP-like structure of the equations, to many metastable states whose number, in the case of negative shortcuts among the communities, may grow exponentially fast with n. As examples we consider the n Viana-Bray communities model and the n one-dimensional small-world communities model. Despite being the simplest ones, the relevance of these models in network theory, as, e.g., in social networks, is crucial and no analytic solution were known until now. Connections between percolation and the fractal dimension of a network are also discussed. Finally, as an inverse problem, we show how, from the relative susceptibilities, a natural and efficient method to detect the community structure of a generic network arises.
Collapse
Affiliation(s)
- M Ostilli
- Departamento de Física, Universidade de Aveiro, 3810-193 Aveiro, Portugal
| | | |
Collapse
|