More sophisticated is not always better: comparison of similarity measures for unsupervised learning of pathways in biomolecular simulations
arXiv:2507.01725 · doi:10.1021/acs.jpcb.5c04586
Abstract
Finding process pathways in molecular simulations such as the unbinding paths of small molecule ligands from their binding sites at protein targets in a set of trajectories via unsupervised learning approaches requires the definition of a suitable similarity measure between trajectories. We here evaluate the performance of four such measures with varying degree of sophistication, i.e., Euclidean and Wasserstein distances, Procrustes analysis and dynamical time warping, when analyzing trajectory data from two different biased simulation driving protocols in the form of constant velocity constraint targeted MD and steered MD. In a streptavidin-biotin benchmark system with known ground truth clusters, Wasserstein distances yielded the best clustering performance, closely followed by Euclidean distances, both being the most computationally efficient similarity measures. In a more complex A2a receptor-inhibitor system, however, the simplest measure, i.e., Euclidean distances, was sufficient to reveal meaningful and interpretable clusters.
This preprint is the unedited version of a manuscript that has been published as a peer-reviewed article in J. Phys. Chem. B. Copyright with the authors and ACS
References in corpus (12)
- Array Programming with NumPy
- Narrow scope for resolution-limit-free community detection
- Enhanced sampling methods for molecular dynamics simulations
- Time Warp Edit Distance with Stiffness Adjustment for Time Series Matching
- Autonomous artificial intelligence discovers mechanisms of molecular self-organization in virtual experiments
- Principal component analysis of nonequilibrium molecular dynamics simulations
- Deep Learning Collective Variables from Transition Path Ensemble
- Selecting Features for Markov Modeling: A Case Study on HP35
- Ligand unbinding pathway and mechanism analysis assisted by machine learning and graph methods
- Predicting ion channel conductance via dissipation-corrected targeted molecular dynamics and Langevin equation simulations
- Path separation of dissipation-corrected targeted molecular dynamics simulations of protein-ligand unbinding
- Learning protein-ligand unbinding pathways via single-parameter community detection