Toward heterogeneous information fusion: bipartite graph convolutional networks for in silico drug repurposing
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
Motivation: Mining drug–disease association and related interactions are essential for developing in silico drug repurposing (DR) methods and understanding underlying biological mechanisms. Recently, large-scale biological databases are increasingly available for pharmaceutical research, allowing for deep characterization for molecular informatics and drug discovery. However, DR is challenging due to the molecular heterogeneity of disease and diverse drug–disease associations. Importantly, the complexity of molecular target interactions, such as protein–protein interaction (PPI), remains to be elucidated. DR thus requires deep exploration of a multimodal biological network in an integrative context. Results: In this study, we propose BiFusion, a bipartite graph convolution network model for DR through heterogeneous information fusion. Our approach combines insights of multiscale pharmaceutical information by constructing a multirelational graph of drug–protein, disease–protein and PPIs. Especially, our model introduces protein nodes as a bridge for message passing among diverse biological domains, which provides insights into utilizing PPI for improved DR assessment. Unlike conventional graph convolution networks always assuming the same node attributes in a global graph, our approach models interdomain information fusion with bipartite graph convolution operation. We offered an exploratory analysis for finding novel drug–disease associations. Extensive experiments showed that our approach achieved improved performance than multiple baselines for DR analysis. Availability and implementation: Source code and preprocessed datasets are at: https://github.com/zcwang0702/BiFusion.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005605 · Cited by 9,582
Weininger, D. (1988) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci00057a005 · Cited by 7,436 · cited 1×
“We also mapped drugs to PubChem (Kim et al., 2019) with compound ID to get their chemical structure information represented by simplified molecular-input line-entry system (SMILES) string (Weininger, 1988).”
MethodPiñero, J., Bravo, À., Queralt-Rosinach, N., Gutiérrez-Sacristán, A., Deu-Pons, J., Centeno, E., García-García, J., Sanz, F., & Furlong, L. I. (2017) · Nucleic Acids Research · doi:10.1093/nar/gkw943 · Cited by 2,680
Molecular graph convolutions: moving beyond fingerprints
Kearnes, S., McCloskey, K., Berndl, M., Pande, V., & Riley, P. (2016) · Journal of Computer-Aided Molecular Design · doi:10.1007/s10822-016-9938-8 · Cited by 1,631
Uncovering disease-disease relationships through the incomplete interactome
Menche, J., Sharma, A., Kitsak, M., Ghiassian, S. D., Vidal, M., Loscalzo, J., & Barabási, A.-L. (2015) · Science · doi:10.1126/science.1257601 · Cited by 1,546
Modeling polypharmacy side effects with graph convolutional networks
Zitnik, M., Agrawal, M., & Leskovec, J. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty294 · Cited by 1,501
A new method to measure the semantic similarity of GO terms
Wang, J. Z., Du, Z., Payattakool, R., Yu, P. S., & Chen, C.-F. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm087 · Cited by 1,377
A rapid and robust method for single cell chromatin accessibility profiling
Chen, X., Miragaia, R. J., Natarajan, K. N., & Teichmann, S. A. (2018) · Nature Communications · doi:10.1038/s41467-018-07771-0 · Cited by 1,147
Small molecules, big targets: drug discovery faces the protein–protein interaction challenge
Scott, D. E., Bayly, A. R., Abell, C., & Skidmore, J. (2016) · Nature Reviews Drug Discovery · doi:10.1038/nrd.2016.29 · Cited by 1,137
Network-based in silico drug efficacy screening
Guney, E., Menche, J., Vidal, M., & Barábasi, A.-L. (2016) · Nature Communications · doi:10.1038/ncomms10331 · Cited by 625
Cited by
Artificial intelligence to deep learning: machine intelligence approach for drug discovery
Gupta, R., Srivastava, D., Sahu, M., Tiwari, S., Ambasta, R. K., & Kumar, P. (2021) · Molecular Diversity · doi:10.1007/s11030-021-10217-3 · Cited by 1,473
“The results demonstrated that BiFusion achieved improved performance than multiple baselines for drug repurposing [295].”
BackgroundMethodIntegration strategies of multi-omics data for machine learning analysis
Picard, M., Scott-Boyer, M.-P., Bodein, A., Périn, O., & Droit, A. (2021) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2021.06.030 · Cited by 696
Utilizing graph machine learning within drug discovery and development
Gaudelet, T., Day, B., Jamasb, A. R., Soman, J., Regep, C., Liu, G., Hayter, J. B. R., Vickers, R., Roberts, C., Tang, J., et al. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbab159 · Cited by 313
Wang, H., Lin, K., Zhang, Q., Shi, J., Song, X., Wu, J., Zhao, C., & He, K. (2024) · Bioinformatics · doi:10.1093/bioinformatics/btae159 · Cited by 30
“2018, Zhou et al .”
Metadata
- Authors
- Wang, Z., Zhou, M., & Arnold, C.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2020-07-01
- Volume
- 36
- Issue
- Supplement_1
- Pages
- i525-i533
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W3042221936
- Cited by
- 90
- References
- 14
- FWCI
- 6.07
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.