arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.01975q-bio.QM
收藏

一种新的基于熵的层次聚类框架用于超快蛋白质结构搜索和比对

A novel entropy-based hierarchical clustering framework for ultrafast protein structure search and alignment

Barış Ekim

摘要:

蛋白质的三维折叠的鉴定和比对可以产生关于通过常规方法(例如序列比较)检测到的太遥远的关系的有用信息,并且可能潜在地导致预测共同结构片段中的模式和基序。随着结构蛋白质组学数据的指数级增长,以数据增长率为尺度的方法失去了效率。因此,应该开发新的方法,减少这个问题的计算费用。我们提出了一个新的框架,通过它,我们能够通过层次聚类和基于熵的查询搜索,找到和对齐蛋白质结构的邻居,并提出了一个基于Web的蛋白质数据库搜索和对齐工具,以证明我们的方法的适用性。由此产生的方法复制了当前金标准的结果,在显著更短的时间内灵敏度损失最小,同时改善了现有的基于定制和动态网络环境的蛋白质结构比较的网络工作空间。我们的工具既是蛋白质结构比较的功能性工业手段,也是蛋白质组学中化学的有效演示。

英文摘要:

Identification and alignment of three-dimensional folding of proteins may yield useful information about relationships too remote to be detected by conventional methods, such as sequence comparison, and may potentially lead to prediction of patterns and motifs in mutual structural fragments. With the exponential increase of structural proteomics data, the methods that scale with the rate of increase of data lose efficiency. Hence, new methods that reduce the computational expense of this problem should be developed. We present a novel framework through which we are able to find and align protein structure neighbors via hierarchical clustering and entropy-based query search, and present a web-based protein database search and alignment tool to demonstrate the applicability of our approach. The resulting method replicates the results of the current gold standard with a minimal loss in sensitivity in a significantly shorter amount of time, while ameliorating the existing web workspace of protein structure comparison with a customized and dynamic web-based environment. Our tool serves as both a functional industrial means of protein structure comparison and a valid demonstration of heuristics in proteomics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑