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

Yeturu, Kalidas and Chandra, Nagasuma (2008) PocketMatch: A new algorithm to compare binding sites in protein structures. In: BMC Bioinformatics, 9 . pp. 543-560.

PDF 6.pdf - Published Version Restricted to Registered users only Download (2MB) | Request a copy

Abstract

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.

Item Type:	Journal Article
Publication:	BMC Bioinformatics
Publisher:	BioMed Central
Additional Information:	Copyright of this article belongs to BioMed Central.
Department/Centre:	Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre Division of Information Sciences (Doesn't exist now) > BioInformatics Centre
Date Deposited:	13 Nov 2009 11:44
Last Modified:	19 Sep 2010 05:29
URI:	http://eprints.iisc.ac.in/id/eprint/19653

Actions (login required)

View Item