Skip to main content
. Author manuscript; available in PMC: 2014 Nov 1.
Published in final edited form as: J Mol Graph Model. 2013 Oct 16;46:140–149. doi: 10.1016/j.jmgm.2013.10.003

Figure 5.

Figure 5

Comparison of the results from 11 clustering algorithms with a network constructed using 1000 frames from MD simulation and the force-directed layout algorithm: (a) FAG-EC, (b) average linkage, (c) Bayesian, (d) centripetal, (e) centripetal complete, (f) complete linkage, (g) edge, (h) hierarchical, (i) k-means, (j), single linkage, and (k) SOM. A threshold parameter of one and a minimum complex size of two were used for the FAG-EC algorithm.