4.7 Article

iGRLCDA: identifying circRNA-disease association based on graph representation learning

Journal

BRIEFINGS IN BIOINFORMATICS
Volume 23, Issue 3, Pages -

Publisher

OXFORD UNIV PRESS
DOI: 10.1093/bib/bbac083

Keywords

CircRNA; circRNA-disease association; deep learning; graph convolution network; graph factorization

Funding

  1. National Natural Science Foundation of China [61702444, 62172355]
  2. West Light Foundation of the Chinese Academy of Sciences [2018-XBQNXZB-008]
  3. Tianshan Youth-Excellent Youth [2019Q029]
  4. Qingtan Scholar Talent Project of Zaozhuang University
  5. Xinajang Young Scholars Science Foundation of China [2019D01C212]

Ask authors/readers for more resources

Researchers have discovered a novel topology of RNA transcript called circular RNA (circRNA) that competes with messenger RNA (mRNA) and long noncoding RNA in gene regulation. This finding suggests that circRNA could be associated with complex diseases, thus identifying the relationship between them would contribute to medical research. However, in vitro experiments to determine the circRNA-disease association are time-consuming and lack direction. To address this, a computational method called iGRLCDA was proposed, which utilizes graph convolution network (GCN) and graph factorization (GF) to predict circRNA-disease associations. The performance of iGRLCDA was compared to other prediction models using five-fold cross-validation, showing strong competitiveness and high accuracy.
While the technologies of ribonucleic acid-sequence (RNA-seq) and transcript assembly analysis have continued to improve, a novel topology of RNA transcript was uncovered in the last decade and is called circular RNA (circRNA). Recently, researchers have revealed that they compete with messenger RNA (mRNA) and long noncoding for combining with microRNA in gene regulation. Therefore, circRNA was assumed to be associated with complex disease and discovering the relationship between them would contribute to medical research. However, the work of identifying the association between circRNA and disease in vitro takes a long time and usually without direction. During these years, more and more associations were verified by experiments. Hence, we proposed a computational method named identifying circRNA-disease association based on graph representation learning (iGRLCDA) for the prediction of the potential association of circRNA and disease, which utilized a deep learning model of graph convolution network (GCN) and graph factorization (GF). In detail, iGRLCDA first derived the hidden feature of known associations between circRNA and disease using the Gaussian interaction profile (GIP) kernel combined with disease semantic information to form a numeric descriptor. After that, it further used the deep learning model of GCN and GF to extract hidden features from the descriptor. Finally, the random forest classifier is introduced to identify the potential circRNA-disease association. The five-fold cross-validation of iGRLCDA shows strong competitiveness in comparison with other excellent prediction models at the gold standard data and achieved an average area under the receiver operating characteristic curve of 0.9289 and an area under the precision-recall curve of 0.9377. On reviewing the prediction results from the relevant literature, 22 of the top 30 predicted circRNA-disease associations were noted in recent published papers. These exceptional results make us believe that iGRLCDA can provide reliable circRNA-disease associations for medical research and reduce the blindness of wet-lab experiments.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available