Cargando…

PocketMatch: A new algorithm to compare binding sites in protein structures

BACKGROUND: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similariti...

Descripción completa

Detalles Bibliográficos
Autores principales: Yeturu, Kalidas, Chandra, Nagasuma
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2008
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2639437/
https://www.ncbi.nlm.nih.gov/pubmed/19091072
http://dx.doi.org/10.1186/1471-2105-9-543
_version_ 1782164464579117056
author Yeturu, Kalidas
Chandra, Nagasuma
author_facet Yeturu, Kalidas
Chandra, Nagasuma
author_sort Yeturu, Kalidas
collection PubMed
description BACKGROUND: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites. Inferring functional similarities between protein molecules by comparing their binding sites is still largely exploratory and not as yet a routine protocol. One of the main reasons for this is the limitation in the choice of appropriate analytical tools that can compare binding sites with high sensitivity. To benefit from the enormous amount of structural data that is being rapidly accumulated, it is essential to have high throughput tools that enable large scale binding site comparison. RESULTS: Here we present a new algorithm PocketMatch for comparison of binding sites in a frame invariant manner. Each binding site is represented by 90 lists of sorted distances capturing shape and chemical nature of the site. The sorted arrays are then aligned using an incremental alignment method and scored to obtain PMScores for pairs of sites. A comprehensive sensitivity analysis and an extensive validation of the algorithm have been carried out. A comparison with other site matching algorithms is also presented. Perturbation studies where the geometry of a given site was retained but the residue types were changed randomly, indicated that chance similarities were virtually non-existent. Our analysis also demonstrates that shape information alone is insufficient to discriminate between diverse binding sites, unless combined with chemical nature of amino acids. CONCLUSION: A new algorithm has been developed to compare binding sites in accurate, efficient and high-throughput manner. Though the representation used is conceptually simplistic, we demonstrate that along with the new alignment strategy used, it is sufficient to enable binding comparison with high sensitivity. Novel methodology has also been presented for validating the algorithm for accuracy and sensitivity with respect to geometry and chemical nature of the site. The method is also fast and takes about 1/250(th )second for one comparison on a single processor. A parallel version on BlueGene has also been implemented.
format Text
id pubmed-2639437
institution National Center for Biotechnology Information
language English
publishDate 2008
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-26394372009-02-11 PocketMatch: A new algorithm to compare binding sites in protein structures Yeturu, Kalidas Chandra, Nagasuma BMC Bioinformatics Methodology Article BACKGROUND: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites. Inferring functional similarities between protein molecules by comparing their binding sites is still largely exploratory and not as yet a routine protocol. One of the main reasons for this is the limitation in the choice of appropriate analytical tools that can compare binding sites with high sensitivity. To benefit from the enormous amount of structural data that is being rapidly accumulated, it is essential to have high throughput tools that enable large scale binding site comparison. RESULTS: Here we present a new algorithm PocketMatch for comparison of binding sites in a frame invariant manner. Each binding site is represented by 90 lists of sorted distances capturing shape and chemical nature of the site. The sorted arrays are then aligned using an incremental alignment method and scored to obtain PMScores for pairs of sites. A comprehensive sensitivity analysis and an extensive validation of the algorithm have been carried out. A comparison with other site matching algorithms is also presented. Perturbation studies where the geometry of a given site was retained but the residue types were changed randomly, indicated that chance similarities were virtually non-existent. Our analysis also demonstrates that shape information alone is insufficient to discriminate between diverse binding sites, unless combined with chemical nature of amino acids. CONCLUSION: A new algorithm has been developed to compare binding sites in accurate, efficient and high-throughput manner. Though the representation used is conceptually simplistic, we demonstrate that along with the new alignment strategy used, it is sufficient to enable binding comparison with high sensitivity. Novel methodology has also been presented for validating the algorithm for accuracy and sensitivity with respect to geometry and chemical nature of the site. The method is also fast and takes about 1/250(th )second for one comparison on a single processor. A parallel version on BlueGene has also been implemented. BioMed Central 2008-12-17 /pmc/articles/PMC2639437/ /pubmed/19091072 http://dx.doi.org/10.1186/1471-2105-9-543 Text en Copyright © 2008 Yeturu and Chandra; 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 Methodology Article
Yeturu, Kalidas
Chandra, Nagasuma
PocketMatch: A new algorithm to compare binding sites in protein structures
title PocketMatch: A new algorithm to compare binding sites in protein structures
title_full PocketMatch: A new algorithm to compare binding sites in protein structures
title_fullStr PocketMatch: A new algorithm to compare binding sites in protein structures
title_full_unstemmed PocketMatch: A new algorithm to compare binding sites in protein structures
title_short PocketMatch: A new algorithm to compare binding sites in protein structures
title_sort pocketmatch: a new algorithm to compare binding sites in protein structures
topic Methodology Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2639437/
https://www.ncbi.nlm.nih.gov/pubmed/19091072
http://dx.doi.org/10.1186/1471-2105-9-543
work_keys_str_mv AT yeturukalidas pocketmatchanewalgorithmtocomparebindingsitesinproteinstructures
AT chandranagasuma pocketmatchanewalgorithmtocomparebindingsitesinproteinstructures