title: Durandal: fast exact clustering of protein decoys.
abstract: In protein folding, clustering is commonly used as one way to identify the best decoy produced. Initializing the pairwise distance matrix for a large decoy set is computationally expensive. We have proposed a fast method that works even on large decoy sets. This method is implemented in a software called Durandal. Durandal has been shown to be consistently faster than other software performing fast exact clustering. In some cases, Durandal can even outperform the speed of an approximate method. Durandal uses the triangular inequality to accelerate exact clustering, without compromising the distance function. Recently, we have further enhanced the performance of Durandal by incorporating a Quaternion-based characteristic polynomial method that has increased the speed of Durandal between 13% and 27% compared with the previous version. Durandal source code is available under the GNU General Public License at http://www.riken.jp/zhangiru/software/durandal_released_qcp.tgz. Alternatively, a compiled version of Durandal is also distributed with the nightly builds of the Phenix (http://www.phenix-online.org/) crystallographic software suite (Adams et al., Acta Crystallogr Sect D 2010, 66, 213).
authors: Zhang Initiative Research Unit, Advanced Science Institute, RIKEN, 2-1 Hirosawa, Wako, Saitama 351-0198, Japan.
authors: Francois
authors: F
authors: Berenger
authors: Rojan
authors: R
authors: Shrestha
authors: Yong
authors: Y
authors: Zhou
authors: David
authors: D
authors: Simoncini
authors: Kam Y J
authors: KY
authors: Zhang
mesh_terms: D016000:Cluster Analysis; D017510:Protein Folding; D011506:Proteins / Q000737:chemistry*; D012984:Software
chemical_list: D011506:Proteins