Suppr超能文献

口袋匹配:一种比较蛋白质结构中结合位点的新算法。

PocketMatch: a new algorithm to compare binding sites in protein structures.

作者信息

Yeturu Kalidas, Chandra Nagasuma

机构信息

Bioinformatics Centre and Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore, India.

出版信息

BMC Bioinformatics. 2008 Dec 17;9:543. doi: 10.1186/1471-2105-9-543.

Abstract

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/250th second for one comparison on a single processor. A parallel version on BlueGene has also been implemented.

摘要

背景

识别蛋白质分子之间的相似性并推导其关系是当代生物学的一项基本要求。相似性可存在于不同层次,可通过比较蛋白质序列或其结构折叠来检测。在某些情况下,在这些层次上不明显的相似性可能仅存在于它们结合位点的亚结构中。通过比较蛋白质分子的结合位点来推断功能相似性在很大程度上仍处于探索阶段,尚未成为常规方法。造成这种情况的主要原因之一是在选择能够高灵敏度比较结合位点的合适分析工具方面存在局限性。为了从快速积累的大量结构数据中受益,拥有能够进行大规模结合位点比较的高通量工具至关重要。

结果

在此,我们提出一种新算法PocketMatch,用于以帧不变的方式比较结合位点。每个结合位点由90个排序距离列表表示,这些列表捕获了位点的形状和化学性质。然后使用增量比对方法对齐排序后的数组,并进行评分以获得位点对的PMScores。已对该算法进行了全面的灵敏度分析和广泛验证。还与其他位点匹配算法进行了比较。扰动研究表明,在保留给定位点几何形状但随机改变残基类型的情况下,几乎不存在偶然相似性。我们的分析还表明,除非与氨基酸的化学性质相结合,仅形状信息不足以区分不同的结合位点。

结论

已开发出一种新算法,能够以准确、高效和高通量的方式比较结合位点。尽管所使用的表示在概念上很简单,但我们证明,连同所使用的新比对策略,足以实现高灵敏度的结合比较。还提出了新的方法来验证该算法在位点几何形状和化学性质方面的准确性和灵敏度。该方法也很快,在单个处理器上进行一次比较大约需要1/250秒。还在BlueGene上实现了并行版本。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5a14/2639437/07c8c4ded39e/1471-2105-9-543-1.jpg

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验