BitQT: a graph-based approach to the quality threshold clustering of molecular dynamics

Motivation: Classical Molecular Dynamics (MD) is a standard computational approach to model time-dependent processes at the atomic level. The inherent sparsity of increasingly huge generated trajectories demands clustering algorithms to reduce other post-simulation analysis complexity. The Quality Threshold (QT) variant is an appealing one from the vast number of available clustering methods. It guarantees that all members of a particular cluster will maintain a collective similarity established by a user-defined threshold. Unfortunately, its high computational cost for processing big data limits its application in the molecular simulation field. Results: In this work, we propose a methodological parallel between QT clustering and another well-known algorithm in the field of Graph Theory, the Maximum Clique Problem. Molecular trajectories are represented as graphs whose nodes designate conformations, while unweighted edges indicate mutual similarity between nodes. The use of a binary-encoded RMSD matrix coupled to the exploitation of bitwise operations to extract clusters significantly contributes to reaching a very affordable algorithm compared to the few implementations of QT for MD available in the literature. Our alternative provides results in good agreement with the exact one while strictly preserving the collective similarity of clusters.

Automated summary

This study introduces a methodological parallel between the Quality Threshold (QT) clustering and the Maximum Clique Problem in the field of Graph Theory. By using a binary-encoded RMSD matrix and bitwise operations to extract clusters, a highly efficient algorithm is achieved, providing results in good agreement with existing implementations in the literature while strictly preserving the collective similarity of clusters.