Design of Protein-Protein Interactions with a Novel Ensemble-Based Scoring Algorithm

被引:0
|
作者
Roberts, Kyle E. [1 ]
Cushing, Patrick R. [3 ]
Boisguerin, Prisca
Madden, Dean R. [3 ,4 ]
Donald, Bruce R. [1 ,2 ]
机构
[1] Duke Univ, Dept Comp Sci, Durham, NC 27708 USA
[2] Duke Univ, Ctr Med, Dept Biochem, Durham, NC 27708 USA
[3] Dartmouth Coll, Sch Med, Dept Biochem, Hanover, NH 03755 USA
[4] Charite, Inst Med Immunol, D-10115 Berlin, Germany
基金
美国国家卫生研究院;
关键词
DEAD-END-ELIMINATION; SIDE-CHAINS; INTERACTION SPECIFICITY; ROTAMER OPTIMIZATION; COMPUTATIONAL DESIGN; BINDING AFFINITIES; CYSTIC-FIBROSIS; CONFORMATION; REDESIGN; SEARCH;
D O I
暂无
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Protein-protein interactions (PPIs) are vital for cell signaling, protein trafficking and localization, gene expression, and many other biological functions. Rational modification of PPI targets provides a mechanism to understand their function and importance. However, PPI systems often have many more degrees of freedom and flexibility than the small-molecule binding sites typically targeted by protein design algorithms. To handle these challenging design systems, we have built upon the computational protein design algorithm K* [8,19] to develop a new design algorithm to study protein-protein and protein-peptide interactions. We validated our algorithm through the design and experimental testing of novel peptide inhibitors. Previously, K* required that a complete partition function be computed for one member of the designed protein complex. While this requirement is generally obtainable for active-site designs, PPI systems are often much larger, precluding the exact determination of the partition function. We have developed proofs that show that the new K* algorithm combinatorially prunes the protein sequence and conformation space and guarantees that a provably-accurate epsilon-approximation to the K* score can be computed. These new proofs yield new algorithms to better model large protein systems, which have been integrated into the K* code base. K* computationally searches for sequence mutations that will optimize the affinity of a given protein complex. The algorithm scores a single protein complex sequence by computing Boltzmann-weighted partition functions over structural molecular ensembles and taking a ratio of the partition functions to find provably-accurate e-approximations to the K* score, which predicts the binding constant. The K* algorithm uses several provable methods to guarantee that it finds the gap-free optimal sequences for the designed protein complex. The algorithm allows for flexible minimization during the conformational search while still maintaining provable guarantees by using the minimization-aware dead-end elimination criterion, minDEE. Further pruning conditions are applied to fully explore the sequence and conformation space. To demonstrate the ability of K* to design protein-peptide interactions, we applied the ensemble-based design algorithm to the CFTR-associated ligand, CAL, which binds to the C-terminus of CFTR, the chloride channel mutated in human patients with cystic fibrosis. K* was retrospectively used to search over a set of peptide ligands that can inhibit the CAL-CFTR interaction, and K* successfully enriched for peptide inhibitors of CAL. We then used K* to prospectively design novel inhibitor peptides. The top-ranked K*-designed peptide inhibitors were experimentally validated in the wet lab and, remarkably, all bound with mu M affinity. The top inhibitor bound with seven-fold higher affinity than the best hexamer peptide inhibitor previously available and with 331-fold higher affinity than the CFTR C-terminus.
引用
收藏
页码:361 / +
页数:4
相关论文
共 50 条
  • [1] Predicting Protein-Protein Interactions based on ensemble classifiers
    Zhou, Zheng-Rong
    Song, Xiao-Feng
    Wang, Ming-Hao
    [J]. Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2010, 38 (06): : 1464 - 1467
  • [2] Scoring functions for protein-protein interactions
    Moal, Iain H.
    Moretti, Rocco
    Baker, David
    Fernandez-Recio, Juan
    [J]. CURRENT OPINION IN STRUCTURAL BIOLOGY, 2013, 23 (06) : 862 - 867
  • [3] 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
    Lowegard, Anna U.
    Frenkel, Marcel S.
    Holt, Graham T.
    Jou, Jonathan D.
    Ojewole, Adegoke A.
    Donald, Bruce R.
    [J]. PLOS COMPUTATIONAL BIOLOGY, 2020, 16 (06)
  • [4] BWM*: A Novel, Provable, Ensemble-Based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design
    Jou, Jonathan D.
    Jain, Swati
    Georgiev, Ivelin
    Donald, Bruce R.
    [J]. RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY (RECOMB 2015), 2015, 9029 : 154 - 166
  • [5] BWM: A Novel, Provable, Ensemble-based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design
    Jou, Jonathan D.
    Jain, Swati
    Georgiev, Ivelin S.
    Donald, Bruce R.
    [J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 2016, 23 (06) : 413 - 424
  • [6] Surface Fingerprinting for the Design of Novel Protein-Protein Interactions
    Marchand, Anthony
    Gainza, Pablo
    Wehrle, Sarah
    Van Hall-Beauvais, Alexandra
    Scheck, Andreas
    Correia, Bruno
    [J]. PROTEIN SCIENCE, 2023, 32 (12)
  • [7] Development of novel iterative knowledge-based scoring functions for protein-ligand and protein-protein interactions
    Zou, Xiaoqin
    [J]. ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2009, 237
  • [8] An iterative knowledge-based scoring function for protein-protein interactions
    Huang, Shengyou
    Zou, Xiaoqin
    [J]. BIOPHYSICAL JOURNAL, 2007, : 221A - 221A
  • [9] Protein Coadaptation and the Design of Novel Approaches to Identify Protein-Protein Interactions
    Fares, Mario A.
    Ruiz-Gonzalez, Mario X.
    Labrador, Juan Pablo
    [J]. IUBMB LIFE, 2011, 63 (04) : 264 - 271
  • [10] Protein-protein interactions prediction based on ensemble deep neural networks
    Zhang, Long
    Yu, Guoxian
    Xia, Dawen
    Wang, Jun
    [J]. NEUROCOMPUTING, 2019, 324 : 10 - 19