Significant Subgraph Detection in Multi-omics Networks for Disease Pathway Identification

• Published in: Frontiers in big data 2022-06, Vol.5, p.894632-894632
• Main Authors: Abdel-Hafiz, Mohamed, Najafi, Mesbah, Helmi, Shahab, Pratte, Katherine A, Zhuang, Yonghua, Liu, Weixuan, Kechris, Katerina J, Bowler, Russell P, Lange, Leslie, Banaei-Kashani, Farnoush
• Format: Article
• Language: English
• Subjects: Big Data; graph clustering; Louvain; multi-omics graph; PageRank; subgraph detection
• ISSN: 2624-909X; 2624-909X
• DOI: 10.3389/fdata.2022.894632

Chronic obstructive pulmonary disease (COPD) is one of the leading causes of death in the United States. COPD represents one of many areas of research where identifying complex pathways and networks of interacting biomarkers is an important avenue toward studying disease progression and potentially discovering cures. Recently, sparse multiple canonical correlation network analysis (SmCCNet) was developed to identify complex relationships between omics associated with a disease phenotype, such as lung function. SmCCNet uses two sets of omics datasets and an associated output phenotypes to generate a multi-omics graph, which can then be used to explore relationships between omics in the context of a disease. Detecting within this multi-omics network, i.e., subgraphs which exhibit high correlation to a disease phenotype and high inter-connectivity, can help clinicians identify complex biological relationships involved in disease progression. The current approach to identifying significant subgraphs relies on hierarchical clustering, which can be used to inform clinicians about important pathways involved in the disease or phenotype of interest. The reliance on a hierarchical clustering approach can hinder subgraph quality by biasing toward finding more compact subgraphs and removing larger significant subgraphs. This study aims to introduce new significant subgraph detection techniques. In particular, we introduce two subgraph detection methods, dubbed Correlated PageRank and Correlated Louvain, by extending the Personalized PageRank Clustering and Louvain algorithms, as well as a hybrid approach combining the two proposed methods, and compare them to the hierarchical method currently in use. The proposed methods show significant improvement in the quality of the subgraphs produced when compared to the current state of the art.