arXiv · 2405.06657
Molecular Docking via Weighted Subgraph Isomorphism on Quantum Annealers
Abstract
Molecular docking is an essential step in the drug discovery process involving the detection of three-dimensional poses of a ligand inside the active site of the protein. In this paper, we address the Molecular Docking search phase by formulating the problem in QUBO terms, suitable for an annealing approach. We propose a problem formulation as a weighted subgraph isomorphism between the ligand graph and the grid of the target protein pocket. In particular, we applied a graph representation to the ligand embedding all the geometrical properties of the molecule including its flexibility, and we created a weighted spatial grid to the 3D space region inside the pocket. Results and performance obtained with quantum annealers are compared with classical simulated annealing solvers.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Emanuele Triuzzi, Riccardo Mengoni, Francesco Micucci, Domenico Bonanni, Daniele Ottaviani, Andrea Beccari, Gianluca Palermo. 2024-04-19. Molecular Docking via Weighted Subgraph Isomorphism on Quantum Annealers. https://doi.org/10.1088/2058-9565%2Fae0890
Cite the original work for its findings. Save a collection to share your selection of sources.