Quality Threshold Clustering of Molecular Dynamics: A Word of Caution

Clustering Molecular Dynamics trajectories is a common analysis that allows grouping together similar conformations. Several algorithms have been designed and optimized to perform this routine task, and among them, Quality Threshold stands as a very attractive option. This algorithm guarantees that in retrieved clusters no pair of frames will have a similarity value greater than a specified threshold, and hence, a set of strongly correlated frames are obtained for each cluster. In this work, it is shown that various commonly used software implementations are flawed by confusing Quality Threshold with another simplistic well-known clustering algorithm published by Daura et al. (Daura, X.; van Gunsteren, W. F.; Jaun, B.; Mark, A. E.; Gademann, K.; Seebach, D. Peptide Folding: When Simulation Meets Experiment. Angew. Chemie Int. Ed. 1999, 38 (1/2), 236-240). Daura's algorithm does not impose any quality threshold for the frames contained in retrieved clusters, bringing unrelated structural configurations altogether. The advantages of using Quality Threshold whenever possible to explore Molecular Dynamic trajectories is exemplified. An in-house implementation of the original Quality Threshold algorithm has been developed in order to illustrate our comments, and its code is freely available for further use by the scientific community.