权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

Refinement Methods for Protein Docking based on Exploring Multi-Dimensional Energ

基于探索多维能量的蛋白质对接细化方法

基本信息

批准号：
8633467
负责人：
Dmytro Kozakov
金额：
$ 31.6万
依托单位：
BOSTON UNIVERSITY (CHARLES RIVER CAMPUS)
依托单位国家：
美国
项目类别：
财政年份：
2010
资助国家：
美国
起止时间：
2010-04-01 至 2016-03-31
项目状态：
已结题

来源：
https://reporter.nih.gov/project-details/8633467
关键词：
Accounting Address Adopted Algorithms Benchmarking Binding Biological Combinatorial Optimization Communities Complex Computer software Computing Methodologies Data Data Quality Decision Theory Development Dill Dimensions Discrimination Docking Electrostatics Elements Evaluation Exhibits Fourier Transform Free Energy Gene Expression Regulation Generations Geometry Goals Grant Hand Health Immune response Knowledge Lead Libraries Ligands Link Machine Learning Maintenance Maps Metabolic Control Methods Metric Modeling Molecular Conformation Monte Carlo Method Motion Motivation Movement National Institute of General Medical Sciences Paper Pathway interactions Plant Roots Positioning Attribute Potential Energy Probability Process Proteins Protocols documentation Published Comment Reporting Research Rotation Sampling Scoring Method Shapes Side Signal Transduction Simulate Staging Structure Techniques Time Transduction Gene Translating Translations Ursidae Family Vertebral column Work Writing base biophysical properties cost experience flexibility improved interest programs protein complex protein folding protein protein interaction prototype receptor research study screening success theories

项目摘要

DESCRIPTION (provided by applicant): All successful state-of-the-art protein docking methods employ a so called multistage approach. At the first stage of such approaches a rough energy potential is used to score billions of conformations. At a second stage, thousands of conformations with the best scores are retained and clustered based on a certain similarity metric. Cluster centers correspond to putative predictions/models. Recent work by the proposing team demonstrated that greater prediction quality can be achieved by properly exploring these clusters through a process called refinement. This work resulted in the development of a prototype refinement approach - the Semi-Definite programming-based Underestimation method (SDU). The central goal of the project is to build on the SDU success and develop a new high-throughput refinement protocol able to produce predictions of near-crystallographic quality in the most computationally efficient manner. Efficiency will be achieved by leveraging the funnel-like shape that binding free energy potentials exhibit. The specific aims are: (1) the development of a new clustering method that can classify the conformations retained from a first-stage method into clusters suitable for the proposed refinement strategy; (2) the characterization of the structure of the multi-dimensional funnel corresponding to each cluster and the development of an efficient refinement strategy to explore this funnel; (3) the development of a side-chain positioning algorithm appropriate for docking by leveraging Markov random field theory; and (4) the dissemination of the algorithms developed through the release to the research community of a software package and an automated refinement server. It is anticipated that the computational efficiency gains of the proposed refinement protocol over alternative Monte Carlo methods will exceed two orders of magnitude, while, at the same time, significantly improve upon the accuracy achieved by earlier refinement approaches. A novelty of the proposed work is in its use of sophisticated machinery from the fields of optimization and decision theory specially tailored to the biophysical properties of the docking problem. Techniques from convex and combinatorial optimization, machine learning, and Markov random fields are brought to bear on the refinement stage of multistage protein docking approaches. An important element of the work is the systematic characterization of multi-dimensional binding energy funnels. The existence of such funnels has been long conjectured but it has not led to new docking approaches so far. The proposed algorithms essentially achieve this goal by devising efficient strategies to identify, characterize, and explore these funnels.

描述（由申请人提供）：所有成功的最先进的蛋白质对接方法都采用所谓的多阶段方法。在这种方法的第一阶段，使用粗略的能量势来对数十亿的构象进行评分。在第二阶段，保留具有最佳分数的数千个构象，并基于一定的相似性度量进行聚类。聚类中心对应于假定的预测/模型。提案团队最近的工作表明，通过一个称为细化的过程适当地探索这些集群，可以实现更高的预测质量。这项工作导致了一个原型细化方法的发展-半定规划为基础的低估方法（SDU）。该项目的中心目标是在SDU成功的基础上，开发一种新的高通量细化方案，能够以最有效的计算方式预测近晶体学质量。效率将通过利用结合自由能势表现出的漏斗状形状来实现。具体目标是：（1）开发了一种新的聚类方法，该方法可以将从第一阶段方法保留的构象分类为适合于所提出的细化策略的簇;（2）表征对应于每个簇的多维漏斗的结构，并开发了一种有效的细化策略来探索该漏斗;（3）通过利用马尔可夫随机场理论开发适合对接的侧链定位算法;以及（4）通过向研究界发布软件包和自动细化服务器来传播所开发的算法。预计所提出的改进协议在替代蒙特卡罗方法的计算效率增益将超过两个数量级，而在同一时间，显着提高早期的改进方法所实现的精度。所提出的工作的一个新奇在于它使用了专门针对对接问题的生物物理特性的优化和决策理论领域的复杂机械。从凸优化和组合优化，机器学习，马尔可夫随机场的技术带来的影响多级蛋白质对接方法的细化阶段。这项工作的一个重要组成部分是多维结合能漏斗的系统表征。这种漏斗的存在已经被证明很久了，但到目前为止，它还没有导致新的对接方法。所提出的算法基本上通过设计有效的策略来识别，表征和探索这些漏斗来实现这一目标。

项目成果

期刊论文数量（8）

专著数量（0）

科研奖励数量（0）

会议论文数量（0）

专利数量（0）

A Message-Passing Algorithm for Wireless Network Scheduling.

DOI：
10.1109/tnet.2014.2338277
发表时间：
2015-10
期刊：
IEEE/ACM transactions on networking : a joint publication of the IEEE Communications Society, the IEEE Computer Society, and the ACM with its Special Interest Group on Data Communication
影响因子：
0
作者：
Paschalidis IC;Huang F;Lai W
通讯作者：
Lai W

Predicting and evaluating the effect of bivalirudin in cardiac surgical patients.

预测和评估比伐卢定在心脏手术患者中的效果。

DOI：
10.1109/tbme.2013.2280636
发表时间：
2014
期刊：
IEEE transactions on bio-medical engineering
影响因子：
0
作者：
Zhao,Qi;Edrich,Thomas;Paschalidis,IoannisCh
通讯作者：
Paschalidis,IoannisCh

A Predictive Model for the Anticoagulant Bivalirudin Administered to Cardiac Surgical Patients.

DOI：
10.1109/cdc.2013.6759869
发表时间：
2013
期刊：
Proceedings of the ... IEEE Conference on Decision & Control. IEEE Conference on Decision & Control
影响因子：
0
作者：
Zhao Q;Edrich T;Paschalidis IC
通讯作者：
Paschalidis IC

Inverse Optimization: A New Perspective on the Black-Litterman Model.