Moldina: a fast and accurate search algorithm for simultaneous docking of multiple ligands
| Authors | |
|---|---|
| Year of publication | 2025 |
| Type | Article in Periodical |
| Magazine / Source | Journal of Cheminformatics |
| MU Faculty or unit | |
| Citation | |
| web | https://jcheminf.biomedcentral.com/articles/10.1186/s13321-025-01005-4 |
| Doi | http://dx.doi.org/10.1186/s13321-025-01005-4 |
| Keywords | Multiple-ligand; Molecular docking; AutoDock Vina; Fragment-based drug design; Substrate inhibition; Competitive binding |
| Attached files | |
| Description | Protein-ligand docking is a computational method routinely used in many structural biology applications. It usually involves one receptor and one ligand. The docking of multiple ligands, however, can be important in several situations, such as the study of synergistic effects, substrate and product inhibition, or competitive binding. This can be a challenging and computationally demanding process. By integrating Particle Swarm Optimization into the established AutoDock Vina framework, we provided a powerful tool capable of accelerating drug discovery, and computational enzymology. Here we present Moldina (Multiple-Ligand Molecular Docking over AutoDock Vina), a new algorithm built upon AutoDock Vina. Through comprehensive testing against AutoDock Vina, the algorithm exhibited comparable accuracy in predicting ligand binding conformations while significantly reducing the computational time up to several hundred times. Moldina and the benchmark data are freely available at https://opencode.it4i.eu/permed/moldina-multiple-ligand-molecular-docking-over-autodock-vina and https://github.com/It4innovations/moldina-multiple-ligand-molecular-docking-over-autodock-vina. |
| Related projects: |