• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

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

立即免费搜索

文件翻译

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

免费翻译文档

深度研究

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

立即免费体验

用于消除死端的改进剪枝算法和分治法策略及其在蛋白质设计中的应用。

Improved Pruning algorithms and Divide-and-Conquer strategies for Dead-End Elimination, with application to protein design.

作者信息

Georgiev Ivelin, Lilien Ryan H, Donald Bruce R

机构信息

Dartmouth Computer Science Department, Hanover, NH 03755, USA.

出版信息

Bioinformatics. 2006 Jul 15;22(14):e174-83. doi: 10.1093/bioinformatics/btl220.

DOI:10.1093/bioinformatics/btl220
PMID:16873469
Abstract

MOTIVATION

Structure-based protein redesign can help engineer proteins with desired novel function. Improving computational efficiency while still maintaining the accuracy of the design predictions has been a major goal for protein design algorithms. The combinatorial nature of protein design results both from allowing residue mutations and from the incorporation of protein side-chain flexibility. Under the assumption that a single conformation can model protein folding and binding, the goal of many algorithms is the identification of the Global Minimum Energy Conformation (GMEC). A dominant theorem for the identification of the GMEC is Dead-End Elimination (DEE). DEE-based algorithms have proven capable of eliminating the majority of candidate conformations, while guaranteeing that only rotamers not belonging to the GMEC are pruned. However, when the protein design process incorporates rotameric energy minimization, DEE is no longer provably-accurate. Hence, with energy minimization, the minimized-DEE (MinDEE) criterion must be used instead.

RESULTS

In this paper, we present provably-accurate improvements to both the DEE and MinDEE criteria. We show that our novel enhancements result in a speedup of up to a factor of more than 1000 when applied in redesign for three different proteins: Gramicidin Synthetase A, plastocyanin, and protein G.

AVAILABILITY

Contact authors for source code.

摘要

动机

基于结构的蛋白质重新设计有助于构建具有所需新功能的蛋白质。在保持设计预测准确性的同时提高计算效率一直是蛋白质设计算法的主要目标。蛋白质设计的组合性质既源于允许残基突变,也源于蛋白质侧链柔性的纳入。在单个构象可以模拟蛋白质折叠和结合的假设下,许多算法的目标是识别全局最小能量构象(GMEC)。识别GMEC的一个主导定理是死端消除(DEE)。基于DEE的算法已被证明能够消除大多数候选构象,同时保证仅修剪不属于GMEC的旋转异构体。然而,当蛋白质设计过程纳入旋转异构体能量最小化时,DEE不再能保证准确。因此,在进行能量最小化时,必须使用最小化DEE(MinDEE)标准。

结果

在本文中,我们提出了对DEE和MinDEE标准的可证明准确的改进。我们表明,当应用于三种不同蛋白质(短杆菌肽合成酶A、质体蓝素和蛋白G)的重新设计时,我们的新颖改进可使速度提高多达1000倍。

可用性

如需源代码,请联系作者。

相似文献

1
Improved Pruning algorithms and Divide-and-Conquer strategies for Dead-End Elimination, with application to protein design.用于消除死端的改进剪枝算法和分治法策略及其在蛋白质设计中的应用。
Bioinformatics. 2006 Jul 15;22(14):e174-83. doi: 10.1093/bioinformatics/btl220.
2
Dead-end elimination with backbone flexibility.具有主链灵活性的末端消除
Bioinformatics. 2007 Jul 1;23(13):i185-94. doi: 10.1093/bioinformatics/btm197.
3
The minimized dead-end elimination criterion and its application to protein redesign in a hybrid scoring and search algorithm for computing partition functions over molecular ensembles.最小化死端消除标准及其在用于计算分子系综配分函数的混合评分与搜索算法中对蛋白质重新设计的应用。
J Comput Chem. 2008 Jul 30;29(10):1527-42. doi: 10.1002/jcc.20909.
4
Dead-end elimination for multistate protein design.多状态蛋白质设计中的死端消除
J Comput Chem. 2007 Oct;28(13):2122-9. doi: 10.1002/jcc.20661.
5
Trading accuracy for speed: A quantitative comparison of search algorithms in protein sequence design.用准确性换取速度:蛋白质序列设计中搜索算法的定量比较。
J Mol Biol. 2000 Jun 9;299(3):789-803. doi: 10.1006/jmbi.2000.3758.
6
Protein design for diversity of sequences and conformations using dead-end elimination.利用死端消除法进行序列和构象多样性的蛋白质设计。
Methods Mol Biol. 2012;899:127-44. doi: 10.1007/978-1-61779-921-1_8.
7
Restricted dead-end elimination: protein redesign with a bounded number of residue mutations.限制无出路消除:具有有限数量残基突变的蛋白质重新设计。
J Comput Chem. 2010 Apr 30;31(6):1207-15. doi: 10.1002/jcc.21407.
8
Accurate prediction for atomic-level protein design and its application in diversifying the near-optimal sequence space.原子水平蛋白质设计的准确预测及其在扩展近最优序列空间中的应用。
Proteins. 2009 May 15;75(3):682-705. doi: 10.1002/prot.22280.
9
Developing a move-set for protein model refinement.开发用于蛋白质模型优化的移动集。
Bioinformatics. 2006 Aug 1;22(15):1838-45. doi: 10.1093/bioinformatics/btl192. Epub 2006 May 16.
10
Computer-based design of novel protein structures.基于计算机的新型蛋白质结构设计。
Annu Rev Biophys Biomol Struct. 2006;35:49-65. doi: 10.1146/annurev.biophys.35.040405.102046.

引用本文的文献

1
Novel, provable algorithms for efficient ensemble-based computational protein design and their application to the redesign of the c-Raf-RBD:KRas protein-protein interface.用于高效基于集成的计算蛋白质设计的新颖、可证明的算法及其在 c-Raf-RBD:KRas 蛋白质-蛋白质界面重新设计中的应用。
PLoS Comput Biol. 2020 Jun 8;16(6):e1007447. doi: 10.1371/journal.pcbi.1007447. eCollection 2020 Jun.
2
Minimization-Aware Recursive A Novel, Provable Algorithm that Accelerates Ensemble-Based Protein Design and Provably Approximates the Energy Landscape.最小化感知递归算法——一种新颖的、可证明的算法,可加速基于集合的蛋白质设计并可证明逼近能量景观。
J Comput Biol. 2020 Apr;27(4):550-564. doi: 10.1089/cmb.2019.0315. Epub 2019 Dec 6.
3
Computational Analysis of Energy Landscapes Reveals Dynamic Features That Contribute to Binding of Inhibitors to CFTR-Associated Ligand.
计算能量景观分析揭示了有助于抑制剂与 CFTR 相关配体结合的动态特征。
J Phys Chem B. 2019 Dec 12;123(49):10441-10455. doi: 10.1021/acs.jpcb.9b07278. Epub 2019 Nov 27.
4
OSPREY 3.0: Open-source protein redesign for you, with powerful new features.OSPREY 3.0:开源蛋白质设计软件,拥有强大的新功能。
J Comput Chem. 2018 Nov 15;39(30):2494-2507. doi: 10.1002/jcc.25522. Epub 2018 Oct 14.
5
BBK* (Branch and Bound Over K*): A Provable and Efficient Ensemble-Based Protein Design Algorithm to Optimize Stability and Binding Affinity Over Large Sequence Spaces.BBK*(基于K*的分支定界法):一种可证明的、高效的基于集成的蛋白质设计算法,用于在大序列空间中优化稳定性和结合亲和力。
J Comput Biol. 2018 Jul;25(7):726-739. doi: 10.1089/cmb.2017.0267. Epub 2018 Mar 13.
6
A critical analysis of computational protein design with sparse residue interaction graphs.基于稀疏残基相互作用图的计算蛋白质设计的批判性分析
PLoS Comput Biol. 2017 Mar 30;13(3):e1005346. doi: 10.1371/journal.pcbi.1005346. eCollection 2017 Mar.
7
Mapping Polyclonal HIV-1 Antibody Responses via Next-Generation Neutralization Fingerprinting.通过下一代中和指纹图谱绘制多克隆HIV-1抗体反应
PLoS Pathog. 2017 Jan 4;13(1):e1006148. doi: 10.1371/journal.ppat.1006148. eCollection 2017 Jan.
8
Parallel Computational Protein Design.并行计算蛋白质设计
Methods Mol Biol. 2017;1529:265-277. doi: 10.1007/978-1-4939-6637-0_13.
9
cOSPREY: A Cloud-Based Distributed Algorithm for Large-Scale Computational Protein Design.鱼鹰:一种用于大规模计算蛋白质设计的基于云的分布式算法。
J Comput Biol. 2016 Sep;23(9):737-49. doi: 10.1089/cmb.2015.0234. Epub 2016 May 6.
10
comets (Constrained Optimization of Multistate Energies by Tree Search): A Provable and Efficient Protein Design Algorithm to Optimize Binding Affinity and Specificity with Respect to Sequence.彗星算法(通过树搜索进行多状态能量的约束优化):一种用于优化结合亲和力和序列特异性的可证明且高效的蛋白质设计算法。
J Comput Biol. 2016 May;23(5):311-21. doi: 10.1089/cmb.2015.0188. Epub 2016 Jan 13.