Abstract
MicroRNAs (miRNA) are endogenous non-coding RNAs, typically around 23 nucleotides in length. Many miRNAs have been founded to play crucial roles in gene regulation though post-transcriptional repression in animals. Existing studies suggest that the dysregulation of miRNA is closely associated with many human diseases. Discovering novel associations between miRNAs and diseases is essential for advancing our understanding of disease pathogenesis at molecular level. However, experimental validation is time-consuming and expensive. To address this challenge, numerous computational methods have been proposed for predicting miRNA-disease associations. Unfortunately, most existing methods face difficulties when applied to large-scale miRNA-disease complex networks. In this paper, we present a novel subgraph learning method named SGLMDA for predicting miRNA-disease associations. For miRNA-disease pairs, SGLMDA samples K-hop subgraphs from the global heterogeneous miRNA-disease graph. It then introduces a novel subgraph representation algorithm based on Graph Neural Network (GNN) for feature extraction and prediction. Extensive experiments conducted on benchmark datasets demonstrate that SGLMDA can effectively and robustly predict potential miRNA-disease associations. Compared to other state-of-the-art methods, SGLMDA achieves superior prediction performance in terms of Area Under the Curve (AUC) and Average Precision (AP) values during 5-fold Cross-Validation (5CV) on benchmark datasets such as HMDD v2.0 and HMDD v3.2. Additionally, case studies on Colon Neoplasms and Triple-Negative Breast Cancer (TNBC) further underscore the predictive power of SGLMDA.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE/ACM transactions on computational biology and bioinformatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.