ToDD: Topological Compound Fingerprinting in Computer-Aided Drug Discovery
Andac Demir, Baris Coskunuzer, Yulia R. Gel, Ignacio Segovia-Dominguez, Yuzhou Chen, Bulent Kiziltan
Abstract
In computer-aided drug discovery (CADD), virtual screening (VS) is used for identifying the drug candidates that are most likely to bind to a molecular target in a large library of compounds. Most VS methods to date have focused on using canonical compound representations (e.g., SMILES strings, Morgan fingerprints) or generating alternative fingerprints of the compounds by training progressively more complex variational autoencoders (VAEs) and graph neural networks (GNNs). Although VAEs and GNNs led to significant improvements in VS performance, these methods suffer from reduced performance when scaling to large virtual compound datasets. The performance of these methods has shown only incremental improvements in the past few years. To address this problem, we developed a novel method using multiparameter persistence (MP) homology that produces topological fingerprints of the compounds as multidimensional vectors. Our primary contribution is framing the VS process as a new topology-based graph ranking problem by partitioning a compound into chemical substructures informed by the periodic properties of its atoms and extracting their persistent homology features at multiple resolution levels. We show that the margin loss fine-tuning of pretrained Triplet networks attains highly competitive results in differentiating between compounds in the embedding space and ranking their likelihood of becoming effective drug candidates. We further establish theoretical guarantees for the stability properties of our proposed MP signatures, and demonstrate that our models, enhanced by the MP signatures, outperform state-of-the-art methods on benchmark datasets by a wide and highly statistically significant margin (e.g., 93% gain for Cleves-Jain and 54% gain for DUD-E Diverse dataset).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f1b24d39-2076-42c4-8e53-747310ef822eCited by top-tier papers1
Ask how each one uses itBuilds on9
- An Image is Worth 16x16 Words: Transformers for Image Recognition at ScaleAlexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn et al.ICLR 2021 · 21,477 citations
- A ConvNet for the 2020sZhuang Liu, Hanzi Mao, Chao-Yuan Wu, Christoph Feichtenhofer et al.CVPR 2022 · 6,782 citations
- Hierarchical Generation of Molecular Graphs using Structural MotifsWengong Jin, Regina Barzilay, Tommi S. JaakkolaICML 2020 · 356 citations
- Z-GCNETs: Time Zigzags at Graph Convolutional Networks for Time Series ForecastingYuzhou Chen, Ignacio Segovia-Dominguez, Yulia R. GelICML 2021 · 201 citations
- Understanding the Difficulty of Training TransformersLiyuan Liu, Xiaodong Liu, Jianfeng Gao, Weizhu Chen et al.EMNLP 2020 · 158 citations
Related papers
- Improving Self-supervised Molecular Representation Learning using Persistent HomologyYuankai Luo, Lei Shi, Veronika ThostNeurIPS 2023 · 13 citations
- Positional Encoding meets Persistent Homology on GraphsYogesh Verma, Amauri H. Souza, Vikas K. GargICML 2025
- TopoFormer: Topology Meets Attention for Graph LearningMd Joshem Uddin, Astrit Tola, Cuneyt Gurcan Akcora, Baris CoskunuzerICLR 2026 · 2 citations
- MacroGuide: Topological Guidance for Macrocycle GenerationAlicja Maksymiuk, Alexandre Duplessis, Michael Bronstein, Alexander Tong et al.ICML 2026
- Topological Pooling on GraphsYuzhou Chen, Yulia R. GelAAAI 2023 · 21 citations
