Differential analysis of biological networks
Da Ruan, Alastair Young, Giovanni Montana

TL;DR
This paper introduces the dGHD algorithm, a scalable statistical method for detecting localized topological differences in biological networks, aiding in cancer biomarker discovery.
Contribution
The paper presents the dGHD algorithm, which uses the Generalised Hamming Distance and asymptotic normal approximation for efficient two-network comparison.
Findings
dGHD outperforms standard Hamming distance in detecting subtle differences
High sensitivity and specificity demonstrated in simulation studies
Application to ovarian cancer networks identifies potential biomarkers
Abstract
In cancer research, the comparison of gene expression or DNA methylation networks inferred from healthy controls and patients can lead to the discovery of biological pathways associated to the disease. As a cancer progresses, its signalling and control networks are subject to some degree of localised re-wiring. Being able to detect disrupted interaction patterns induced by the presence or progression of the disease can lead to the discovery of novel molecular diagnostic and prognostic signatures. Currently there is a lack of scalable statistical procedures for two-network comparisons aimed at detecting localised topological differences. We propose the dGHD algorithm, a methodology for detecting differential interaction patterns in two-network comparisons. The algorithm relies on a statistic, the Generalised Hamming Distance (GHD), for assessing the degree of topological difference…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBioinformatics and Genomic Networks · Complex Network Analysis Techniques · Gene expression and cancer classification
