How to Efficiently Characterize the Interaction Pathways of Protein-Ligand Recognition? A Comparative Analysis on Enhanced Sampling Approaches
Abstract
To efficiently characterize the drug-target interacting process, various enhanced sampling technologies have been proposed; yet very few studies have systemically investigated whether the settings of these simulations are favorable to characterize the purposed tasks. Here, by comparing two popular enhanced sampling technologies, namely the well-temped metadynamics (WT-MetaD) and random acceleration molecular dynamics (RAMD), we systemically investigate the strategies to efficiently characterize the dissociating process of protein-ligand interactions. Two target families are employed for the analysis, including the kinase family (represented by TRK1) that represents the interaction-pathway obvious systems and the nuclear receptor (NR) family (represented by THRβ) that represents the interaction-pathway unobvious systems. Our results suggest that, (1) in terms of maintaining stability of the protein structure, MetaD at various simulation conditions and RAMD with a large random force are good choice; (2) drug residence time derived from both MetaD and RAMD based on various parameters shows reasonable correlation to the experimental binding strength of the ligands, but RAMD usually runs with much less simulation time; (3) both enhanced sampling methods result in reasonably consistent pathway preference for the two target families. Taken together, it will be much time-saving to utilize RAMD with high random force for interaction pathway exploration for both the pathway obvious and unobvious systems if the protein keeps stable in the simulation; otherwise, MetaD with a high bias factor is proposed to balance the computational accuracy and efficiency for the exploration.
Fields of Study & Subjects
Computational Drug Discovery Methods
Protein Structure and Dynamics
Advanced Physical and Chemical Molecular Interactions
Publication details
- Journal / source
- AIP Publishing
- Publication date
- 1 January 2026