GPU-Q-J, a fast method for calculating root mean square deviation (RMSD) after optimal superposition
<p>Abstract</p> <p>Background</p> <p>Calculation of the root mean square deviation (RMSD) between the atomic coordinates of two optimally superposed structures is a basic component of structural comparison techniques. We describe a quaternion based method, GPU-Q-J, that...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2011-04-01
|
Series: | BMC Research Notes |
Online Access: | http://www.biomedcentral.com/1756-0500/4/97 |
_version_ | 1818807392443301888 |
---|---|
author | Guerquin Michal Hung Ling-Hong Samudrala Ram |
author_facet | Guerquin Michal Hung Ling-Hong Samudrala Ram |
author_sort | Guerquin Michal |
collection | DOAJ |
description | <p>Abstract</p> <p>Background</p> <p>Calculation of the root mean square deviation (RMSD) between the atomic coordinates of two optimally superposed structures is a basic component of structural comparison techniques. We describe a quaternion based method, GPU-Q-J, that is stable with single precision calculations and suitable for graphics processor units (GPUs). The application was implemented on an ATI 4770 graphics card in C/C++ and Brook+ in Linux where it was 260 to 760 times faster than existing unoptimized CPU methods. Source code is available from the Compbio website <url>http://software.compbio.washington.edu/misc/downloads/st_gpu_fit/</url> or from the author LHH.</p> <p>Findings</p> <p>The Nutritious Rice for the World Project (NRW) on World Community Grid predicted <it>de novo</it>, the structures of over 62,000 small proteins and protein domains returning a total of 10 billion candidate structures. Clustering ensembles of structures on this scale requires calculation of large similarity matrices consisting of RMSDs between each pair of structures in the set. As a real-world test, we calculated the matrices for 6 different ensembles from NRW. The GPU method was 260 times faster that the fastest existing CPU based method and over 500 times faster than the method that had been previously used.</p> <p>Conclusions</p> <p>GPU-Q-J is a significant advance over previous CPU methods. It relieves a major bottleneck in the clustering of large numbers of structures for NRW. It also has applications in structure comparison methods that involve multiple superposition and RMSD determination steps, particularly when such methods are applied on a proteome and genome wide scale.</p> |
first_indexed | 2024-12-18T19:24:56Z |
format | Article |
id | doaj.art-c72e70d87af94d26a717786a3f40f62a |
institution | Directory Open Access Journal |
issn | 1756-0500 |
language | English |
last_indexed | 2024-12-18T19:24:56Z |
publishDate | 2011-04-01 |
publisher | BMC |
record_format | Article |
series | BMC Research Notes |
spelling | doaj.art-c72e70d87af94d26a717786a3f40f62a2022-12-21T20:55:53ZengBMCBMC Research Notes1756-05002011-04-01419710.1186/1756-0500-4-97GPU-Q-J, a fast method for calculating root mean square deviation (RMSD) after optimal superpositionGuerquin MichalHung Ling-HongSamudrala Ram<p>Abstract</p> <p>Background</p> <p>Calculation of the root mean square deviation (RMSD) between the atomic coordinates of two optimally superposed structures is a basic component of structural comparison techniques. We describe a quaternion based method, GPU-Q-J, that is stable with single precision calculations and suitable for graphics processor units (GPUs). The application was implemented on an ATI 4770 graphics card in C/C++ and Brook+ in Linux where it was 260 to 760 times faster than existing unoptimized CPU methods. Source code is available from the Compbio website <url>http://software.compbio.washington.edu/misc/downloads/st_gpu_fit/</url> or from the author LHH.</p> <p>Findings</p> <p>The Nutritious Rice for the World Project (NRW) on World Community Grid predicted <it>de novo</it>, the structures of over 62,000 small proteins and protein domains returning a total of 10 billion candidate structures. Clustering ensembles of structures on this scale requires calculation of large similarity matrices consisting of RMSDs between each pair of structures in the set. As a real-world test, we calculated the matrices for 6 different ensembles from NRW. The GPU method was 260 times faster that the fastest existing CPU based method and over 500 times faster than the method that had been previously used.</p> <p>Conclusions</p> <p>GPU-Q-J is a significant advance over previous CPU methods. It relieves a major bottleneck in the clustering of large numbers of structures for NRW. It also has applications in structure comparison methods that involve multiple superposition and RMSD determination steps, particularly when such methods are applied on a proteome and genome wide scale.</p>http://www.biomedcentral.com/1756-0500/4/97 |
spellingShingle | Guerquin Michal Hung Ling-Hong Samudrala Ram GPU-Q-J, a fast method for calculating root mean square deviation (RMSD) after optimal superposition BMC Research Notes |
title | GPU-Q-J, a fast method for calculating root mean square deviation (RMSD) after optimal superposition |
title_full | GPU-Q-J, a fast method for calculating root mean square deviation (RMSD) after optimal superposition |
title_fullStr | GPU-Q-J, a fast method for calculating root mean square deviation (RMSD) after optimal superposition |
title_full_unstemmed | GPU-Q-J, a fast method for calculating root mean square deviation (RMSD) after optimal superposition |
title_short | GPU-Q-J, a fast method for calculating root mean square deviation (RMSD) after optimal superposition |
title_sort | gpu q j a fast method for calculating root mean square deviation rmsd after optimal superposition |
url | http://www.biomedcentral.com/1756-0500/4/97 |
work_keys_str_mv | AT guerquinmichal gpuqjafastmethodforcalculatingrootmeansquaredeviationrmsdafteroptimalsuperposition AT hunglinghong gpuqjafastmethodforcalculatingrootmeansquaredeviationrmsdafteroptimalsuperposition AT samudralaram gpuqjafastmethodforcalculatingrootmeansquaredeviationrmsdafteroptimalsuperposition |