Algorithms for clustering molecular dynamics configurations

✍ Scribed by Andrew E. Torda; Wilfred F. van Gunsteren

• Publisher: John Wiley and Sons
• Year: 1994
• Tongue: English
• Weight: 805 KB
• Volume: 15
• Category: Article
• ISSN: 0192-8651
• DOI: 10.1002/jcc.540151203

✦ Synopsis

Two traditional clustering algorithms are applied to configurations from a long molecular dynamics trajectory and compared using two sets of test data. First, a subset of atoms was chosen to present conformations which naturally fall into a number of clusters. Second, a subset of atoms was selected to span a relatively continuous region of conformational space rather than form discrete conformational classes. Of the two algorithms used, the single linkage method is inappropriate for this kind of data. The divisive hierarchical method, based on minimizing the difference between cluster centroids and extrema, is successful but also prone to imposing clustering hierarchy where none can be justified.