Your browser doesn't support javascript.
loading
MvGraphDTA: multi-view-based graph deep model for drug-target affinity prediction by introducing the graphs and line graphs.
Zeng, Xin; Zhong, Kai-Yang; Meng, Pei-Yan; Li, Shu-Juan; Lv, Shuang-Qing; Wen, Meng-Liang; Li, Yi.
Afiliación
  • Zeng X; College of Mathematics and Computer Science, Dali University, Dali, 671003, China.
  • Zhong KY; College of Mathematics and Computer Science, Dali University, Dali, 671003, China.
  • Meng PY; College of Mathematics and Computer Science, Dali University, Dali, 671003, China.
  • Li SJ; Yunnan Institute of Endemic Diseases Control & Prevention, Dali, 671000, China.
  • Lv SQ; Institute of Surveying and Information Engineering, West Yunnan University of Applied Science, Dali, 671000, China.
  • Wen ML; State Key Laboratory for Conservation and Utilization of Bio-Resources in Yunnan, Yunnan University, Kunming, 650000, China.
  • Li Y; College of Mathematics and Computer Science, Dali University, Dali, 671003, China. yili@dali.edu.cn.
BMC Biol ; 22(1): 182, 2024 Aug 26.
Article en En | MEDLINE | ID: mdl-39183297
ABSTRACT

BACKGROUND:

Accurately identifying drug-target affinity (DTA) plays a pivotal role in drug screening, design, and repurposing in pharmaceutical industry. It not only reduces the time, labor, and economic costs associated with biological experiments but also expedites drug development process. However, achieving the desired level of computational accuracy for DTA identification methods remains a significant challenge.

RESULTS:

We proposed a novel multi-view-based graph deep model known as MvGraphDTA for DTA prediction. MvGraphDTA employed a graph convolutional network (GCN) to extract the structural features from original graphs of drugs and targets, respectively. It went a step further by constructing line graphs with edges as vertices based on original graphs of drugs and targets. GCN was also used to extract the relationship features within their line graphs. To enhance the complementarity between the extracted features from original graphs and line graphs, MvGraphDTA fused the extracted multi-view features of drugs and targets, respectively. Finally, these fused features were concatenated and passed through a fully connected (FC) network to predict DTA.

CONCLUSIONS:

During the experiments, we performed data augmentation on all the training sets used. Experimental results showed that MvGraphDTA outperformed the competitive state-of-the-art methods on benchmark datasets for DTA prediction. Additionally, we evaluated the universality and generalization performance of MvGraphDTA on additional datasets. Experimental outcomes revealed that MvGraphDTA exhibited good universality and generalization capability, making it a reliable tool for drug-target interaction prediction.
Asunto(s)
Palabras clave

Texto completo: 1 Colección: 01-internacional Base de datos: MEDLINE Asunto principal: Aprendizaje Profundo Idioma: En Revista: BMC Biol Asunto de la revista: BIOLOGIA Año: 2024 Tipo del documento: Article País de afiliación: China Pais de publicación: Reino Unido

Texto completo: 1 Colección: 01-internacional Base de datos: MEDLINE Asunto principal: Aprendizaje Profundo Idioma: En Revista: BMC Biol Asunto de la revista: BIOLOGIA Año: 2024 Tipo del documento: Article País de afiliación: China Pais de publicación: Reino Unido