{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T10:19:53Z","timestamp":1783937993763,"version":"3.55.0"},"reference-count":59,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2021,1,22]],"date-time":"2021-01-22T00:00:00Z","timestamp":1611273600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"Nanyang Technological University Startup","award":["M4081842"],"award-info":[{"award-number":["M4081842"]}]},{"name":"Singapore Ministry of Education Academic Research","award":["RG31\/18"],"award-info":[{"award-number":["RG31\/18"]}]},{"name":"Singapore Ministry of Education Academic Research","award":["RG109\/19"],"award-info":[{"award-number":["RG109\/19"]}]},{"name":"Singapore Ministry of Education Academic Research","award":["MOE2018-T2-1-033"],"award-info":[{"award-number":["MOE2018-T2-1-033"]}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871284"],"award-info":[{"award-number":["11871284"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971144"],"award-info":[{"award-number":["11971144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Artificial intelligence (AI) based drug design has demonstrated great potential to fundamentally change the pharmaceutical industries. Currently, a key issue in AI-based drug design is efficient transferable molecular descriptors or fingerprints. Here, we present hypergraph-based molecular topological representation, hypergraph-based (weighted) persistent cohomology (HPC\/HWPC) and HPC\/HWPC-based molecular fingerprints for machine learning models in drug design. Molecular structures and their atomic interactions are highly complicated and pose great challenges for efficient mathematical representations. We develop the first hypergraph-based topological framework to characterize detailed molecular structures and interactions at atomic level. Inspired by the elegant path complex model, hypergraph-based embedded homology and persistent homology have been proposed recently. Based on them, we construct HPC\/HWPC, and use them to generate molecular descriptors for learning models in protein\u2013ligand binding affinity prediction, one of the key step in drug design. Our models are tested on three most commonly-used databases, including PDBbind-v2007, PDBbind-v2013 and PDBbind-v2016, and outperform all existing machine learning models with traditional molecular descriptors. Our HPC\/HWPC models have demonstrated great potential in AI-based drug design.<\/jats:p>","DOI":"10.1093\/bib\/bbaa411","type":"journal-article","created":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T16:59:08Z","timestamp":1608051548000},"source":"Crossref","is-referenced-by-count":44,"title":["Hypergraph-based persistent cohomology (HPC) for molecular representations in drug design"],"prefix":"10.1093","volume":"22","author":[{"given":"Xiang","family":"Liu","sequence":"first","affiliation":[{"name":"Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, 637371, Singapore"},{"name":"School of Mathematical Science and LPMC, Nankai University, 300071, Tianjin, China"},{"name":"Center for Topology and Geometry Based Technology, Hebei Normal University, 050024, Hebei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangjun","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mathematical Science and LPMC, Nankai University, 300071, Tianjin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"Wu","sequence":"additional","affiliation":[{"name":"Center for Topology and Geometry Based Technology, Hebei Normal University, 050024, Hebei, China"},{"name":"School of Mathematical Sciences, Hebei Normal University, 050024, Hebei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kelin","family":"Xia","sequence":"additional","affiliation":[{"name":"Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, 637371, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2021,1,22]]},"reference":[{"key":"2021090907254473900_ref1","first-page":"604","article-title":"AI-powered drug discovery captures pharma interest","volume":"35","author":"Smalley","year":"2017","journal-title":"Nature"},{"issue":"7707","key":"2021090907254473900_ref2","doi-asserted-by":"crossref","first-page":"S55","DOI":"10.1038\/d41586-018-05267-x","article-title":"Computer-calculated compounds","volume":"557","author":"Fleming","year":"2018","journal-title":"Nature"},{"issue":"3","key":"2021090907254473900_ref3","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.drudis.2018.11.014","article-title":"Artificial intelligence in drug development: present status and future prospects","volume":"24","author":"Mak","year":"2019","journal-title":"Drug Discov Today"},{"issue":"8","key":"2021090907254473900_ref4","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.tips.2019.06.004","article-title":"Advancing drug discovery via artificial intelligence","volume":"40","author":"Chan","year":"2019","journal-title":"Trends Pharmacol Sci"},{"issue":"6","key":"2021090907254473900_ref5","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1016\/j.drudis.2018.01.039","article-title":"The rise of deep learning in drug discovery","volume":"23","author":"Chen","year":"2018","journal-title":"Drug Discov Today"},{"issue":"11","key":"2021090907254473900_ref6","doi-asserted-by":"crossref","first-page":"2594","DOI":"10.1007\/s11095-016-2029-7","article-title":"The next era: deep learning in pharmaceutical research","volume":"33","author":"Ekins","year":"2016","journal-title":"Pharm Res"},{"key":"2021090907254473900_ref7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1146\/annurev-bioeng-071516-044442","article-title":"Deep learning in medical image analysis","volume":"19","author":"Shen","year":"2017","journal-title":"Annu Rev Biomed Eng"},{"key":"2021090907254473900_ref8","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.media.2017.07.005","article-title":"A survey on deep learning in medical image analysis","volume":"42","author":"Litjens","year":"2017","journal-title":"Med Image Anal"},{"issue":"9","key":"2021090907254473900_ref9","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1093\/bioinformatics\/btq112","article-title":"A machine learning approach to predicting protein\u2013ligand binding affinity with applications to molecular docking","volume":"26","author":"Ballester","year":"2010","journal-title":"Bioinformatics"},{"issue":"3","key":"2021090907254473900_ref10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.artmed.2015.02.002","article-title":"Machine learning in computational docking","volume":"63","author":"Khamis","year":"2015","journal-title":"Artif Intell Med"},{"issue":"6","key":"2021090907254473900_ref11","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/wcms.1225","article-title":"Machine-learning scoring functions to improve structure-based binding affinity prediction and virtual screening","volume":"5","author":"Ain","year":"2015","journal-title":"Wiley Interdiscip Rev Comput Mol Sci"},{"issue":"2","key":"2021090907254473900_ref12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1021\/acs.jcim.7b00650","article-title":"K$_DEEP$: protein\u2013ligand absolute binding affinity prediction via 3D-convolutional neural networks","volume":"58","author":"Jim\u00e9nez","year":"2018","journal-title":"J Chem Inf Model"},{"issue":"80","key":"2021090907254473900_ref13","article-title":"Deeptox: toxicity prediction using deep learning","volume":"3","author":"Mayr","year":"2016","journal-title":"Front Environ Sci"},{"key":"2021090907254473900_ref14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4020-9783-6","volume-title":"Recent advances in QSAR studies: methods and applications","author":"Puzyn","year":"2010"},{"issue":"8","key":"2021090907254473900_ref15","doi-asserted-by":"crossref","first-page":"1538","DOI":"10.1016\/j.drudis.2018.05.010","article-title":"Machine learning in chemoinformatics and drug discovery","volume":"23","author":"Lo","year":"2018","journal-title":"Drug Discov Today"},{"issue":"20","key":"2021090907254473900_ref16","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevB.89.205118","article-title":"How to represent crystal structures for machine learning: towards fast prediction of electronic properties","volume":"89","author":"Sch\u00fctt","year":"2014","journal-title":"Physical Review B"},{"issue":"1","key":"2021090907254473900_ref17","doi-asserted-by":"crossref","DOI":"10.1038\/s41524-017-0056-5","article-title":"Machine learning in materials informatics: recent applications and prospects","volume":"3","author":"Ramprasad","year":"2017","journal-title":"npj Comput Mater"},{"issue":"3","key":"2021090907254473900_ref18","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1021\/cm503507h","article-title":"Materials cartography: representing and mining materials space using structural and electronic fingerprints","volume":"27","author":"Isayev","year":"2015","journal-title":"Chem Mater"},{"issue":"1","key":"2021090907254473900_ref19","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevB.92.014106","article-title":"Accelerated materials property predictions and design using motif-based fingerprints","volume":"92","author":"Huan","year":"2015","journal-title":"Physical Review B"},{"issue":"7","key":"2021090907254473900_ref20","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pcbi.1005690","article-title":"TopologyNet: topology based deep convolutional and multi-task neural networks for biomolecular property predictions","volume":"13","author":"Cang","year":"2017","journal-title":"PLoS Comput Biol"},{"key":"2021090907254473900_ref21","article-title":"Integration of element specific persistent homology and machine learning for protein-ligand binding affinity prediction","author":"Cang","year":"2017","journal-title":"Int J Numer Method Biomed Eng"},{"issue":"7","key":"2021090907254473900_ref22","doi-asserted-by":"crossref","first-page":"1715","DOI":"10.1021\/acs.jcim.7b00226","article-title":"Rigidity strengthening: a mechanism for protein\u2013ligand binding","volume":"57","author":"Nguyen","year":"2017","journal-title":"J Chem Inf Model"},{"issue":"22","key":"2021090907254473900_ref23","first-page":"3549","article-title":"Analysis and prediction of protein folding energy changes upon mutation by element specific persistent homology","volume":"33","author":"Cang","year":"2017","journal-title":"Bioinformatics"},{"issue":"1","key":"2021090907254473900_ref24","doi-asserted-by":"crossref","first-page":"e1005929","DOI":"10.1371\/journal.pcbi.1005929","article-title":"Representability of algebraic topology for biomolecules in machine learning based scoring and virtual screening","volume":"14","author":"Cang","year":"2018","journal-title":"PLoS Comput Biol"},{"issue":"2","key":"2021090907254473900_ref25","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1021\/acs.jcim.7b00558","article-title":"Quantitative toxicity prediction using topology based multi-task deep neural networks","volume":"58","author":"Wu","year":"2018","journal-title":"J Chem Inf Model"},{"issue":"1","key":"2021090907254473900_ref26","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10822-018-0146-6","article-title":"Mathematical deep learning for pose and binding affinity prediction and ranking in D3R grand challenges","volume":"33","author":"Nguyen","year":"2019","journal-title":"J Comput Aided Mol Des"},{"issue":"7","key":"2021090907254473900_ref27","doi-asserted-by":"crossref","first-page":"3291","DOI":"10.1021\/acs.jcim.9b00334","article-title":"AGL-score: algebraic graph learning score for protein-ligand binding scoring, ranking, docking, and screening","volume":"59","author":"Nguyen","year":"2019","journal-title":"J Chem Inf Model"},{"issue":"3","key":"2021090907254473900_ref28","doi-asserted-by":"crossref","first-page":"e3179","DOI":"10.1002\/cnm.3179","article-title":"DG-GL: differential geometry-based geometric learning of molecular datasets","volume":"35","author":"Nguyen","year":"2019","journal-title":"Int J Numer Method Biomed Eng"},{"key":"2021090907254473900_ref29","first-page":"1","article-title":"MathDL: mathematical deep learning for D3R grand challenge 4","author":"Nguyen","year":"2019","journal-title":"J Comput Aided Mol Des"},{"issue":"1","key":"2021090907254473900_ref30","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10822-018-0146-6","article-title":"Mathematical deep learning for pose and binding affinity prediction and ranking in D3R grand challenges","volume":"33","author":"Nguyen","year":"2019","journal-title":"J Comput Aided Mol Des"},{"key":"2021090907254473900_ref31","article-title":"Generative network complex (GNC) for drug discovery","author":"Grow","year":"2019","journal-title":"arXiv preprint arXiv:191014650"},{"issue":"2","key":"2021090907254473900_ref32","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1137\/19M1272226","article-title":"Persistent cohomology for data with multicomponent heterogeneous information","volume":"2","author":"Cang","year":"2020","journal-title":"SIAM Journal on Mathematics of Data Science"},{"key":"2021090907254473900_ref33","article-title":"The embedded homology of hypergraphs and applications","author":"Bressan","year":"2016","journal-title":"arXiv preprint arXiv:161000890"},{"key":"2021090907254473900_ref34","article-title":"A discrete Morse theory for hypergraphs","author":"Ren","year":"2018","journal-title":"arXiv preprint arXiv:180407132"},{"key":"2021090907254473900_ref35","article-title":"Hodge decompositions for weighted hypergraphs","author":"Ren","year":"2018","journal-title":"arXiv preprint arXiv:180511331"},{"issue":"1","key":"2021090907254473900_ref36","doi-asserted-by":"crossref","first-page":"295","DOI":"10.4310\/HHA.2014.v16.n1.a16","article-title":"Graphs associated with simplicial complexes","volume":"16","author":"Grigor\u2019yan","year":"2014","journal-title":"Homol Homotopy Appl"},{"issue":"5","key":"2021090907254473900_ref37","doi-asserted-by":"crossref","first-page":"887","DOI":"10.4310\/AJM.2015.v19.n5.a5","article-title":"Cohomology of digraphs and (undirected) graphs","volume":"19","author":"Grigor\u2019yan","year":"2015","journal-title":"Asian J Math"},{"issue":"2","key":"2021090907254473900_ref38","doi-asserted-by":"crossref","first-page":"179","DOI":"10.4310\/HHA.2018.v20.n2.a9","article-title":"On the path homology theory of digraphs and Eilenberg\u2013Steenrod axioms","volume":"20","author":"Grigor\u2019yan","year":"2018","journal-title":"Homol Homotopy Appl"},{"key":"2021090907254473900_ref39","doi-asserted-by":"crossref","first-page":"106877","DOI":"10.1016\/j.topol.2019.106877","article-title":"Homology of path complexes and hypergraphs","volume":"267","author":"Grigor\u2019yan","year":"2019","journal-title":"Topol Appl"},{"issue":"2","key":"2021090907254473900_ref40","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00200823","article-title":"On the use of size functions for shape analysis","volume":"70","author":"Verri","year":"1993","journal-title":"Biol Cybern"},{"key":"2021090907254473900_ref41","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00454-002-2885-2","article-title":"Topological persistence and simplification","volume":"28","author":"Edelsbrunner","year":"2002","journal-title":"Discrete Comput Geom"},{"key":"2021090907254473900_ref42","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00454-004-1146-y","article-title":"Computing persistent homology","volume":"33","author":"Zomorodian","year":"2005","journal-title":"Discrete Comput Geom"},{"key":"2021090907254473900_ref43","article-title":"Persistent spectral based machine learning (PerSpect ML) for drug design","author":"Meng","year":"2020","journal-title":"arXiv preprint arXiv:200200582"},{"key":"2021090907254473900_ref44","article-title":"Beyond topological persistence: starting from networks","author":"Bergomi","year":"2019","journal-title":"arXiv preprint arXiv:190108051"},{"key":"2021090907254473900_ref45","doi-asserted-by":"crossref","DOI":"10.21236\/ADA241584","volume-title":"Homology and Hypergraph Acyclicity: A Combinatorial Invariant for Hypergraphs","author":"Parks","year":"1991"},{"issue":"1","key":"2021090907254473900_ref46","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1090\/S0002-9947-1992-1089416-0","article-title":"Cohomological aspects of hypergraphs","volume":"334","author":"Chung","year":"1992","journal-title":"Trans Am Math Soc"},{"issue":"5","key":"2021090907254473900_ref47","doi-asserted-by":"crossref","first-page":"1545","DOI":"10.1080\/00927870802098158","article-title":"Betti numbers of hypergraphs","volume":"37","author":"Emtander","year":"2009","journal-title":"Commun Algebra"},{"key":"2021090907254473900_ref48","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/978-3-642-02466-5_35","article-title":"Hypernetworks of complex systems","volume-title":"International Conference on Complex Sciences","author":"Johnson","year":"2009"},{"issue":"1","key":"2021090907254473900_ref49","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1090\/S0273-0979-07-01191-3","article-title":"Barcodes: the persistent topology of data","volume":"45","author":"Ghrist","year":"2008","journal-title":"Bullet Am Math Soc"},{"issue":"4","key":"2021090907254473900_ref50","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/s00454-011-9344-x","article-title":"Persistent cohomology and circular coordinates","volume":"45","author":"Silva","year":"2011","journal-title":"Discrete Comput Geom"},{"issue":"3","key":"2021090907254473900_ref51","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1021\/ci500731a","article-title":"Classification of current scoring functions","volume":"55","author":"Liu","year":"2015","journal-title":"J Chem Inf Model"},{"issue":"2\u20133","key":"2021090907254473900_ref52","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/minf.201400132","article-title":"Improving AutoDock Vina using random forest: the growing accuracy of binding affinity prediction by the effective exploitation of larger data sets","volume":"34","author":"Li","year":"2015","journal-title":"Mol Inform"},{"issue":"8","key":"2021090907254473900_ref53","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1093\/bioinformatics\/bty757","article-title":"Development of a protein\u2013ligand extended connectivity (PLEC) fingerprint and its application for binding affinity predictions","volume":"35","author":"W\u00f3jcikowski","year":"2019","journal-title":"Bioinformatics"},{"issue":"21","key":"2021090907254473900_ref54","doi-asserted-by":"crossref","first-page":"3666","DOI":"10.1093\/bioinformatics\/bty374","article-title":"Development and evaluation of a deep learning model for protein\u2013ligand binding affinity prediction","volume":"34","author":"Stepniewska-Dziubinska","year":"2018","journal-title":"Bioinformatics"},{"issue":"2","key":"2021090907254473900_ref55","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1021\/acs.jcim.8b00545","article-title":"Comparative assessment of scoring functions: the CASF-2016 update","volume":"59","author":"Su","year":"2018","journal-title":"J Chem Inf Model"},{"issue":"2","key":"2021090907254473900_ref56","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1111\/cbdd.13206","article-title":"Improving classical scoring functions using random forest: the non-additivity of free energy terms\u2019 contributions in binding","volume":"92","author":"Afifi","year":"2018","journal-title":"Chem Biol Drug Des"},{"issue":"11","key":"2021090907254473900_ref57","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1021\/acscentsci.8b00507","article-title":"Potentialnet for molecular property prediction","volume":"4","author":"Feinberg","year":"2018","journal-title":"ACS Central Sci"},{"issue":"3","key":"2021090907254473900_ref58","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1093\/bioinformatics\/btz665","article-title":"Learning from the ligand: using ligand-based features to improve binding affinity prediction","volume":"36","author":"Boyles","year":"2020","journal-title":"Bioinformatics"},{"issue":"6","key":"2021090907254473900_ref59","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1016\/j.chempr.2020.05.002","article-title":"Molecular representation: going long on fingerprints","volume":"6","author":"Pattanaik","year":"2020","journal-title":"Chem"}],"container-title":["Briefings in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/bib\/article-pdf\/22\/5\/bbaa411\/40328007\/bbaa411.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/bib\/article-pdf\/22\/5\/bbaa411\/40328007\/bbaa411.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T09:31:15Z","timestamp":1697362275000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bib\/article\/doi\/10.1093\/bib\/bbaa411\/6105940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,22]]},"references-count":59,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9,2]]}},"URL":"https:\/\/doi.org\/10.1093\/bib\/bbaa411","relation":{},"ISSN":["1467-5463","1477-4054"],"issn-type":[{"value":"1467-5463","type":"print"},{"value":"1477-4054","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2021,9]]},"published":{"date-parts":[[2021,1,22]]},"article-number":"bbaa411"}}