ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB)Systems BiologyPeer-reviewed journal article
Differential Community Detection in Paired Biological Networks
Raghvendra MalliD, Ehsan UllahiD, Khalid B. KunjiiD, Fulvio D’AngeloiD, Halima BensmailiD, Michele CeccarelliiD
Abstract
MotivationBiological networks unravel the inherent structure of molecular interactions which can lead to discovery of driver genes and meaningful pathways especially in cancer context. Often due to gene mutations, the gene expression undergoes changes and the corresponding gene regulatory network sustains some amount of localized re-wiring. The ability to identify significant changes in the interaction patterns caused by the progression of the disease can lead to the revelation of novel relevant signatures.\n\nMethodsThe task of identifying differential sub-networks in paired biological networks (A:control,B:case) can be re-phrased as one of finding dense communities in a single noisy differential topological (DT) graph constructed by taking absolute difference between the topological graphs of A and B. In this paper, we propose a fast two-stage approach, namely Differential Community Detection (DCD), to identify differential sub-networks as differential communities in a de-noised version of the DT graph. In the first stage, we iteratively re-order the nodes of the DT graph to determine approximate block diagonals present in the DT adjacency matrix using neighbourhood information of the nodes and Jaccard similarity. In the second stage, the ordered DT adjacency matrix is traversed along the diagonal to remove all the edges associated with a node, if that node has no immediate edges within a window. We then apply community detection methods on this de-noised DT graph to discover differential sub-networks as communities.\n\nResultsOur proposed DCD approach can effectively locate differential sub-networks in several simulated paired random-geometric networks and various paired scale-free graphs with different power-law exponents. The DCD approach easily outperforms community detection methods applied on the original noisy DT graph and recent statistical techniques in simulation studies. We applied DCD method on two real datasets: a) Ovarian cancer dataset to discover differential DNA co-methylation sub-networks in patients and controls; b) Glioma cancer dataset to discover the difference between the regulatory networks of IDH-mutant and IDH-wild-type. We demonstrate the potential benefits of DCD for finding network-inferred bio-markers/pathways associated with a trait of interest.\n\nConclusionThe proposed DCD approach overcomes the limitations of previous statistical techniques and the issues associated with identifying differential sub-networks by use of community detection methods on the noisy DT graph. This is reflected in the superior performance of the DCD method with respect to various metrics like Precision, Accuracy, Kappa and Specificity. The code implementing proposed DCD method is available at https://sites.google.com/site/ raghvendramallmlresearcher/codes.
- organism: human
- assay: DNA methylation
- research focus: differential expression
- approach: statistical model
- Citations
- 12
- FWCI
- 3.05
- Field percentile
- top 10%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Detection of statistically significant network changes in complex biological networks
Raghvendra Mall, Luigi Cerulo, … Michele Ceccarelli·bioRxiv·Jun 30, 2016
- Combinatorial Detection of Conserved Alteration Patterns for Identifying Cancer Subnetworks
Ermin Hodzic, Raunak Shrestha, … S. Cenk Şahinalp·GigaSciencePeer-reviewed·Apr 1, 2019
- NetMix2: Unifying network propagation andaltered subnetworks
Uthsav Chitra, Tae Yoon Park, Benjamin J. Raphael·Lecture notes in computer sciencePeer-reviewed·Jan 1, 2022
- Large Scale and Stable Graph Differential Analysis via Multi-Layer Node Embeddings and Ranking
Panagiotis Mandros, Ian Gallagher, … John F Quackenbush·bioRxiv·Jun 16, 2024
- DDN2.0: R and Python packages for differential dependency network analysis of biological systems
- Efficient Proximal Gradient Algorithm for Inference of Differential Gene Networks
Chen Wang, Feng Gao, … Xiaodong Cai·BMC BioinformaticsPeer-reviewed·May 2, 2019