More sophisticated is not always better: comparison of similarity measures for unsupervised learning of pathways in biomolecular simulations
Miriam Jäger, Steffen Wolf
TL;DR
This work benchmarks four trajectory similarity measures for unsupervised clustering of protein–ligand unbinding pathways from biased MD simulations. Trajectories are encoded as ligand–protein contact-distance matrices, preprocessed with smoothing, normalization, and PCA, then clustered with Leiden CPM and evaluated against ground-truth pathways in streptavidin-biotin and the A2a receptor system. It finds that Wasserstein and Euclidean distances often outperform more complex metrics like Procrustes and DTW, with Wasserstein showing particular strength when paired with PCA and time normalization, and Euclidean distance remaining robust in complex scenarios; the A2a results corroborate that both E and W can yield meaningful, physically plausible pathway separations and comparable dcTMD free-energy profiles. The study provides practical, scalable guidelines for pathway analysis in biased MD, including parameter choices (γ, preprocessing) and when to prefer simpler distance measures, with implications for efficient pathway discovery and free-energy estimation.
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.
