A fast parallel clustering algorithm for molecular simulation trajectories

Copyright © 2012 Wiley Periodicals, Inc.

Bibliographische Detailangaben
Veröffentlicht in:Journal of computational chemistry. - 1984. - 34(2013), 2 vom: 15. Jan., Seite 95-104
1. Verfasser: Zhao, Yutong (VerfasserIn)
Weitere Verfasser: Sheong, Fu Kit, Sun, Jian, Sander, Pedro, Huang, Xuhui
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2013
Zugriff auf das übergeordnete Werk:Journal of computational chemistry
Schlagworte:Journal Article Research Support, N.I.H., Extramural Research Support, Non-U.S. Gov't Dipeptides Escherichia coli Proteins Islet Amyloid Polypeptide Maltose-Binding Proteins Proteins Trpzip2 protein alanylalanine 2867-20-1
LEADER 01000naa a22002652 4500
001 NLM221193367
003 DE-627
005 20231224051243.0
007 cr uuu---uuuuu
008 231224s2013 xx |||||o 00| ||eng c
024 7 |a 10.1002/jcc.23110  |2 doi 
028 5 2 |a pubmed24n0737.xml 
035 |a (DE-627)NLM221193367 
035 |a (NLM)22996151 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Zhao, Yutong  |e verfasserin  |4 aut 
245 1 2 |a A fast parallel clustering algorithm for molecular simulation trajectories 
264 1 |c 2013 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 29.04.2013 
500 |a Date Revised 04.12.2012 
500 |a published: Print-Electronic 
500 |a Citation Status MEDLINE 
520 |a Copyright © 2012 Wiley Periodicals, Inc. 
520 |a We implemented a GPU-powered parallel k-centers algorithm to perform clustering on the conformations of molecular dynamics (MD) simulations. The algorithm is up to two orders of magnitude faster than the CPU implementation. We tested our algorithm on four protein MD simulation datasets ranging from the small Alanine Dipeptide to a 370-residue Maltose Binding Protein (MBP). It is capable of grouping 250,000 conformations of the MBP into 4000 clusters within 40 seconds. To achieve this, we effectively parallelized the code on the GPU and utilize the triangle inequality of metric spaces. Furthermore, the algorithm's running time is linear with respect to the number of cluster centers. In addition, we found the triangle inequality to be less effective in higher dimensions and provide a mathematical rationale. Finally, using Alanine Dipeptide as an example, we show a strong correlation between cluster populations resulting from the k-centers algorithm and the underlying density. © 2012 Wiley Periodicals, Inc 
650 4 |a Journal Article 
650 4 |a Research Support, N.I.H., Extramural 
650 4 |a Research Support, Non-U.S. Gov't 
650 7 |a Dipeptides  |2 NLM 
650 7 |a Escherichia coli Proteins  |2 NLM 
650 7 |a Islet Amyloid Polypeptide  |2 NLM 
650 7 |a Maltose-Binding Proteins  |2 NLM 
650 7 |a Proteins  |2 NLM 
650 7 |a Trpzip2 protein  |2 NLM 
650 7 |a alanylalanine  |2 NLM 
650 7 |a 2867-20-1  |2 NLM 
700 1 |a Sheong, Fu Kit  |e verfasserin  |4 aut 
700 1 |a Sun, Jian  |e verfasserin  |4 aut 
700 1 |a Sander, Pedro  |e verfasserin  |4 aut 
700 1 |a Huang, Xuhui  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t Journal of computational chemistry  |d 1984  |g 34(2013), 2 vom: 15. Jan., Seite 95-104  |w (DE-627)NLM098138448  |x 1096-987X  |7 nnns 
773 1 8 |g volume:34  |g year:2013  |g number:2  |g day:15  |g month:01  |g pages:95-104 
856 4 0 |u http://dx.doi.org/10.1002/jcc.23110  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 34  |j 2013  |e 2  |b 15  |c 01  |h 95-104