Evaluation and Aggregation of Active Module Identification Algorithms
Discuss this preprint
Start a discussion What are Sciety discussions?Listed in
This article is not in any list yet, why not save it to one of your lists.Abstract
Background
High-throughput sequencing methods have generated vast amounts of genetic data for candidate gene studies. As a part of the analysis, candidate genes are often analyzed through Gene-Gene interaction (GGI) networks. These networks can become very large, necessitating efficient methods to reduce their complexity. Active Module Identification (AMI) is a common method to analyze GGI networks by identifying enriched subnetworks representing relevant biological processes. Multiple AMI algorithms have been developed for biological datasets, and a comprehensive assessment of these algorithms and a comparative analysis of their behaviors across a variety of use-cases are crucial for their appropriate applications.
Results
In this study, we use the Empirical Pipeline (EMP) to evaluate four AMI algorithms – PAPER, DOMINO, FDRnet, and HotNet2 – on their ability to produce context-specific enrichment. When testing the algorithms on four biological datasets, our results reveal that no single algorithm outperforms the others across all datasets. Moreover, the output modules are often dissimilar, suggesting that different algorithms capture complementary biological signals. Our results suggest that a comprehensive analysis requires the aggregation of outputs from multiple algorithms. We propose two methods to this end: a spectral clustering approach for module aggregation, and an algorithm that combines modules with similar network structures called Greedy Conductance-based Merging (GCM).
Conclusions
Overall, our results advance our understanding of AMI algorithms and how they should be applied. Tools and workflows developed in this study will facilitate researchers working with AMI algorithms to enhance their analyses. Our code is freely available at https://github.com/LiuJ0/AMI-Benchmark/ .
