Cargando…
GPU-Q-J, a fast method for calculating root mean square deviation (RMSD) after optimal superposition
BACKGROUND: 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 suita...
Autores principales: | , , |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3087690/ https://www.ncbi.nlm.nih.gov/pubmed/21453553 http://dx.doi.org/10.1186/1756-0500-4-97 |
_version_ | 1782202813815717888 |
---|---|
author | Hung, Ling-Hong Guerquin, Michal Samudrala, Ram |
author_facet | Hung, Ling-Hong Guerquin, Michal Samudrala, Ram |
author_sort | Hung, Ling-Hong |
collection | PubMed |
description | BACKGROUND: 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 http://software.compbio.washington.edu/misc/downloads/st_gpu_fit/ or from the author LHH. FINDINGS: The Nutritious Rice for the World Project (NRW) on World Community Grid predicted de novo, 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. CONCLUSIONS: 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. |
format | Text |
id | pubmed-3087690 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2011 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-30876902011-05-05 GPU-Q-J, a fast method for calculating root mean square deviation (RMSD) after optimal superposition Hung, Ling-Hong Guerquin, Michal Samudrala, Ram BMC Res Notes Technical Note BACKGROUND: 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 http://software.compbio.washington.edu/misc/downloads/st_gpu_fit/ or from the author LHH. FINDINGS: The Nutritious Rice for the World Project (NRW) on World Community Grid predicted de novo, 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. CONCLUSIONS: 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. BioMed Central 2011-04-01 /pmc/articles/PMC3087690/ /pubmed/21453553 http://dx.doi.org/10.1186/1756-0500-4-97 Text en Copyright ©2011 Samudrala et al; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
spellingShingle | Technical Note Hung, Ling-Hong Guerquin, Michal Samudrala, Ram GPU-Q-J, a fast method for calculating root mean square deviation (RMSD) after optimal superposition |
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 |
topic | Technical Note |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3087690/ https://www.ncbi.nlm.nih.gov/pubmed/21453553 http://dx.doi.org/10.1186/1756-0500-4-97 |
work_keys_str_mv | AT hunglinghong gpuqjafastmethodforcalculatingrootmeansquaredeviationrmsdafteroptimalsuperposition AT guerquinmichal gpuqjafastmethodforcalculatingrootmeansquaredeviationrmsdafteroptimalsuperposition AT samudralaram gpuqjafastmethodforcalculatingrootmeansquaredeviationrmsdafteroptimalsuperposition |