Ankit
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ankit has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Juho Rousu
Department of Computer Science, Aalto University, Espoo, Finland and Helsinki Institute for Information Technology, University of Helsinki, Helsinki, Finland
1 shared publication - Sahely Bhadra
Department of Data Science, Mehta Family School of Data Science and Artificial Intelligence, Indian Institute of Technology Palakkad , Kanjikkode, Palakkad, Kerala 678623
1 shared publication
Latest Publications
- Open Access
- 1 July 2025
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 41 (Supplement) , i58-i67
Efficient 3D kernels for molecular property prediction
Motivation: This paper addresses the challenge of incorporating 3-dimensional (3D) structural information in graph kernels for machine learning-based virtual screening, a crucial task in drug discovery. Existing kernels that capture 3D information often suffer from high computational complexity, which limits their scalability. Results: To overcome this, we propose the 3D chain motif graph kernel, which effectively integrates essential 3D structural properties—bond length, bond angle, and torsion angle—within the three-hop neighborhood of each atom in a molecule. In addition, we introduce a more computationally efficient variant, the 3D graph hopper kernel (3DGHK), which reduces the complexity from the state-of-the-art O(n6) (for the 3D pharmacophore kernel) to O(n2(m+log(n)+δ2+dT6)). Here, n is the number of nodes, T is the highest degree of the node, m is the number of edges, δ is the diameter of the graph, and d is the dimension of the attributes of the nodes. We conducted experiments on 21 datasets, demonstrating that 3DGHK outperforms other state-of-the-art 2D and 3D graph kernels, but it also surpasses deep learning models in classification accuracy, offering a powerful and scalable solution for virtual screening tasks. Availability and implementation: Our code is publicly available at https://github.com/SantaAnkit/Efficient-3D-kernels-for-molecular-property-prediction.git.
- 1 July 2025
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 41 (Supplement) , i58-i67
Open AccessEfficient 3D kernels for molecular property prediction
Motivation: This paper addresses the challenge of incorporating 3-dimensional (3D) structural information in graph kernels for machine learning-based virtual screening, a crucial task in drug discovery. Existing kernels that capture 3D information often suffer from high computational complexity, which limits their scalability. Results: To overcome this, we propose the 3D chain motif graph kernel, which effectively integrates essential 3D structural properties—bond length, bond angle, and torsion angle—within the three-hop neighborhood of each atom in a molecule. In addition, we introduce a more computationally efficient variant, the 3D graph hopper kernel (3DGHK), which reduces the complexity from the state-of-the-art O(n6) (for the 3D pharmacophore kernel) to O(n2(m+log(n)+δ2+dT6)). Here, n is the number of nodes, T is the highest degree of the node, m is the number of edges, δ is the diameter of the graph, and d is the dimension of the attributes of the nodes. We conducted experiments on 21 datasets, demonstrating that 3DGHK outperforms other state-of-the-art 2D and 3D graph kernels, but it also surpasses deep learning models in classification accuracy, offering a powerful and scalable solution for virtual screening tasks. Availability and implementation: Our code is publicly available at https://github.com/SantaAnkit/Efficient-3D-kernels-for-molecular-property-prediction.git.