IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1007447.html
   My bibliography  Save this article

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

Author

Listed:
  • Anna U Lowegard
  • Marcel S Frenkel
  • Graham T Holt
  • Jonathan D Jou
  • Adegoke A Ojewole
  • Bruce R Donald

Abstract

The K* algorithm provably approximates partition functions for a set of states (e.g., protein, ligand, and protein-ligand complex) to a user-specified accuracy ε. Often, reaching an ε-approximation for a particular set of partition functions takes a prohibitive amount of time and space. To alleviate some of this cost, we introduce two new algorithms into the osprey suite for protein design: fries, a Fast Removal of Inadequately Energied Sequences, and EWAK*, an Energy Window Approximation to K*. fries pre-processes the sequence space to limit a design to only the most stable, energetically favorable sequence possibilities. EWAK* then takes this pruned sequence space as input and, using a user-specified energy window, calculates K* scores using the lowest energy conformations. We expect fries/EWAK* to be most useful in cases where there are many unstable sequences in the design sequence space and when users are satisfied with enumerating the low-energy ensemble of conformations. In combination, these algorithms provably retain calculational accuracy while limiting the input sequence space and the conformations included in each partition function calculation to only the most energetically favorable, effectively reducing runtime while still enriching for desirable sequences. This combined approach led to significant speed-ups compared to the previous state-of-the-art multi-sequence algorithm, BBK*, while maintaining its efficiency and accuracy, which we show across 40 different protein systems and a total of 2,826 protein design problems. Additionally, as a proof of concept, we used these new algorithms to redesign the protein-protein interface (PPI) of the c-Raf-RBD:KRas complex. The Ras-binding domain of the protein kinase c-Raf (c-Raf-RBD) is the tightest known binder of KRas, a protein implicated in difficult-to-treat cancers. fries/EWAK* accurately retrospectively predicted the effect of 41 different sets of mutations in the PPI of the c-Raf-RBD:KRas complex. Notably, these mutations include mutations whose effect had previously been incorrectly predicted using other computational methods. Next, we used fries/EWAK* for prospective design and discovered a novel point mutation that improves binding of c-Raf-RBD to KRas in its active, GTP-bound state (KRasGTP). We combined this new mutation with two previously reported mutations (which were highly-ranked by osprey) to create a new variant of c-Raf-RBD, c-Raf-RBD(RKY). fries/EWAK* in osprey computationally predicted that this new variant binds even more tightly than the previous best-binding variant, c-Raf-RBD(RK). We measured the binding affinity of c-Raf-RBD(RKY) using a bio-layer interferometry (BLI) assay, and found that this new variant exhibits single-digit nanomolar affinity for KRasGTP, confirming the computational predictions made with fries/EWAK*. This new variant binds roughly five times more tightly than the previous best known binder and roughly 36 times more tightly than the design starting point (wild-type c-Raf-RBD). This study steps through the advancement and development of computational protein design by presenting theory, new algorithms, accurate retrospective designs, new prospective designs, and biochemical validation.Author summary: Computational structure-based protein design is an innovative tool for redesigning proteins to introduce a particular or novel function. One such function is improving the binding of one protein to another, which can increase our understanding of important protein systems. Herein we introduce two novel, provable algorithms, fries and EWAK*, for more efficient computational structure-based protein design as well as their application to the redesign of the c-Raf-RBD:KRas protein-protein interface. These new algorithms speed-up computational structure-based protein design while maintaining accurate calculations, allowing for larger, previously infeasible protein designs. Additionally, using fries and EWAK* within the osprey suite, we designed the tightest known binder of KRas, a heavily studied cancer target that interacts with a number of different proteins. This previously undiscovered variant of a KRas-binding domain, c-Raf-RBD, has potential to serve as a tool to further probe the protein-protein interface of KRas with its effectors and its discovery alone emphasizes the potential for more successful applications of computational structure-based protein design.

Suggested Citation

  • Anna U Lowegard & Marcel S Frenkel & Graham T Holt & Jonathan D Jou & Adegoke A Ojewole & Bruce R Donald, 2020. "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," PLOS Computational Biology, Public Library of Science, vol. 16(6), pages 1-27, June.
  • Handle: RePEc:plo:pcbi00:1007447
    DOI: 10.1371/journal.pcbi.1007447
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1007447
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1007447&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1007447?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Pablo Gainza & Kyle E Roberts & Bruce R Donald, 2012. "Protein Design Using Continuous Rotamers," PLOS Computational Biology, Public Library of Science, vol. 8(1), pages 1-15, January.
    2. Shiou-Ru Tzeng & Charalampos G. Kalodimos, 2012. "Protein activity regulation by conformational entropy," Nature, Nature, vol. 488(7410), pages 236-240, August.
    3. Kyle E Roberts & Patrick R Cushing & Prisca Boisguerin & Dean R Madden & Bruce R Donald, 2012. "Computational Design of a PDZ Domain Peptide Inhibitor that Rescues CFTR Activity," PLOS Computational Biology, Public Library of Science, vol. 8(4), pages 1-12, April.
    4. Bernard Chazelle & Carl Kingsford & Mona Singh, 2004. "A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies," INFORMS Journal on Computing, INFORMS, vol. 16(4), pages 380-392, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Swati Jain & Jonathan D Jou & Ivelin S Georgiev & Bruce R Donald, 2017. "A critical analysis of computational protein design with sparse residue interaction graphs," PLOS Computational Biology, Public Library of Science, vol. 13(3), pages 1-30, March.
    2. Tek Narsingh Malla & Kara Zielinski & Luis Aldama & Sasa Bajt & Denisse Feliz & Brendon Hayes & Mark Hunter & Christopher Kupitz & Stella Lisova & Juraj Knoska & Jose Manuel Martin-Garcia & Valerio Ma, 2023. "Heterogeneity in M. tuberculosis β-lactamase inhibition by Sulbactam," Nature Communications, Nature, vol. 14(1), pages 1-15, December.
    3. Bin Fu & Zhixiang Chen, 2008. "Sublinear time width-bounded separators and their application to the protein side-chain packing problem," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 387-407, May.
    4. Khaled Daqrouq & Rami Alhmouz & Ahmed Balamesh & Adnan Memic, 2015. "Application of Wavelet Transform for PDZ Domain Classification," PLOS ONE, Public Library of Science, vol. 10(4), pages 1-16, April.
    5. Piotr Łukasiak & Jacek Błażewicz & Maciej Miłostan, 2010. "Some operations research methods for analyzing protein sequences and structures," Annals of Operations Research, Springer, vol. 175(1), pages 9-35, March.
    6. Joonghyun Ryu & Deok-Soo Kim, 2013. "Protein structure optimization by side-chain positioning via beta-complex," Journal of Global Optimization, Springer, vol. 57(1), pages 217-250, September.
    7. Xinxin Li & Ting Kei Pong & Hao Sun & Henry Wolkowicz, 2021. "A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem," Computational Optimization and Applications, Springer, vol. 78(3), pages 853-891, April.
    8. Tatu Pantsar & Sami Rissanen & Daniel Dauch & Tuomo Laitinen & Ilpo Vattulainen & Antti Poso, 2018. "Assessment of mutation probabilities of KRAS G12 missense mutants and their long-timescale dynamics by atomistic molecular simulations and Markov state modeling," PLOS Computational Biology, Public Library of Science, vol. 14(9), pages 1-23, September.
    9. Kyle E Roberts & Patrick R Cushing & Prisca Boisguerin & Dean R Madden & Bruce R Donald, 2012. "Computational Design of a PDZ Domain Peptide Inhibitor that Rescues CFTR Activity," PLOS Computational Biology, Public Library of Science, vol. 8(4), pages 1-12, April.
    10. Hu Ding & Branislav Stojkovic & Zihe Chen & Andrew Hughes & Lei Xu & Andrew Fritz & Nitasha Sehgal & Ronald Berezney & Jinhui Xu, 2016. "Chromatic kernel and its applications," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1298-1315, April.
    11. Forbes Burkowski & Yuen-Lam Cheung & Henry Wolkowicz, 2014. "Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 748-766, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pcbi00:1007447. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.