Yang Mengyun, Huang Lan, Xu Yunpei, Lu Chengqian, Wang Jianxin
The Hunan Provincial Key Lab of Bioinformatics, School of Computer Science and Engineering, Central South University, Changsha 410083, China.
School of Science, Shaoyang University, Shaoyang 422000, China.
Bioinformatics. 2021 Apr 1;36(22-23):5456-5464. doi: 10.1093/bioinformatics/btaa1024.
Emerging evidence presents that traditional drug discovery experiment is time-consuming and high costs. Computational drug repositioning plays a critical role in saving time and resources for drug research and discovery. Therefore, developing more accurate and efficient approaches is imperative. Heterogeneous graph inference is a classical method in computational drug repositioning, which not only has high convergence precision, but also has fast convergence speed. However, the method has not fully considered the sparsity of heterogeneous association network. In addition, rough similarity measure can reduce the performance in identifying drug-associated indications.
In this article, we propose a heterogeneous graph inference with matrix completion (HGIMC) method to predict potential indications for approved and novel drugs. First, we use a bounded matrix completion (BMC) model to prefill a part of the missing entries in original drug-disease association matrix. This step can add more positive and formative drug-disease edges between drug network and disease network. Second, Gaussian radial basis function (GRB) is employed to improve the drug and disease similarities since the performance of heterogeneous graph inference more relies on similarity measures. Next, based on the updated drug-disease associations and new similarity measures of drug and disease, we construct a novel heterogeneous drug-disease network. Finally, HGIMC utilizes the heterogeneous network to infer the scores of unknown association pairs, and then recommend the promising indications for drugs. To evaluate the performance of our method, HGIMC is compared with five state-of-the-art approaches of drug repositioning in the 10-fold cross-validation and de novo tests. As the numerical results shown, HGIMC not only achieves a better prediction performance but also has an excellent computation efficiency. In addition, cases studies also confirm the effectiveness of our method in practical application.
The HGIMC software and data are freely available at https://github.com/BioinformaticsCSU/HGIMC, https://hub.docker.com/repository/docker/yangmy84/hgimc and http://doi.org/10.5281/zenodo.4285640.
Supplementary data are available at Bioinformatics online.
新出现的证据表明,传统的药物发现实验既耗时又成本高昂。计算药物重新定位在节省药物研究和发现的时间和资源方面发挥着关键作用。因此,开发更准确、高效的方法势在必行。异构图推理是计算药物重新定位中的一种经典方法,它不仅具有较高的收敛精度,而且收敛速度快。然而,该方法尚未充分考虑异质关联网络的稀疏性。此外,粗略的相似性度量会降低识别药物相关适应症的性能。
在本文中,我们提出了一种带矩阵补全的异构图推理(HGIMC)方法来预测已批准药物和新型药物的潜在适应症。首先,我们使用有界矩阵补全(BMC)模型来预填充原始药物 - 疾病关联矩阵中一部分缺失的条目。这一步骤可以在药物网络和疾病网络之间添加更多正向且有建设性的药物 - 疾病边。其次,由于异构图推理的性能更多地依赖于相似性度量,因此采用高斯径向基函数(GRB)来提高药物和疾病的相似性。接下来,基于更新后的药物 - 疾病关联以及药物和疾病的新相似性度量,我们构建了一个新颖的异质药物 - 疾病网络。最后,HGIMC利用该异质网络推断未知关联对的分数,然后为药物推荐有前景的适应症。为了评估我们方法的性能,在10折交叉验证和从头测试中,将HGIMC与五种最先进的药物重新定位方法进行了比较。如数值结果所示,HGIMC不仅实现了更好的预测性能,而且具有出色的计算效率。此外,案例研究也证实了我们的方法在实际应用中的有效性。
补充数据可在《生物信息学》在线获取。