{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T15:34:49Z","timestamp":1774107289923,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T00:00:00Z","timestamp":1696464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T00:00:00Z","timestamp":1696464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Zhejiang Lab","award":["No. 2022PI0AC01"],"award-info":[{"award-number":["No. 2022PI0AC01"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Accurately predicting the binding affinity between proteins and ligands is crucial for drug discovery. Recent advances in graph neural networks (GNNs) have made significant progress in learning representations of protein-ligand complexes to estimate binding affinities. To improve the performance of GNNs, there frequently needs to look into protein-ligand complexes from geometric perspectives. While the \u201coff-the-shelf\u201d GNNs could incorporate some basic geometric structures of molecules, such as distances and angles, through modeling the complexes as homophilic graphs, these solutions seldom take into account the higher-level geometric attributes like curvatures and homology, and also heterophilic interactions.To address these limitations, we introduce the Curvature-based Adaptive Graph Neural Network (CurvAGN). This GNN comprises two components: a curvature block and an adaptive attention guided neural block (AGN). The curvature block encodes multiscale curvature informaton, then the AGN, based on an adaptive graph attention mechanism, incorporates geometry structure including angle, distance, and multiscale curvature, long-range molecular interactions, and heterophily of the graph into the protein-ligand complex representation. We demonstrate the superiority of our proposed model through experiments conducted on the PDBbind-V2016 core dataset.<\/jats:p>","DOI":"10.1186\/s12859-023-05503-w","type":"journal-article","created":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T09:01:41Z","timestamp":1696496501000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["CurvAGN: Curvature-based Adaptive Graph Neural Networks for Predicting Protein-Ligand Binding Affinity"],"prefix":"10.1186","volume":"24","author":[{"given":"Jianqiu","family":"Wu","sequence":"first","affiliation":[]},{"given":"Hongyang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Minhao","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Haoyi","family":"Xiong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,5]]},"reference":[{"key":"5503_CR1","doi-asserted-by":"crossref","unstructured":"Liu X, Huitao F, Jie W, Kelin X. Persistent spectral hypergraph-based machine learning (PSH-ML) for protein-ligand binding affinity prediction. Brief Bioinform. 2021;22(5)","DOI":"10.1093\/bib\/bbab127"},{"key":"5503_CR2","doi-asserted-by":"crossref","unstructured":"Li S, Zhou J, Xu T, Huang L, Wang F, Xiong H, Huang W, Dou D, Xiong H. Structure-aware interactive graph neural networks for the prediction of protein-ligand binding affinity. In: Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining; 2021. p. 975\u2013985","DOI":"10.1145\/3447548.3467311"},{"issue":"15","key":"5503_CR3","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1002\/jcc.23905","volume":"36","author":"WJ Allen","year":"2015","unstructured":"Allen WJ, Balius TE, Mukherjee S, Brozell SR, Moustakas DT, Lang PT, Case DA, Kuntz ID, Rizzo RC. Dock 6: impact of new features and current docking performance. J Comput Chem. 2015;36(15):1132\u201356.","journal-title":"J Comput Chem"},{"issue":"4","key":"5503_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1021\/jm020406h","volume":"46","author":"AN Jain","year":"2003","unstructured":"Jain AN. Surflex: fully automatic flexible molecular docking using a molecular similarity-based search engine. J Med Chem. 2003;46(4):499\u2013511.","journal-title":"J Med Chem"},{"issue":"2","key":"5503_CR5","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1002\/jcc.21334","volume":"31","author":"A Vina","year":"2010","unstructured":"Vina A. Improving the speed and accuracy of docking with a new scoring function, efficient optimization, and multithreading trott, oleg; olson, arthur j. J Comput Chem. 2010;31(2):455\u201361.","journal-title":"J Comput Chem"},{"key":"5503_CR6","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1016\/j.csbj.2022.02.004","volume":"20","author":"DD Wang","year":"2022","unstructured":"Wang DD, Chan M-T. Protein-ligand binding affinity prediction based on profiles of intermolecular contacts. Comput Struct Biotechnol J. 2022;20:1088\u201396.","journal-title":"Comput Struct Biotechnol J"},{"issue":"2","key":"5503_CR7","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1021\/ci100369f","volume":"51","author":"SL Kinnings","year":"2011","unstructured":"Kinnings SL, Liu N, Tonge PJ, Jackson RM, Xie L, Bourne PE. A machine learning-based method to improve docking scoring functions and its application to drug repurposing. J Chem Inf Model. 2011;51(2):408\u201319.","journal-title":"J Chem Inf Model"},{"issue":"9","key":"5503_CR8","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1093\/bioinformatics\/btq112","volume":"26","author":"PJ Ballester","year":"2010","unstructured":"Ballester PJ, Mitchell JB. A machine learning approach to predicting protein-ligand binding affinity with applications to molecular docking. Bioinformatics. 2010;26(9):1169\u201375.","journal-title":"Bioinformatics"},{"key":"5503_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100379","volume":"40","author":"S Dong","year":"2021","unstructured":"Dong S, Wang P, Abbas K. A survey on deep learning and its applications. Comput Sci Rev. 2021;40: 100379.","journal-title":"Comput Sci Rev"},{"issue":"4","key":"5503_CR10","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1021\/acs.jcim.6b00740","volume":"57","author":"M Ragoza","year":"2017","unstructured":"Ragoza M, Hochuli J, Idrobo E, Sunseri J, Koes DR. Protein-ligand scoring with convolutional neural networks. J Chem Inf Model. 2017;57(4):942\u201357.","journal-title":"J Chem Inf Model"},{"issue":"21","key":"5503_CR11","doi-asserted-by":"publisher","first-page":"3666","DOI":"10.1093\/bioinformatics\/bty374","volume":"34","author":"MM Stepniewska-Dziubinska","year":"2018","unstructured":"Stepniewska-Dziubinska MM, Zielenkiewicz P, Siedlecki P. Development and evaluation of a deep learning model for protein-ligand binding affinity prediction. Bioinformatics. 2018;34(21):3666\u201374.","journal-title":"Bioinformatics"},{"key":"5503_CR12","unstructured":"Wallach, I., Dzamba, M., Heifets, A. Atomnet: a deep convolutional neural network for bioactivity prediction in structure-based drug discovery. 2015 arXiv preprint\u00a0arXiv:1510.02855"},{"issue":"9","key":"5503_CR13","doi-asserted-by":"publisher","first-page":"3981","DOI":"10.1021\/acs.jcim.9b00387","volume":"59","author":"J Lim","year":"2019","unstructured":"Lim J, Ryu S, Park K, Choe YJ, Ham J, Kim WY. Predicting drug-target interaction using a novel graph neural network with 3D structure-embedded graph representation. J Chem Inf Model. 2019;59(9):3981\u20138.","journal-title":"J Chem Inf Model"},{"issue":"3","key":"5503_CR14","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1093\/bib\/bbz042","volume":"21","author":"M Sun","year":"2019","unstructured":"Sun M, Zhao S, Gilvary C, Elemento O, Zhou J, Wang F. Graph convolutional networks for computational drug development and discovery. Brief Bioinform. 2019;21(3):919\u201335. https:\/\/doi.org\/10.1093\/bib\/bbz042.","journal-title":"Brief Bioinform"},{"issue":"24","key":"5503_CR15","doi-asserted-by":"publisher","first-page":"18209","DOI":"10.1021\/acs.jmedchem.1c01830","volume":"64","author":"D Jiang","year":"2021","unstructured":"Jiang D, Hsieh C-Y, Wu Z, Kang Y, Wang J, Wang E, Liao B, Shen C, Xu L, Wu J, Cao D, Hou T. Interactiongraphnet: a novel and efficient deep graph representation learning framework for accurate protein-ligand interaction predictions. J Med Chem. 2021;64(24):18209\u201332. https:\/\/doi.org\/10.1021\/acs.jmedchem.1c01830.","journal-title":"J Med Chem"},{"issue":"24","key":"5503_CR16","doi-asserted-by":"publisher","first-page":"18209","DOI":"10.1021\/acs.jmedchem.1c01830","volume":"64","author":"D Jiang","year":"2021","unstructured":"Jiang D, Hsieh C-Y, Wu Z, Kang Y, Wang J, Wang E, Liao B, Shen C, Xu L, Wu J. Interactiongraphnet: a novel and efficient deep graph representation learning framework for accurate protein-ligand interaction predictions. J Med Chem. 2021;64(24):18209\u201332.","journal-title":"J Med Chem"},{"key":"5503_CR17","doi-asserted-by":"crossref","unstructured":"Danel T, Spurek P, Tabor J, Smieja M, Struski L, Slowik A, Maziarka L. Spatial graph convolutional networks. In: Neural information processing: 27th international conference, ICONIP 2020, Bangkok, Thailand, November 18\u201322, 2020, Proceedings, Part V. Springer; 2020. p. 668\u201375.","DOI":"10.1007\/978-3-030-63823-8_76"},{"issue":"11","key":"5503_CR18","doi-asserted-by":"publisher","first-page":"7946","DOI":"10.1021\/acs.jmedchem.2c00487","volume":"65","author":"M Volkov","year":"2022","unstructured":"Volkov M, Turk J-A, Drizard N, Martin N, Hoffmann B, Gaston-Mathe Y, Rognan D. On the frustration to predict binding affinities from protein-ligand structures with deep neural networks. J Med Chem. 2022;65(11):7946\u201358.","journal-title":"J Med Chem"},{"key":"5503_CR19","unstructured":"Gasteiger J, Gro\u00df J, G\u00fcnnemann S. Directional message passing for molecular graphs. In: International conference on learning representations 2019"},{"key":"5503_CR20","volume-title":"Molecular modelling: principles and applications","author":"AR Leach","year":"2001","unstructured":"Leach AR. Molecular modelling: principles and applications. London: Pearson Education; 2001."},{"issue":"12","key":"5503_CR21","doi-asserted-by":"publisher","first-page":"2710","DOI":"10.1021\/ja9738539","volume":"120","author":"V Helms","year":"1998","unstructured":"Helms V, Wade RC. Computational alchemy to calculate absolute protein- ligand binding free energy. J Am Chem Soc. 1998;120(12):2710\u20133.","journal-title":"J Am Chem Soc"},{"issue":"12","key":"5503_CR22","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1093\/bioinformatics\/btu104","volume":"30","author":"Y Cao","year":"2014","unstructured":"Cao Y, Li L. Improved protein-ligand binding affinity prediction by using a curvature-dependent surface-area model. Bioinformatics. 2014;30(12):1674\u201380.","journal-title":"Bioinformatics"},{"issue":"6","key":"5503_CR23","doi-asserted-by":"publisher","first-page":"793","DOI":"10.4310\/MRL.1996.v3.n6.a8","volume":"3","author":"FR Chung","year":"1996","unstructured":"Chung FR, Yau S-T. Logarithmic Harnack inequalities. Math Res Lett. 1996;3(6):793\u2013812.","journal-title":"Math Res Lett"},{"issue":"3","key":"5503_CR24","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00454-002-0743-x","volume":"29","author":"R Forman","year":"2003","unstructured":"Forman R. Bochner\u2019s method for cell complexes and combinatorial RICCI curvature. Discret Comput Geom. 2003;29(3):323\u201374.","journal-title":"Discret Comput Geom"},{"key":"5503_CR25","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.ins.2021.12.077","volume":"592","author":"H Li","year":"2022","unstructured":"Li H, Cao J, Zhu J, Liu Y, Zhu Q, Wu G. Curvature graph neural network. Inf Sci. 2022;592:50\u201366.","journal-title":"Inf Sci"},{"key":"5503_CR26","unstructured":"Ye Z, Liu KS, Ma T, Gao J, Chen C. Curvature graph network. In: International conference on learning representations 2019"},{"key":"5503_CR27","unstructured":"Wee J, Xia K. Ollivier persistent RICCI curvature (OPRC) based molecular representation for drug design; 2020; arXiv preprint\u00a0arXiv:2011.10281"},{"issue":"1","key":"5503_CR28","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1186\/s12859-022-04655-5","volume":"23","author":"L Yu","year":"2022","unstructured":"Yu L, Qiu W, Lin W, Cheng X, Xiao X, Dai J. Hgdti: predicting drug-target interaction by using information aggregation based on heterogeneous graph neural network. BMC Bioinform. 2022;23(1):126.","journal-title":"BMC Bioinform"},{"issue":"8","key":"5503_CR29","doi-asserted-by":"publisher","first-page":"2020","DOI":"10.1021\/acs.jpclett.2c03906","volume":"14","author":"Z Yang","year":"2023","unstructured":"Yang Z, Zhong W, Lv Q, Dong T, Yu-Chian Chen C. Geometric interaction graph neural network for predicting protein-ligand binding affinities from 3d structures (GIGN). J Phys Chem Lett. 2023;14(8):2020\u201333.","journal-title":"J Phys Chem Lett"},{"key":"5503_CR30","doi-asserted-by":"crossref","unstructured":"Yang T, Wang Y, Yue Z, Yang Y, Tong Y, Bai J. Graph pointer neural networks. In: Proceedings of the AAAI conference on artificial intelligence, vol 36; 2022. p. 8832\u20138839","DOI":"10.1609\/aaai.v36i8.20864"},{"key":"5503_CR31","doi-asserted-by":"crossref","unstructured":"Sun J, Zhang L, Zhao S, Yang Y. Improving your graph neural networks: a high-frequency booster; 2022 arXiv preprint  arXiv:2210.08251","DOI":"10.1109\/ICDMW58026.2022.00102"},{"key":"5503_CR32","doi-asserted-by":"crossref","unstructured":"Bo D, Wang X, Shi C, Shen H. Beyond low-frequency information in graph convolutional networks. In: Proceedings of the AAAI conference on artificial intelligence, vol. 35; 2021. p. 3950\u20133957","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"5503_CR33","unstructured":"Maziarka L, Danel T, Mucha S, Rataj K, Tabor J, Jastrz kebski Sl. Molecule attention transformer. 2020 arXiv preprint  arXiv:2002.08264"},{"key":"5503_CR34","doi-asserted-by":"crossref","unstructured":"Song Y, Zheng S, Niu Z, Fu ZH, Lu Y, Yang Y. Communicative representation learning on attributed molecular graphs. In: IJCAI, vol. 2020; 2020, p. 2831\u20132838","DOI":"10.24963\/ijcai.2020\/392"},{"key":"5503_CR35","unstructured":"Yi Y, Wan X, Zhao K, Ou-Yang L, Zhao P. Predicting protein-ligand binding affinity with equivariant line graph network. 2022; arXiv preprint  arXiv:2210.16098"},{"key":"5503_CR36","volume-title":"Riemannian geometry and geometric analysis","author":"J Jost","year":"2008","unstructured":"Jost J, Jost J. Riemannian geometry and geometric analysis, vol. 42005. Berlin: Springer; 2008."},{"key":"5503_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58002-9","volume-title":"Modern approaches to discrete curvature","author":"L Najman","year":"2017","unstructured":"Najman L, Romon P. Modern approaches to discrete curvature. Berlin: Springer; 2017."},{"issue":"11","key":"5503_CR38","first-page":"643","volume":"345","author":"Y Ollivier","year":"2007","unstructured":"Ollivier Y. Ricci curvature of metric spaces. CR Math. 2007;345(11):643\u20136.","journal-title":"CR Math"},{"key":"5503_CR39","doi-asserted-by":"crossref","unstructured":"Lott J, Villani C. Ricci curvature for metric-measure spaces via optimal transport. Ann Math. 2009;03\u2013991","DOI":"10.4007\/annals.2009.169.903"},{"issue":"3","key":"5503_CR40","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1016\/j.jfa.2008.11.001","volume":"256","author":"Y Ollivier","year":"2009","unstructured":"Ollivier Y. Ricci curvature of Markov chains on metric spaces. J Funct Anal. 2009;256(3):810\u201364.","journal-title":"J Funct Anal"},{"issue":"9","key":"5503_CR41","doi-asserted-by":"publisher","first-page":"2944","DOI":"10.1016\/j.jfa.2009.01.029","volume":"256","author":"A-I Bonciocat","year":"2009","unstructured":"Bonciocat A-I, Sturm K-T. Mass transportation and rough curvature bounds for discrete spaces. J Funct Anal. 2009;256(9):2944\u201366.","journal-title":"J Funct Anal"},{"issue":"4","key":"5503_CR42","first-page":"605","volume":"63","author":"Y Lin","year":"2011","unstructured":"Lin Y, Lu L, Yau S-T. Ricci curvature of graphs. Tohoku Math J Second Ser. 2011;63(4):605\u201327.","journal-title":"Tohoku Math J Second Ser"},{"issue":"6","key":"5503_CR43","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1093\/bib\/bbab136","volume":"22","author":"J Wee","year":"2021","unstructured":"Wee J, Xia K. Forman persistent RICCI curvature (FPRC)-based machine learning models for protein-ligand binding affinity prediction. Brief Bioinform. 2021;22(6):136.","journal-title":"Brief Bioinform"},{"issue":"6","key":"5503_CR44","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2016\/06\/063206","volume":"2016","author":"R Sreejith","year":"2016","unstructured":"Sreejith R, Mohanraj K, Jost J, Saucan E, Samal A. Forman curvature for complex networks. J Stat Mech Theory Exp. 2016;2016(6): 063206.","journal-title":"J Stat Mech Theory Exp"},{"key":"5503_CR45","doi-asserted-by":"crossref","unstructured":"Pandit S, Chau DH, Wang S, Faloutsos C. Netprobe: a fast and scalable system for fraud detection in online auction networks. In: Proceedings of the 16th international conference on world wide web; 2007, p. 01\u2013210","DOI":"10.1145\/1242572.1242600"},{"key":"5503_CR46","doi-asserted-by":"crossref","unstructured":"Du L, Shi X, Fu Q, Ma X, Liu H, Han S, Zhang D. GBK-GNN: Gated bi-kernel graph neural networks for modeling both homophily and heterophily. In: Proceedings of the ACM web conference 2022; 2022. p. 1550\u20131558","DOI":"10.1145\/3485447.3512201"},{"key":"5503_CR47","doi-asserted-by":"crossref","unstructured":"Fang Z, Xu L, Song G, Long Q, Zhang Y. Polarized graph neural networks. In: Proceedings of the ACM web conference 2022; 2022. p. 1404\u20131413","DOI":"10.1145\/3485447.3512187"},{"key":"5503_CR48","first-page":"10654","volume":"34","author":"D Jin","year":"2021","unstructured":"Jin D, Yu Z, Huo C, Wang R, Wang X, He D, Han J. Universal graph convolutional networks. Adv Neural Inf Process Syst. 2021;34:10654\u201364.","journal-title":"Adv Neural Inf Process Syst"},{"key":"5503_CR49","doi-asserted-by":"crossref","unstructured":"Li Y, Lin B, Luo B, Gui N. Graph representation learning beyond node and homophily. IEEE Trans Knowl Data Eng. 2022;","DOI":"10.1109\/TKDE.2022.3146270"},{"key":"5503_CR50","unstructured":"Abu-El-Haija S, Perozzi B, Kapoor A, Alipourfard N, Lerman K, Harutyunyan H, Ver Steeg G, Galstyan A. Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing. In: International conference on machine learning. PMLR; 2019. p. 21\u201329"},{"key":"5503_CR51","doi-asserted-by":"crossref","unstructured":"Bi W, Du L, Fu Q, Wang Y, Han S, Zhang D. MM-GNN: Mix-moment graph neural network towards modeling neighborhood feature distribution. In: Proceedings of the 16th ACM international conference on web search and data mining, 2023. p. 132\u2013140","DOI":"10.1145\/3539597.3570457"},{"key":"5503_CR52","doi-asserted-by":"crossref","unstructured":"Dong Y, Ding K, Jalaian B, Ji S, Li J. Adagnn: Graph neural networks with adaptive frequency response filter. In: Proceedings of the 30th ACM international conference on information & knowledge management, 2021. p. 392\u2013401","DOI":"10.1145\/3459637.3482226"},{"key":"5503_CR53","doi-asserted-by":"crossref","unstructured":"Li S, Kim D, Wang, Q. Beyond low-pass filters: adaptive feature propagation on graphs. In: Machine learning and knowledge discovery in databases. research track: European conference, ECML PKDD 2021, Bilbao, Spain, September 13\u201317, 2021, Proceedings, Part II 21. Springer; 2021. p. 450\u2013465","DOI":"10.1007\/978-3-030-86520-7_28"},{"key":"5503_CR54","unstructured":"Pei H, Wei, B, Chang KCC, Lei Y, Yang B. Geom-GCN: geometric graph convolutional networks. 2020;arXiv preprint  arXiv:2002.05287"},{"issue":"14","key":"5503_CR55","doi-asserted-by":"publisher","first-page":"15956","DOI":"10.1021\/acsomega.9b01997","volume":"4","author":"L Zheng","year":"2019","unstructured":"Zheng L, Fan J, Mu Y. Onionnet: a multiple-layer intermolecular-contact-based convolutional neural network for protein-ligand binding affinity prediction. ACS Omega. 2019;4(14):15956\u201365.","journal-title":"ACS Omega"},{"issue":"8","key":"5503_CR56","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1093\/bioinformatics\/btaa921","volume":"37","author":"T Nguyen","year":"2021","unstructured":"Nguyen T, Le H, Quinn TP, Nguyen T, Le TD, Venkatesh S. Graphdta: predicting drug-target binding affinity with graph neural networks. Bioinformatics. 2021;37(8):1140\u20137.","journal-title":"Bioinformatics"},{"issue":"5","key":"5503_CR57","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1021\/jm980536j","volume":"42","author":"I Muegge","year":"1999","unstructured":"Muegge I, Martin YC. A general and fast scoring function for protein- ligand interactions: a simplified potential approach. J Med Chem. 1999;42(5):791\u2013804.","journal-title":"J Med Chem"},{"issue":"1","key":"5503_CR58","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1093\/bib\/bbac562","volume":"24","author":"Y He","year":"2022","unstructured":"He Y, Yang Y, Su X, Zhao B, Xiong S, Hu L. Incorporating higher order network structures to improve miRNA disease association prediction based on functional modularity. Brief Bioinform. 2022;24(1):562.","journal-title":"Brief Bioinform"},{"key":"5503_CR59","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2023.3239949","author":"BW Zhao","year":"2023","unstructured":"Zhao BW, Wang L, Hu PW, Wong L, Su XR, Wang BQ, You ZH, Hu L. Fusing higher and lower-order biological information for drug repositioning via graph representation learning. IEEE Trans Emerg Top Comput. 2023. https:\/\/doi.org\/10.1109\/TETC.2023.3239949.","journal-title":"IEEE Trans Emerg Top Comput"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-023-05503-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-023-05503-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-023-05503-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T11:06:39Z","timestamp":1700478399000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-023-05503-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,5]]},"references-count":59,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["5503"],"URL":"https:\/\/doi.org\/10.1186\/s12859-023-05503-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3141023\/v1","asserted-by":"object"}]},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,5]]},"assertion":[{"value":"5 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Code can be found from this link\n                      \n                      .","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code available"}},{"value":"No competing interest is declared.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}],"article-number":"378"}}