1
|
Guhe V, Singh S. Targeting peptide based therapeutics: Integrated computational and experimental studies of autophagic regulation in host-parasite interaction. ChemMedChem 2024; 19:e202300679. [PMID: 38317307 DOI: 10.1002/cmdc.202300679] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/03/2023] [Revised: 02/02/2024] [Accepted: 02/05/2024] [Indexed: 02/07/2024]
Abstract
Cutaneous leishmaniasis caused by the intracellular parasite Leishmania major, exhibits significant public health challenge worldwide. With limited treatment options available, the identification of novel therapeutic targets is of paramount importance. Present study manifested the crucial role of ATG8 protein as a potential target in combating L. major infection. Using machine learning algorithms, we identified non-conserved motifs within the ATG8 in L. major. Subsequently, a peptide library was generated based on these motifs, and three peptides were selected for further investigation through molecular docking and molecular dynamics simulations. Surface Plasmon Resonance (SPR) experiments confirmed the direct interaction between ATG8 and the identified peptides. Remarkably, these peptides demonstrated the ability to cross the parasite membrane and exert profound effects on L. major. Peptide treatment significantly impacted parasite survival, inducing alterations in the cell cycle and morphology. Furthermore, the peptides were found to modulate autophagosome formation, particularly under starved conditions, indicating their involvement in autophagy regulation within L. major. In vitro studies revealed that the selected peptides effectively decreased the parasite load within the infected host cells. Encouragingly, in vivo experiments corroborated these findings, demonstrating a reduction in parasite burden upon peptide administration. Additionally, the peptides were observed to affect the levels of LC3II, a known autophagy marker within the host cells. Collectively, our findings highlight the efficacy of these novel peptides in targeting L. major ATG8 and disrupting parasite survival, wherein P2 is showing prominent effect on L. major as compared to P1. These results provide valuable insights into the development of innovative therapeutic strategies against leishmaniasis.
Collapse
Affiliation(s)
- Vrushali Guhe
- Systems Medicine Lab, National Centre for Cell Science, NCCS Complex, Ganeshkhind, SP Pune University Campus, Pune, 411007, India Phone
| | - Shailza Singh
- Systems Medicine Lab, National Centre for Cell Science, NCCS Complex, Ganeshkhind, SP Pune University Campus, Pune, 411007, India Phone
| |
Collapse
|
2
|
Du S, Wankowicz SA, Yabukarski F, Doukov T, Herschlag D, Fraser JS. Refinement of multiconformer ensemble models from multi-temperature X-ray diffraction data. Methods Enzymol 2023; 688:223-254. [PMID: 37748828 PMCID: PMC10637719 DOI: 10.1016/bs.mie.2023.06.009] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 09/27/2023]
Abstract
Conformational ensembles underlie all protein functions. Thus, acquiring atomic-level ensemble models that accurately represent conformational heterogeneity is vital to deepen our understanding of how proteins work. Modeling ensemble information from X-ray diffraction data has been challenging, as traditional cryo-crystallography restricts conformational variability while minimizing radiation damage. Recent advances have enabled the collection of high quality diffraction data at ambient temperatures, revealing innate conformational heterogeneity and temperature-driven changes. Here, we used diffraction datasets for Proteinase K collected at temperatures ranging from 313 to 363 K to provide a tutorial for the refinement of multiconformer ensemble models. Integrating automated sampling and refinement tools with manual adjustments, we obtained multiconformer models that describe alternative backbone and sidechain conformations, their relative occupancies, and interconnections between conformers. Our models revealed extensive and diverse conformational changes across temperature, including increased bound peptide ligand occupancies, different Ca2+ binding site configurations and altered rotameric distributions. These insights emphasize the value and need for multiconformer model refinement to extract ensemble information from diffraction data and to understand ensemble-function relationships.
Collapse
Affiliation(s)
- Siyuan Du
- Department of Biochemistry, Stanford University, Stanford, CA, United States; Department of Chemistry, Stanford University, Stanford, CA, United States
| | - Stephanie A Wankowicz
- Department of Bioengineering and Therapeutic Sciences, University of California, San Francisco, CA, United States
| | - Filip Yabukarski
- Department of Biochemistry, Stanford University, Stanford, CA, United States; Bristol-Myers Squibb, San Diego, CA, United States
| | - Tzanko Doukov
- Stanford Synchrotron Radiation Lightsource, SLAC National Accelerator Laboratory, Menlo Park, CA, United States
| | - Daniel Herschlag
- Department of Biochemistry, Stanford University, Stanford, CA, United States; Department of Chemical Engineering, Stanford University, Stanford, CA, United States; Stanford ChEM-H, Stanford University, Stanford, CA, United States
| | - James S Fraser
- Department of Bioengineering and Therapeutic Sciences, University of California, San Francisco, CA, United States; Quantitative Biosciences Institute, University of California, San Francisco, CA, United States.
| |
Collapse
|
3
|
Du S, Wankowicz SA, Yabukarski F, Doukov T, Herschlag D, Fraser JS. Refinement of Multiconformer Ensemble Models from Multi-temperature X-ray Diffraction Data. BIORXIV : THE PREPRINT SERVER FOR BIOLOGY 2023:2023.05.05.539620. [PMID: 37205593 PMCID: PMC10187334 DOI: 10.1101/2023.05.05.539620] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/21/2023]
Abstract
Conformational ensembles underlie all protein functions. Thus, acquiring atomic-level ensemble models that accurately represent conformational heterogeneity is vital to deepen our understanding of how proteins work. Modeling ensemble information from X-ray diffraction data has been challenging, as traditional cryo-crystallography restricts conformational variability while minimizing radiation damage. Recent advances have enabled the collection of high quality diffraction data at ambient temperatures, revealing innate conformational heterogeneity and temperature-driven changes. Here, we used diffraction datasets for Proteinase K collected at temperatures ranging from 313 to 363K to provide a tutorial for the refinement of multiconformer ensemble models. Integrating automated sampling and refinement tools with manual adjustments, we obtained multiconformer models that describe alternative backbone and sidechain conformations, their relative occupancies, and interconnections between conformers. Our models revealed extensive and diverse conformational changes across temperature, including increased bound peptide ligand occupancies, different Ca2+ binding site configurations and altered rotameric distributions. These insights emphasize the value and need for multiconformer model refinement to extract ensemble information from diffraction data and to understand ensemble-function relationships.
Collapse
Affiliation(s)
- Siyuan Du
- Department of Biochemistry, Stanford University, Stanford, California 94305, United States
- Department of Chemistry, Stanford University, Stanford, California 94305, United States
| | - Stephanie A. Wankowicz
- Department of Bioengineering and Therapeutic Sciences, University of California, San Francisco, San Francisco, California 94143, United States
| | - Filip Yabukarski
- Department of Biochemistry, Stanford University, Stanford, California 94305, United States
- Bristol-Myers Squibb, San Diego, California 92121, United States
| | - Tzanko Doukov
- Stanford Synchrotron Radiation Lightsource, SLAC National Accelerator Laboratory, Menlo Park, California 94025, United States
| | - Daniel Herschlag
- Department of Biochemistry, Stanford University, Stanford, California 94305, United States
- Department of Chemical Engineering, Stanford University, Stanford, California 94305, United States
- Stanford ChEM-H, Stanford University, Stanford, California 94305, United States
| | - James S. Fraser
- Department of Bioengineering and Therapeutic Sciences, University of California, San Francisco, San Francisco, California 94143, United States
- Quantitative Biosciences Institute, University of California, San Francisco, California 94143, United States
| |
Collapse
|
4
|
Talluri S. Algorithms for protein design. ADVANCES IN PROTEIN CHEMISTRY AND STRUCTURAL BIOLOGY 2022; 130:1-38. [PMID: 35534105 DOI: 10.1016/bs.apcsb.2022.01.003] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
Computational Protein Design has the potential to contribute to major advances in enzyme technology, vaccine design, receptor-ligand engineering, biomaterials, nanosensors, and synthetic biology. Although Protein Design is a challenging problem, proteins can be designed by experts in Protein Design, as well as by non-experts whose primary interests are in the applications of Protein Design. The increased accessibility of Protein Design technology is attributable to the accumulated knowledge and experience with Protein Design as well as to the availability of software and online resources. The objective of this review is to serve as a guide to the relevant literature with a focus on the novel methods and algorithms that have been developed or applied for Protein Design, and to assist in the selection of algorithms for Protein Design. Novel algorithms and models that have been introduced to utilize the enormous amount of experimental data and novel computational hardware have the potential for producing substantial increases in the accuracy, reliability and range of applications of designed proteins.
Collapse
Affiliation(s)
- Sekhar Talluri
- Department of Biotechnology, GITAM, Visakhapatnam, India.
| |
Collapse
|
5
|
Opuu V, Mignon D, Simonson T. Knowledge-Based Unfolded State Model for Protein Design. Methods Mol Biol 2022; 2405:403-424. [PMID: 35298824 DOI: 10.1007/978-1-0716-1855-4_19] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 06/14/2023]
Abstract
The design of proteins and miniproteins is an important challenge. Designed variants should be stable, meaning the folded/unfolded free energy difference should be large enough. Thus, the unfolded state plays a central role. An extended peptide model is often used, where side chains interact with solvent and nearby backbone, but not each other. The unfolded energy is then a function of sequence composition only and can be empirically parametrized. If the space of sequences is explored with a Monte Carlo procedure, protein variants will be sampled according to a well-defined Boltzmann probability distribution. We can then choose unfolded model parameters to maximize the probability of sampling native-like sequences. This leads to a well-defined maximum likelihood framework. We present an iterative algorithm that follows the likelihood gradient. The method is presented in the context of our Proteus software, as a detailed downloadable tutorial. The unfolded model is combined with a folded model that uses molecular mechanics and a Generalized Born solvent. It was optimized for three PDZ domains and then used to redesign them. The sequences sampled are native-like and similar to a recent PDZ design study that was experimentally validated.
Collapse
Affiliation(s)
- Vaitea Opuu
- Laboratoire de Biologie Structurale de la Cellule (CNRS UMR7654), Ecole Polytechnique, Palaiseau, France
| | - David Mignon
- Laboratoire de Biologie Structurale de la Cellule (CNRS UMR7654), Ecole Polytechnique, Palaiseau, France
| | - Thomas Simonson
- Laboratoire de Biologie Structurale de la Cellule (CNRS UMR7654), Ecole Polytechnique, Palaiseau, France.
| |
Collapse
|
6
|
Revolutionizing enzyme engineering through artificial intelligence and machine learning. Emerg Top Life Sci 2021; 5:113-125. [PMID: 33835131 DOI: 10.1042/etls20200257] [Citation(s) in RCA: 15] [Impact Index Per Article: 5.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/17/2020] [Revised: 03/17/2021] [Accepted: 03/22/2021] [Indexed: 12/20/2022]
Abstract
The combinatorial space of an enzyme sequence has astronomical possibilities and exploring it with contemporary experimental techniques is arduous and often ineffective. Multi-target objectives such as concomitantly achieving improved selectivity, solubility and activity of an enzyme have narrow plausibility under approaches of restricted mutagenesis and combinatorial search. Traditional enzyme engineering approaches have a limited scope for complex optimization due to the requirement of a priori knowledge or experimental burden of screening huge protein libraries. The recent surge in high-throughput experimental methods including Next Generation Sequencing and automated screening has flooded the field of molecular biology with big-data, which requires us to re-think our concurrent approaches towards enzyme engineering. Artificial Intelligence (AI) and Machine Learning (ML) have great potential to revolutionize smart enzyme engineering without the explicit need for a complete understanding of the underlying molecular system. Here, we portray the role and position of AI techniques in the field of enzyme engineering along with their scope and limitations. In addition, we explain how the traditional approaches of directed evolution and rational design can be extended through AI tools. Recent successful examples of AI-assisted enzyme engineering projects and their deviation from traditional approaches are highlighted. A comprehensive picture of current challenges and future avenues for AI in enzyme engineering are also discussed.
Collapse
|
7
|
Bouchiba Y, Cortés J, Schiex T, Barbe S. Molecular flexibility in computational protein design: an algorithmic perspective. Protein Eng Des Sel 2021; 34:6271252. [PMID: 33959778 DOI: 10.1093/protein/gzab011] [Citation(s) in RCA: 7] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/21/2020] [Revised: 03/12/2021] [Accepted: 03/29/2021] [Indexed: 12/19/2022] Open
Abstract
Computational protein design (CPD) is a powerful technique for engineering new proteins, with both great fundamental implications and diverse practical interests. However, the approximations usually made for computational efficiency, using a single fixed backbone and a discrete set of side chain rotamers, tend to produce rigid and hyper-stable folds that may lack functionality. These approximations contrast with the demonstrated importance of molecular flexibility and motions in a wide range of protein functions. The integration of backbone flexibility and multiple conformational states in CPD, in order to relieve the inaccuracies resulting from these simplifications and to improve design reliability, are attracting increased attention. However, the greatly increased search space that needs to be explored in these extensions defines extremely challenging computational problems. In this review, we outline the principles of CPD and discuss recent effort in algorithmic developments for incorporating molecular flexibility in the design process.
Collapse
Affiliation(s)
- Younes Bouchiba
- Toulouse Biotechnology Institute, TBI, CNRS, INRAE, INSA, ANITI, Toulouse 31400, France.,Laboratoire d'Analyse et d'Architecture des Systèmes, LAAS CNRS, Université de Toulouse, CNRS, Toulouse 31400, France
| | - Juan Cortés
- Laboratoire d'Analyse et d'Architecture des Systèmes, LAAS CNRS, Université de Toulouse, CNRS, Toulouse 31400, France
| | - Thomas Schiex
- Université de Toulouse, ANITI, INRAE, UR MIAT, F-31320, Castanet-Tolosan, France
| | - Sophie Barbe
- Toulouse Biotechnology Institute, TBI, CNRS, INRAE, INSA, ANITI, Toulouse 31400, France
| |
Collapse
|
8
|
Michael E, Polydorides S, Simonson T, Archontis G. Hybrid MC/MD for protein design. J Chem Phys 2021; 153:054113. [PMID: 32770896 DOI: 10.1063/5.0013320] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/22/2023] Open
Abstract
Computational protein design relies on simulations of a protein structure, where selected amino acids can mutate randomly, and mutations are selected to enhance a target property, such as stability. Often, the protein backbone is held fixed and its degrees of freedom are modeled implicitly to reduce the complexity of the conformational space. We present a hybrid method where short molecular dynamics (MD) segments are used to explore conformations and alternate with Monte Carlo (MC) moves that apply mutations to side chains. The backbone is fully flexible during MD. As a test, we computed side chain acid/base constants or pKa's in five proteins. This problem can be considered a special case of protein design, with protonation/deprotonation playing the role of mutations. The solvent was modeled as a dielectric continuum. Due to cost, in each protein we allowed just one side chain position to change its protonation state and the other position to change its type or mutate. The pKa's were computed with a standard method that scans a range of pH values and with a new method that uses adaptive landscape flattening (ALF) to sample all protonation states in a single simulation. The hybrid method gave notably better accuracy than standard, fixed-backbone MC. ALF decreased the computational cost a factor of 13.
Collapse
Affiliation(s)
- Eleni Michael
- Department of Physics, University of Cyprus, P.O 20537, CY678 Nicosia, Cyprus
| | - Savvas Polydorides
- Department of Physics, University of Cyprus, P.O 20537, CY678 Nicosia, Cyprus
| | - Thomas Simonson
- Laboratoire de Biochimie (CNRS UMR7654), Ecole Polytechnique, Palaiseau, France
| | - Georgios Archontis
- Department of Physics, University of Cyprus, P.O 20537, CY678 Nicosia, Cyprus
| |
Collapse
|
9
|
Riley BT, Wankowicz SA, de Oliveira SHP, van Zundert GCP, Hogan DW, Fraser JS, Keedy DA, van den Bedem H. qFit 3: Protein and ligand multiconformer modeling for X-ray crystallographic and single-particle cryo-EM density maps. Protein Sci 2021; 30:270-285. [PMID: 33210433 PMCID: PMC7737783 DOI: 10.1002/pro.4001] [Citation(s) in RCA: 23] [Impact Index Per Article: 7.7] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/05/2020] [Revised: 11/10/2020] [Accepted: 11/17/2020] [Indexed: 01/04/2023]
Abstract
New X-ray crystallography and cryo-electron microscopy (cryo-EM) approaches yield vast amounts of structural data from dynamic proteins and their complexes. Modeling the full conformational ensemble can provide important biological insights, but identifying and modeling an internally consistent set of alternate conformations remains a formidable challenge. qFit efficiently automates this process by generating a parsimonious multiconformer model. We refactored qFit from a distributed application into software that runs efficiently on a small server, desktop, or laptop. We describe the new qFit 3 software and provide some examples. qFit 3 is open-source under the MIT license, and is available at https://github.com/ExcitedStates/qfit-3.0.
Collapse
Affiliation(s)
- Blake T. Riley
- Structural Biology InitiativeCUNY Advanced Science Research CenterNew YorkNew YorkUSA
| | - Stephanie A. Wankowicz
- Department of Bioengineering and Therapeutic SciencesUniversity of California San FranciscoSan FranciscoCaliforniaUSA
- Biophysics Graduate ProgramUniversity of California San FranciscoSan FranciscoCaliforniaUSA
| | | | | | - Daniel W. Hogan
- Department of Bioengineering and Therapeutic SciencesUniversity of California San FranciscoSan FranciscoCaliforniaUSA
| | - James S. Fraser
- Department of Bioengineering and Therapeutic SciencesUniversity of California San FranciscoSan FranciscoCaliforniaUSA
| | - Daniel A. Keedy
- Structural Biology InitiativeCUNY Advanced Science Research CenterNew YorkNew YorkUSA
- Department of Chemistry and BiochemistryCity College of New YorkNew YorkNew YorkUSA
- Ph.D. Programs in Biochemistry, Biology, and ChemistryThe Graduate Center, City University of New YorkNew YorkUSA
| | - Henry van den Bedem
- Department of Bioengineering and Therapeutic SciencesUniversity of California San FranciscoSan FranciscoCaliforniaUSA
- Atomwise, Inc.San FranciscoCaliforniaUSA
| |
Collapse
|
10
|
Mignon D, Druart K, Michael E, Opuu V, Polydorides S, Villa F, Gaillard T, Panel N, Archontis G, Simonson T. Physics-Based Computational Protein Design: An Update. J Phys Chem A 2020; 124:10637-10648. [DOI: 10.1021/acs.jpca.0c07605] [Citation(s) in RCA: 9] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/06/2023]
Affiliation(s)
- David Mignon
- Laboratoire de Biologie Structurale de la Cellule (CNRS UMR7654), Ecole Polytechnique, 91128 Palaiseau, France
| | - Karen Druart
- Laboratoire de Biologie Structurale de la Cellule (CNRS UMR7654), Ecole Polytechnique, 91128 Palaiseau, France
| | - Eleni Michael
- Department of Physics, University of Cyprus, PO20537, CY1678 Nicosia, Cyprus
| | - Vaitea Opuu
- Laboratoire de Biologie Structurale de la Cellule (CNRS UMR7654), Ecole Polytechnique, 91128 Palaiseau, France
| | - Savvas Polydorides
- Department of Physics, University of Cyprus, PO20537, CY1678 Nicosia, Cyprus
| | - Francesco Villa
- Laboratoire de Biologie Structurale de la Cellule (CNRS UMR7654), Ecole Polytechnique, 91128 Palaiseau, France
| | - Thomas Gaillard
- Laboratoire de Biologie Structurale de la Cellule (CNRS UMR7654), Ecole Polytechnique, 91128 Palaiseau, France
| | - Nicolas Panel
- Laboratoire de Biologie Structurale de la Cellule (CNRS UMR7654), Ecole Polytechnique, 91128 Palaiseau, France
| | - Georgios Archontis
- Department of Physics, University of Cyprus, PO20537, CY1678 Nicosia, Cyprus
| | - Thomas Simonson
- Laboratoire de Biologie Structurale de la Cellule (CNRS UMR7654), Ecole Polytechnique, 91128 Palaiseau, France
| |
Collapse
|
11
|
Lucas JE, Kortemme T. New computational protein design methods for de novo small molecule binding sites. PLoS Comput Biol 2020; 16:e1008178. [PMID: 33017412 PMCID: PMC7575090 DOI: 10.1371/journal.pcbi.1008178] [Citation(s) in RCA: 16] [Impact Index Per Article: 4.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/30/2020] [Revised: 10/20/2020] [Accepted: 07/22/2020] [Indexed: 11/19/2022] Open
Abstract
Protein binding to small molecules is fundamental to many biological processes, yet it remains challenging to predictively design this functionality de novo. Current state-of-the-art computational design methods typically rely on existing small molecule binding sites or protein scaffolds with existing shape complementarity for a target ligand. Here we introduce new methods that utilize pools of discrete contacts between protein side chains and defined small molecule ligand substructures (ligand fragments) observed in the Protein Data Bank. We use the Rosetta Molecular Modeling Suite to recombine protein side chains in these contact pools to generate hundreds of thousands of energetically favorable binding sites for a target ligand. These composite binding sites are built into existing scaffold proteins matching the intended binding site geometry with high accuracy. In addition, we apply pools of side chain rotamers interacting with the target ligand to augment Rosetta's conventional design machinery and improve key metrics known to be predictive of design success. We demonstrate that our method reliably builds diverse binding sites into different scaffold proteins for a variety of target molecules. Our generalizable de novo ligand binding site design method provides a foundation for versatile design of protein to interface previously unattainable molecules for applications in medical diagnostics and synthetic biology.
Collapse
Affiliation(s)
- James E. Lucas
- UC Berkeley–UCSF Graduate Program in Bioengineering, University of California San Francisco, San Francisco, CA, United States of America
- Department of Bioengineering and Therapeutic Sciences, University of California San Francisco, San Francisco, CA, United States of America
| | - Tanja Kortemme
- UC Berkeley–UCSF Graduate Program in Bioengineering, University of California San Francisco, San Francisco, CA, United States of America
- Department of Bioengineering and Therapeutic Sciences, University of California San Francisco, San Francisco, CA, United States of America
| |
Collapse
|
12
|
Lowegard AU, Frenkel MS, Holt GT, Jou JD, Ojewole AA, Donald BR. 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 Comput Biol 2020; 16:e1007447. [PMID: 32511232 PMCID: PMC7329130 DOI: 10.1371/journal.pcbi.1007447] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/26/2019] [Revised: 07/01/2020] [Accepted: 05/13/2020] [Indexed: 11/25/2022] Open
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. 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.
Collapse
Affiliation(s)
- Anna U. Lowegard
- Program in Computational Biology and Bioinformatics, Duke University Medical Center, Durham, North Carolina, United States of America
- Department of Computer Science, Duke University, Durham, North Carolina, United States of America
| | - Marcel S. Frenkel
- Department of Biochemistry, Duke University Medical Center, Durham, North Carolina, United States of America
| | - Graham T. Holt
- Program in Computational Biology and Bioinformatics, Duke University Medical Center, Durham, North Carolina, United States of America
- Department of Computer Science, Duke University, Durham, North Carolina, United States of America
| | - Jonathan D. Jou
- Department of Computer Science, Duke University, Durham, North Carolina, United States of America
| | - Adegoke A. Ojewole
- Program in Computational Biology and Bioinformatics, Duke University Medical Center, Durham, North Carolina, United States of America
- Department of Computer Science, Duke University, Durham, North Carolina, United States of America
| | - Bruce R. Donald
- Department of Computer Science, Duke University, Durham, North Carolina, United States of America
- Department of Biochemistry, Duke University Medical Center, Durham, North Carolina, United States of America
- * E-mail:
| |
Collapse
|
13
|
Surpeta B, Sequeiros-Borja CE, Brezovsky J. Dynamics, a Powerful Component of Current and Future in Silico Approaches for Protein Design and Engineering. Int J Mol Sci 2020; 21:E2713. [PMID: 32295283 PMCID: PMC7215530 DOI: 10.3390/ijms21082713] [Citation(s) in RCA: 9] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/18/2020] [Revised: 04/10/2020] [Accepted: 04/12/2020] [Indexed: 12/13/2022] Open
Abstract
Computational prediction has become an indispensable aid in the processes of engineering and designing proteins for various biotechnological applications. With the tremendous progress in more powerful computer hardware and more efficient algorithms, some of in silico tools and methods have started to apply the more realistic description of proteins as their conformational ensembles, making protein dynamics an integral part of their prediction workflows. To help protein engineers to harness benefits of considering dynamics in their designs, we surveyed new tools developed for analyses of conformational ensembles in order to select engineering hotspots and design mutations. Next, we discussed the collective evolution towards more flexible protein design methods, including ensemble-based approaches, knowledge-assisted methods, and provable algorithms. Finally, we highlighted apparent challenges that current approaches are facing and provided our perspectives on their further development.
Collapse
Affiliation(s)
- Bartłomiej Surpeta
- Laboratory of Biomolecular Interactions and Transport, Department of Gene Expression, Institute of Molecular Biology and Biotechnology, Faculty of Biology, Adam Mickiewicz University, Uniwersytetu Poznanskiego 6, 61-614 Poznan, Poland; (B.S.); (C.E.S.-B.)
- International Institute of Molecular and Cell Biology in Warsaw, Ks Trojdena 4, 02-109 Warsaw, Poland
| | - Carlos Eduardo Sequeiros-Borja
- Laboratory of Biomolecular Interactions and Transport, Department of Gene Expression, Institute of Molecular Biology and Biotechnology, Faculty of Biology, Adam Mickiewicz University, Uniwersytetu Poznanskiego 6, 61-614 Poznan, Poland; (B.S.); (C.E.S.-B.)
- International Institute of Molecular and Cell Biology in Warsaw, Ks Trojdena 4, 02-109 Warsaw, Poland
| | - Jan Brezovsky
- Laboratory of Biomolecular Interactions and Transport, Department of Gene Expression, Institute of Molecular Biology and Biotechnology, Faculty of Biology, Adam Mickiewicz University, Uniwersytetu Poznanskiego 6, 61-614 Poznan, Poland; (B.S.); (C.E.S.-B.)
- International Institute of Molecular and Cell Biology in Warsaw, Ks Trojdena 4, 02-109 Warsaw, Poland
| |
Collapse
|
14
|
Jou JD, Holt GT, Lowegard AU, Donald BR. Minimization-Aware Recursive K*: A Novel, Provable Algorithm that Accelerates Ensemble-Based Protein Design and Provably Approximates the Energy Landscape. J Comput Biol 2019; 27:550-564. [PMID: 31855059 DOI: 10.1089/cmb.2019.0315] [Citation(s) in RCA: 10] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/09/2023] Open
Abstract
Protein design algorithms that model continuous sidechain flexibility and conformational ensembles better approximate the in vitro and in vivo behavior of proteins. The previous state of the art, iMinDEE-A*-K*, computes provable ɛ-approximations to partition functions of protein states (e.g., bound vs. unbound) by computing provable, admissible pairwise-minimized energy lower bounds on protein conformations, and using the A* enumeration algorithm to return a gap-free list of lowest-energy conformations. iMinDEE-A*-K* runs in time sublinear in the number of conformations, but can be trapped in loosely-bounded, low-energy conformational wells containing many conformations with highly similar energies. That is, iMinDEE-A*-K* is unable to exploit the correlation between protein conformation and energy: similar conformations often have similar energy. We introduce two new concepts that exploit this correlation: Minimization-Aware Enumeration and Recursive K*. We combine these two insights into a novel algorithm, Minimization-Aware Recursive K* (MARK*), which tightens bounds not on single conformations, but instead on distinct regions of the conformation space. We compare the performance of iMinDEE-A*-K* versus MARK* by running the Branch and Bound over K* (BBK*) algorithm, which provably returns sequences in order of decreasing K* score, using either iMinDEE-A*-K* or MARK* to approximate partition functions. We show on 200 design problems that MARK* not only enumerates and minimizes vastly fewer conformations than the previous state of the art, but also runs up to 2 orders of magnitude faster. Finally, we show that MARK* not only efficiently approximates the partition function, but also provably approximates the energy landscape. To our knowledge, MARK* is the first algorithm to do so. We use MARK* to analyze the change in energy landscape of the bound and unbound states of an HIV-1 capsid protein C-terminal domain in complex with a camelid VHH, and measure the change in conformational entropy induced by binding. Thus, MARK* both accelerates existing designs and offers new capabilities not possible with previous algorithms.
Collapse
Affiliation(s)
- Jonathan D Jou
- Department of Computer Science, Duke University, Durham, North Carolina
| | - Graham T Holt
- Department of Computer Science, Duke University, Durham, North Carolina.,Computational Biology and Bioinformatics Program, Duke University, Durham, North Carolina
| | - Anna U Lowegard
- Department of Computer Science, Duke University, Durham, North Carolina.,Computational Biology and Bioinformatics Program, Duke University, Durham, North Carolina
| | - Bruce R Donald
- Department of Computer Science, Duke University, Durham, North Carolina.,Department of Biochemistry, Duke University Medical Center, Durham, North Carolina.,Department of Chemistry, Duke University, Durham, North Carolina
| |
Collapse
|
15
|
Holt GT, Jou JD, Gill NP, Lowegard AU, Martin JW, Madden DR, Donald BR. Computational Analysis of Energy Landscapes Reveals Dynamic Features That Contribute to Binding of Inhibitors to CFTR-Associated Ligand. J Phys Chem B 2019; 123:10441-10455. [PMID: 31697075 DOI: 10.1021/acs.jpcb.9b07278] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/31/2022]
Abstract
The CFTR-associated ligand PDZ domain (CALP) binds to the cystic fibrosis transmembrane conductance regulator (CFTR) and mediates lysosomal degradation of mature CFTR. Inhibition of this interaction has been explored as a therapeutic avenue for cystic fibrosis. Previously, we reported the ensemble-based computational design of a novel peptide inhibitor of CALP, which resulted in the most binding-efficient inhibitor to date. This inhibitor, kCAL01, was designed using osprey and evinced significant biological activity in in vitro cell-based assays. Here, we report a crystal structure of kCAL01 bound to CALP and compare structural features against iCAL36, a previously developed inhibitor of CALP. We compute side-chain energy landscapes for each structure to not only enable approximation of binding thermodynamics but also reveal ensemble features that contribute to the comparatively efficient binding of kCAL01. Finally, we compare the previously reported design ensemble for kCAL01 vs the new crystal structure and show that, despite small differences between the design model and crystal structure, significant biophysical features that enhance inhibitor binding are captured in the design ensemble. This suggests not only that ensemble-based design captured thermodynamically significant features observed in vitro, but also that a design eschewing ensembles would miss the kCAL01 sequence entirely.
Collapse
Affiliation(s)
- Graham T Holt
- Department of Computer Science , Duke University , Durham , North Carolina 27708 , United States.,Program in Computational Biology and Bioinformatics , Duke University , Durham , North Carolina 27708 , United States
| | - Jonathan D Jou
- Department of Computer Science , Duke University , Durham , North Carolina 27708 , United States
| | - Nicholas P Gill
- Department of Biochemistry & Cell Biology , Geisel School of Medicine at Dartmouth , Hanover , New Hampshire 03755 , United States
| | - Anna U Lowegard
- Department of Computer Science , Duke University , Durham , North Carolina 27708 , United States.,Program in Computational Biology and Bioinformatics , Duke University , Durham , North Carolina 27708 , United States
| | - Jeffrey W Martin
- Department of Computer Science , Duke University , Durham , North Carolina 27708 , United States
| | - Dean R Madden
- Department of Biochemistry & Cell Biology , Geisel School of Medicine at Dartmouth , Hanover , New Hampshire 03755 , United States
| | - Bruce R Donald
- Department of Computer Science , Duke University , Durham , North Carolina 27708 , United States.,Department of Biochemistry , Duke University , Durham , North Carolina 27710 , United States.,Department of Chemistry , Duke University , Durham , North Carolina 27710 , United States
| |
Collapse
|
16
|
HALLEN MARKA, DONALD BRUCER. Protein Design by Provable Algorithms. COMMUNICATIONS OF THE ACM 2019; 62:76-84. [PMID: 31607753 PMCID: PMC6788629 DOI: 10.1145/3338124] [Citation(s) in RCA: 7] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Abstract] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/10/2023]
Abstract
Protein design algorithms can leverage provable guarantees of accuracy to provide new insights and unique optimized molecules.
Collapse
Affiliation(s)
- MARK A. HALLEN
- Research assistant professor at the Toyota Technological Institute at Chicago, IL, USA
| | - BRUCE R. DONALD
- James B. Duke Professor of Computer Science at Duke University, as well as a
professor of chemistry and biochemistry in the Duke University Medical
Center, Durham, NC, USA
| |
Collapse
|
17
|
Keedy DA. Journey to the center of the protein: allostery from multitemperature multiconformer X-ray crystallography. Acta Crystallogr D Struct Biol 2019; 75:123-137. [PMID: 30821702 PMCID: PMC6400254 DOI: 10.1107/s2059798318017941] [Citation(s) in RCA: 24] [Impact Index Per Article: 4.8] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/06/2018] [Accepted: 12/19/2018] [Indexed: 02/08/2023] Open
Abstract
Proteins inherently fluctuate between conformations to perform functions in the cell. For example, they sample product-binding, transition-state-stabilizing and product-release states during catalysis, and they integrate signals from remote regions of the structure for allosteric regulation. However, there is a lack of understanding of how these dynamic processes occur at the basic atomic level. This gap can be at least partially addressed by combining variable-temperature (instead of traditional cryogenic temperature) X-ray crystallography with algorithms for modeling alternative conformations based on electron-density maps, in an approach called multitemperature multiconformer X-ray crystallography (MMX). Here, the use of MMX to reveal alternative conformations at different sites in a protein structure and to estimate the degree of energetic coupling between them is discussed. These insights can suggest testable hypotheses about allosteric mechanisms. Temperature is an easily manipulated experimental parameter, so the MMX approach is widely applicable to any protein that yields well diffracting crystals. Moreover, the general principles of MMX are extensible to other perturbations such as pH, pressure, ligand concentration etc. Future work will explore strategies for leveraging X-ray data across such perturbation series to more quantitatively measure how different parts of a protein structure are coupled to each other, and the consequences thereof for allostery and other aspects of protein function.
Collapse
Affiliation(s)
- Daniel A. Keedy
- Structural Biology Initiative, CUNY Advanced Science Research Center, New York, USA
- Department of Chemistry and Biochemistry, City College of New York, New York, USA
- PhD Programs in Chemistry and Biochemistry, The Graduate Center of the City University of New York, New York, USA
| |
Collapse
|
18
|
Hallen MA, Martin JW, Ojewole A, Jou JD, Lowegard AU, Frenkel MS, Gainza P, Nisonoff HM, Mukund A, Wang S, Holt GT, Zhou D, Dowd E, Donald BR. OSPREY 3.0: Open-source protein redesign for you, with powerful new features. J Comput Chem 2018; 39:2494-2507. [PMID: 30368845 PMCID: PMC6391056 DOI: 10.1002/jcc.25522] [Citation(s) in RCA: 37] [Impact Index Per Article: 6.2] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/23/2018] [Accepted: 06/14/2018] [Indexed: 12/14/2022]
Abstract
We present osprey 3.0, a new and greatly improved release of the osprey protein design software. Osprey 3.0 features a convenient new Python interface, which greatly improves its ease of use. It is over two orders of magnitude faster than previous versions of osprey when running the same algorithms on the same hardware. Moreover, osprey 3.0 includes several new algorithms, which introduce substantial speedups as well as improved biophysical modeling. It also includes GPU support, which provides an additional speedup of over an order of magnitude. Like previous versions of osprey, osprey 3.0 offers a unique package of advantages over other design software, including provable design algorithms that account for continuous flexibility during design and model conformational entropy. Finally, we show here empirically that osprey 3.0 accurately predicts the effect of mutations on protein-protein binding. Osprey 3.0 is available at http://www.cs.duke.edu/donaldlab/osprey.php as free and open-source software. © 2018 Wiley Periodicals, Inc.
Collapse
Affiliation(s)
- Mark A. Hallen
- Department of Computer Science, Duke University, Durham, NC
27708
- Toyota Technological Institute at Chicago, Chicago, IL
60637
| | | | - Adegoke Ojewole
- Program in Computational Biology and Bioinformatics, Duke
University Medical Center, Durham, NC 27710
| | - Jonathan D. Jou
- Department of Computer Science, Duke University, Durham, NC
27708
| | - Anna U. Lowegard
- Program in Computational Biology and Bioinformatics, Duke
University Medical Center, Durham, NC 27710
| | - Marcel S. Frenkel
- Department of Biochemistry, Duke University Medical Center,
Durham, NC 27710
| | - Pablo Gainza
- Department of Computer Science, Duke University, Durham, NC
27708
| | | | - Aditya Mukund
- Department of Computer Science, Duke University, Durham, NC
27708
| | - Siyu Wang
- Program in Computational Biology and Bioinformatics, Duke
University Medical Center, Durham, NC 27710
| | - Graham T. Holt
- Program in Computational Biology and Bioinformatics, Duke
University Medical Center, Durham, NC 27710
| | - David Zhou
- Department of Computer Science, Duke University, Durham, NC
27708
| | - Elizabeth Dowd
- Department of Computer Science, Duke University, Durham, NC
27708
| | - Bruce R. Donald
- Department of Computer Science, Duke University, Durham, NC
27708
- Department of Chemistry, Duke University, Durham, NC
27708
- Department of Biochemistry, Duke University Medical Center,
Durham, NC 27710
| |
Collapse
|
19
|
Hallen MA. PLUG (Pruning of Local Unrealistic Geometries) removes restrictions on biophysical modeling for protein design. Proteins 2018; 87:62-73. [PMID: 30378699 DOI: 10.1002/prot.25623] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/12/2018] [Revised: 10/10/2018] [Accepted: 10/16/2018] [Indexed: 12/29/2022]
Abstract
Protein design algorithms must search an enormous conformational space to identify favorable conformations. As a result, those that perform this search with guarantees of accuracy generally start with a conformational pruning step, such as dead-end elimination (DEE). However, the mathematical assumptions of DEE-based pruning algorithms have up to now severely restricted the biophysical model that can feasibly be used in protein design. To lift these restrictions, I propose to prune local unrealistic geometries (PLUG) using a linear programming-based method. PLUG's biophysical model consists only of well-known lower bounds on interatomic distances. PLUG is intended as preprocessing for energy-based protein design calculations, whose biophysical model need not support DEE pruning. Based on 96 test cases, PLUG is at least as effective at pruning as DEE for larger protein designs-the type that most require pruning. When combined with the LUTE protein design algorithm, PLUG greatly facilitates designs that account for continuous entropy, large multistate designs with continuous flexibility, and designs with extensive continuous backbone flexibility and advanced nonpairwise energy functions. Many of these designs are tractable only with PLUG, either for empirical reasons (LUTE's machine learning step achieves an accurate fit only after PLUG pruning), or for theoretical reasons (many energy functions are fundamentally incompatible with DEE).
Collapse
Affiliation(s)
- Mark A Hallen
- Toyota Technological Institute at Chicago, Chicago, Illinois
| |
Collapse
|
20
|
Charpentier A, Mignon D, Barbe S, Cortes J, Schiex T, Simonson T, Allouche D. Variable Neighborhood Search with Cost Function Networks To Solve Large Computational Protein Design Problems. J Chem Inf Model 2018; 59:127-136. [DOI: 10.1021/acs.jcim.8b00510] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/30/2022]
Affiliation(s)
| | - David Mignon
- Laboratoire de Biochimie (CNRS UMR 7654), École Polytechnique, 91128 Palaiseau, France
| | - Sophie Barbe
- Laboratoire d’Ingénierie des Systèmes Biologiques et Procédés, LISBP, Université de Toulouse, CNRS, INRA, INSA, 31077 Toulouse, France
| | - Juan Cortes
- LAAS-CNRS, Université de Toulouse, CNRS, 31400 Toulouse, France
| | - Thomas Schiex
- MIAT, Université de Toulouse, INRA, 31326 Castanet-Tolosan, France
| | - Thomas Simonson
- Laboratoire de Biochimie (CNRS UMR 7654), École Polytechnique, 91128 Palaiseau, France
| | - David Allouche
- MIAT, Université de Toulouse, INRA, 31326 Castanet-Tolosan, France
| |
Collapse
|
21
|
Lechner H, Ferruz N, Höcker B. Strategies for designing non-natural enzymes and binders. Curr Opin Chem Biol 2018; 47:67-76. [PMID: 30248579 DOI: 10.1016/j.cbpa.2018.07.022] [Citation(s) in RCA: 37] [Impact Index Per Article: 6.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/06/2018] [Revised: 07/16/2018] [Accepted: 07/17/2018] [Indexed: 12/20/2022]
Abstract
The design of tailor-made enzymes is a major goal in biochemical research that can result in wide-range applications and will lead to a better understanding of how proteins fold and function. In this review we highlight recent advances in enzyme and small molecule binder design. A focus is placed on novel strategies for the design of scaffolds, developments in computational methods, and recent applications of these techniques on receptors, sensors, and enzymes. Further, the integration of computational and experimental methodologies is discussed. The outlined examples of designed enzymes and binders for various purposes highlight the importance of this topic and underline the need for tailor-made proteins.
Collapse
Affiliation(s)
- Horst Lechner
- Department of Biochemistry, University of Bayreuth, 95447 Bayreuth, Germany
| | - Noelia Ferruz
- Department of Biochemistry, University of Bayreuth, 95447 Bayreuth, Germany
| | - Birte Höcker
- Department of Biochemistry, University of Bayreuth, 95447 Bayreuth, Germany.
| |
Collapse
|
22
|
Abstract
Motivation Multistate protein design addresses real-world challenges, such as multi-specificity design and backbone flexibility, by considering both positive and negative protein states with an ensemble of substates for each. It also presents an enormous challenge to exact algorithms that guarantee the optimal solutions and enable a direct test of mechanistic hypotheses behind models. However, efficient exact algorithms are lacking for multistate protein design. Results We have developed an efficient exact algorithm called interconnected cost function networks (iCFN) for multistate protein design. Its generic formulation allows for a wide array of applications such as stability, affinity and specificity designs while addressing concerns such as global flexibility of protein backbones. iCFN treats each substate design as a weighted constraint satisfaction problem (WCSP) modeled through a CFN; and it solves the coupled WCSPs using novel bounds and a depth-first branch-and-bound search over a tree structure of sequences, substates, and conformations. When iCFN is applied to specificity design of a T-cell receptor, a problem of unprecedented size to exact methods, it drastically reduces search space and running time to make the problem tractable. Moreover, iCFN generates experimentally-agreeing receptor designs with improved accuracy compared with state-of-the-art methods, highlights the importance of modeling backbone flexibility in protein design, and reveals molecular mechanisms underlying binding specificity. Availability and implementation https://shen-lab.github.io/software/iCFN. Supplementary information Supplementary data are available at Bioinformatics online.
Collapse
Affiliation(s)
- Mostafa Karimi
- Department of Electrical and Computer Engineering and TEES-AgriLife Center for Bioinformatics and Genomic Systems Engineering, Texas A&M University, College Station, USA
| | - Yang Shen
- Department of Electrical and Computer Engineering and TEES-AgriLife Center for Bioinformatics and Genomic Systems Engineering, Texas A&M University, College Station, USA
| |
Collapse
|
23
|
Qi Y, Martin JW, Barb AW, Thélot F, Yan AK, Donald BR, Oas TG. Continuous Interdomain Orientation Distributions Reveal Components of Binding Thermodynamics. J Mol Biol 2018; 430:3412-3426. [PMID: 29924964 DOI: 10.1016/j.jmb.2018.06.022] [Citation(s) in RCA: 9] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/11/2017] [Revised: 06/09/2018] [Accepted: 06/11/2018] [Indexed: 11/15/2022]
Abstract
The flexibility of biological macromolecules is an important structural determinant of function. Unfortunately, the correlations between different motional modes are poorly captured by discrete ensemble representations. Here, we present new ways to both represent and visualize correlated interdomain motions. Interdomain motions are determined directly from residual dipolar couplings, represented as a continuous conformational distribution, and visualized using the disk-on-sphere representation. Using the disk-on-sphere representation, features of interdomain motions, including correlations, are intuitively visualized. The representation works especially well for multidomain systems with broad conformational distributions.This analysis also can be extended to multiple probability density modes, using a Bingham mixture model. We use this new paradigm to study the interdomain motions of staphylococcal protein A, which is a key virulence factor contributing to the pathogenicity of Staphylococcus aureus. We capture the smooth transitions between important states and demonstrate the utility of continuous distribution functions for computing the reorientational components of binding thermodynamics. Such insights allow for the dissection of the dynamic structural components of functionally important intermolecular interactions.
Collapse
Affiliation(s)
- Yang Qi
- Department of Biochemistry, Duke University, Durham, NC 27710, United States; Department of Computer Science, Duke University, Durham, NC 27708, United States
| | - Jeffrey W Martin
- Department of Computer Science, Duke University, Durham, NC 27708, United States
| | - Adam W Barb
- Roy J. Carver Department of Biochemistry, Iowa State University, Ames, IA 50011, United States
| | - François Thélot
- Department of Computer Science, Duke University, Durham, NC 27708, United States
| | - Anthony K Yan
- Department of Computer Science, Duke University, Durham, NC 27708, United States
| | - Bruce R Donald
- Department of Biochemistry, Duke University, Durham, NC 27710, United States; Department of Computer Science, Duke University, Durham, NC 27708, United States.
| | - Terrence G Oas
- Department of Biochemistry, Duke University, Durham, NC 27710, United States.
| |
Collapse
|
24
|
Hallen MA, Donald BR. CATS (Coordinates of Atoms by Taylor Series): protein design with backbone flexibility in all locally feasible directions. Bioinformatics 2018; 33:i5-i12. [PMID: 28882005 PMCID: PMC5870559 DOI: 10.1093/bioinformatics/btx277] [Citation(s) in RCA: 15] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022] Open
Abstract
Motivation When proteins mutate or bind to ligands, their backbones often move significantly, especially in loop regions. Computational protein design algorithms must model these motions in order to accurately optimize protein stability and binding affinity. However, methods for backbone conformational search in design have been much more limited than for sidechain conformational search. This is especially true for combinatorial protein design algorithms, which aim to search a large sequence space efficiently and thus cannot rely on temporal simulation of each candidate sequence. Results We alleviate this difficulty with a new parameterization of backbone conformational space, which represents all degrees of freedom of a specified segment of protein chain that maintain valid bonding geometry (by maintaining the original bond lengths and angles and ω dihedrals). In order to search this space, we present an efficient algorithm, CATS, for computing atomic coordinates as a function of our new continuous backbone internal coordinates. CATS generalizes the iMinDEE and EPIC protein design algorithms, which model continuous flexibility in sidechain dihedrals, to model continuous, appropriately localized flexibility in the backbone dihedrals ϕ and ψ as well. We show using 81 test cases based on 29 different protein structures that CATS finds sequences and conformations that are significantly lower in energy than methods with less or no backbone flexibility do. In particular, we show that CATS can model the viability of an antibody mutation known experimentally to increase affinity, but that appears sterically infeasible when modeled with less or no backbone flexibility. Availability and implementation Our code is available as free software at https://github.com/donaldlab/OSPREY_refactor. Supplementary information Supplementary data are available at Bioinformatics online.
Collapse
Affiliation(s)
- Mark A Hallen
- Department of Computer Science, Duke University, Durham, NC, USA.,Toyota Technological Institute at Chicago, Chicago, IL, USA
| | - Bruce R Donald
- Department of Computer Science, Duke University, Durham, NC, USA.,Department of Chemistry, Duke University, Durham, NC, USA.,Department of Biochemistry, Duke University Medical Center, Durham, NC, USA
| |
Collapse
|
25
|
Ojewole AA, Jou JD, Fowler VG, Donald BR. 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. J Comput Biol 2018; 25:726-739. [PMID: 29641249 DOI: 10.1089/cmb.2017.0267] [Citation(s) in RCA: 18] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/26/2023] Open
Abstract
Computational protein design (CPD) algorithms that compute binding affinity, Ka, search for sequences with an energetically favorable free energy of binding. Recent work shows that three principles improve the biological accuracy of CPD: ensemble-based design, continuous flexibility of backbone and side-chain conformations, and provable guarantees of accuracy with respect to the input. However, previous methods that use all three design principles are single-sequence (SS) algorithms, which are very costly: linear in the number of sequences and thus exponential in the number of simultaneously mutable residues. To address this computational challenge, we introduce BBK*, a new CPD algorithm whose key innovation is the multisequence (MS) bound: BBK* efficiently computes a single provable upper bound to approximate Ka for a combinatorial number of sequences, and avoids SS computation for all provably suboptimal sequences. Thus, to our knowledge, BBK* is the first provable, ensemble-based CPD algorithm to run in time sublinear in the number of sequences. Computational experiments on 204 protein design problems show that BBK* finds the tightest binding sequences while approximating Ka for up to 105-fold fewer sequences than the previous state-of-the-art algorithms, which require exhaustive enumeration of sequences. Furthermore, for 51 protein-ligand design problems, BBK* provably approximates Ka up to 1982-fold faster than the previous state-of-the-art iMinDEE/[Formula: see text]/[Formula: see text] algorithm. Therefore, BBK* not only accelerates protein designs that are possible with previous provable algorithms, but also efficiently performs designs that are too large for previous methods.
Collapse
Affiliation(s)
- Adegoke A Ojewole
- 1 Department of Computer Science, Duke University , Durham, North Carolina.,2 Computational Biology and Bioinformatics Program, Duke University , Durham, North Carolina
| | - Jonathan D Jou
- 1 Department of Computer Science, Duke University , Durham, North Carolina
| | - Vance G Fowler
- 3 Division of Infectious Diseases, Duke University Medical Center , Durham, North Carolina
| | - Bruce R Donald
- 1 Department of Computer Science, Duke University , Durham, North Carolina.,4 Department of Biochemistry, Duke University Medical Center , Durham North Carolina
| |
Collapse
|
26
|
Viricel C, de Givry S, Schiex T, Barbe S. Cost function network-based design of protein–protein interactions: predicting changes in binding affinity. Bioinformatics 2018; 34:2581-2589. [DOI: 10.1093/bioinformatics/bty092] [Citation(s) in RCA: 9] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/02/2017] [Accepted: 02/16/2018] [Indexed: 11/14/2022] Open
Affiliation(s)
- Clément Viricel
- Laboratoire d’Ingénierie des Systèmes Biologiques et des Procédés, Université de Toulouse, CNRS, INRA, INSA, Toulouse, France
- Unité de Mathématiques et Informatique Appliquées de Toulouse, INRA, Castanet Tolosan cedex, France
| | - Simon de Givry
- Unité de Mathématiques et Informatique Appliquées de Toulouse, INRA, Castanet Tolosan cedex, France
| | - Thomas Schiex
- Unité de Mathématiques et Informatique Appliquées de Toulouse, INRA, Castanet Tolosan cedex, France
| | - Sophie Barbe
- Laboratoire d’Ingénierie des Systèmes Biologiques et des Procédés, Université de Toulouse, CNRS, INRA, INSA, Toulouse, France
| |
Collapse
|
27
|
Sun MGF, Kim PM. Data driven flexible backbone protein design. PLoS Comput Biol 2017; 13:e1005722. [PMID: 28837553 PMCID: PMC5587332 DOI: 10.1371/journal.pcbi.1005722] [Citation(s) in RCA: 11] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/18/2017] [Revised: 09/06/2017] [Accepted: 08/11/2017] [Indexed: 11/18/2022] Open
Abstract
Protein design remains an important problem in computational structural biology. Current computational protein design methods largely use physics-based methods, which make use of information from a single protein structure. This is despite the fact that multiple structures of many protein folds are now readily available in the PDB. While ensemble protein design methods can use multiple protein structures, they treat each structure independently. Here, we introduce a flexible backbone strategy, FlexiBaL-GP, which learns global protein backbone movements directly from multiple protein structures. FlexiBaL-GP uses the machine learning method of Gaussian Process Latent Variable Models to learn a lower dimensional representation of the protein coordinates that best represent backbone movements. These learned backbone movements are used to explore alternative protein backbones, while engineering a protein within a parallel tempered MCMC framework. Using the human ubiquitin-USP21 complex as a model we demonstrate that our design strategy outperforms current strategies for the interface design task of identifying tight binding ubiquitin variants for USP21.
Collapse
Affiliation(s)
- Mark G. F. Sun
- Department of Computer Science, University of Toronto, Toronto, Canada
- Terrence Donnelly Centre for Cellular and Biomolecular Research, University of Toronto, Toronto, Canada
| | - Philip M. Kim
- Department of Computer Science, University of Toronto, Toronto, Canada
- Terrence Donnelly Centre for Cellular and Biomolecular Research, University of Toronto, Toronto, Canada
- Department of Molecular Genetics, University of Toronto, Toronto, Canada
- Banting and Best Department of Medical Research, University of Toronto, Toronto, Canada
- * E-mail:
| |
Collapse
|
28
|
Toward high-resolution computational design of the structure and function of helical membrane proteins. Nat Struct Mol Biol 2017; 23:475-80. [PMID: 27273630 DOI: 10.1038/nsmb.3231] [Citation(s) in RCA: 24] [Impact Index Per Article: 3.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/21/2016] [Accepted: 04/20/2016] [Indexed: 02/07/2023]
Abstract
The computational design of α-helical membrane proteins is still in its infancy but has already made great progress. De novo design allows stable, specific and active minimal oligomeric systems to be obtained. Computational reengineering can improve the stability and function of naturally occurring membrane proteins. Currently, the major hurdle for the field is the experimental characterization of the designs. The emergence of new structural methods for membrane proteins will accelerate progress.
Collapse
|
29
|
Jain S, Jou JD, Georgiev IS, Donald BR. A critical analysis of computational protein design with sparse residue interaction graphs. PLoS Comput Biol 2017; 13:e1005346. [PMID: 28358804 PMCID: PMC5391103 DOI: 10.1371/journal.pcbi.1005346] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/02/2015] [Revised: 04/13/2017] [Accepted: 01/03/2017] [Indexed: 11/19/2022] Open
Abstract
Protein design algorithms enumerate a combinatorial number of candidate structures to compute the Global Minimum Energy Conformation (GMEC). To efficiently find the GMEC, protein design algorithms must methodically reduce the conformational search space. By applying distance and energy cutoffs, the protein system to be designed can thus be represented using a sparse residue interaction graph, where the number of interacting residue pairs is less than all pairs of mutable residues, and the corresponding GMEC is called the sparse GMEC. However, ignoring some pairwise residue interactions can lead to a change in the energy, conformation, or sequence of the sparse GMEC vs. the original or the full GMEC. Despite the widespread use of sparse residue interaction graphs in protein design, the above mentioned effects of their use have not been previously analyzed. To analyze the costs and benefits of designing with sparse residue interaction graphs, we computed the GMECs for 136 different protein design problems both with and without distance and energy cutoffs, and compared their energies, conformations, and sequences. Our analysis shows that the differences between the GMECs depend critically on whether or not the design includes core, boundary, or surface residues. Moreover, neglecting long-range interactions can alter local interactions and introduce large sequence differences, both of which can result in significant structural and functional changes. Designs on proteins with experimentally measured thermostability show it is beneficial to compute both the full and the sparse GMEC accurately and efficiently. To this end, we show that a provable, ensemble-based algorithm can efficiently compute both GMECs by enumerating a small number of conformations, usually fewer than 1000. This provides a novel way to combine sparse residue interaction graphs with provable, ensemble-based algorithms to reap the benefits of sparse residue interaction graphs while avoiding their potential inaccuracies. Computational structure-based protein design algorithms have successfully redesigned proteins to fold and bind target substrates in vitro, and even in vivo. Because the complexity of a computational design increases dramatically with the number of mutable residues, many design algorithms employ cutoffs (distance or energy) to neglect some pairwise residue interactions, thereby reducing the effective search space and computational cost. However, the energies neglected by such cutoffs can add up, which may have nontrivial effects on the designed sequence and its function. To study the effects of using cutoffs on protein design, we computed the optimal sequence both with and without cutoffs, and showed that neglecting long-range interactions can significantly change the computed conformation and sequence. Designs on proteins with experimentally measured thermostability showed the benefits of computing the optimal sequences (and their conformations), both with and without cutoffs, efficiently and accurately. Therefore, we also showed that a provable, ensemble-based algorithm can efficiently compute the optimal conformation and sequence, both with and without applying cutoffs, by enumerating a small number of conformations, usually fewer than 1000. This provides a novel way to combine cutoffs with provable, ensemble-based algorithms to reap the computational efficiency of cutoffs while avoiding their potential inaccuracies.
Collapse
Affiliation(s)
- Swati Jain
- Computational Biology and Bioinformatics Program, Duke University, Durham, North Carolina, United States of America
- Department of Computer Science, Duke University, Durham, North Carolina, United States of America
- Department of Biochemistry, Duke University Medical Center, Durham, North Carolina, United States of America
| | - Jonathan D. Jou
- Department of Computer Science, Duke University, Durham, North Carolina, United States of America
| | - Ivelin S. Georgiev
- Department of Computer Science, Duke University, Durham, North Carolina, United States of America
| | - Bruce R. Donald
- Department of Computer Science, Duke University, Durham, North Carolina, United States of America
- Department of Biochemistry, Duke University Medical Center, Durham, North Carolina, United States of America
- Department of Chemistry, Duke University, Durham, North Carolina, United States of America
- * E-mail:
| |
Collapse
|
30
|
Ojewole A, Lowegard A, Gainza P, Reeve SM, Georgiev I, Anderson AC, Donald BR. OSPREY Predicts Resistance Mutations Using Positive and Negative Computational Protein Design. Methods Mol Biol 2017; 1529:291-306. [PMID: 27914058 PMCID: PMC5192561 DOI: 10.1007/978-1-4939-6637-0_15] [Citation(s) in RCA: 8] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 06/06/2023]
Abstract
Drug resistance in protein targets is an increasingly common phenomenon that reduces the efficacy of both existing and new antibiotics. However, knowledge of future resistance mutations during pre-clinical phases of drug development would enable the design of novel antibiotics that are robust against not only known resistant mutants, but also against those that have not yet been clinically observed. Computational structure-based protein design (CSPD) is a transformative field that enables the prediction of protein sequences with desired biochemical properties such as binding affinity and specificity to a target. The use of CSPD to predict previously unseen resistance mutations represents one of the frontiers of computational protein design. In a recent study (Reeve et al. Proc Natl Acad Sci U S A 112(3):749-754, 2015), we used our OSPREY (Open Source Protein REdesign for You) suite of CSPD algorithms to prospectively predict resistance mutations that arise in the active site of the dihydrofolate reductase enzyme from methicillin-resistant Staphylococcus aureus (SaDHFR) in response to selective pressure from an experimental competitive inhibitor. We demonstrated that our top predicted candidates are indeed viable resistant mutants. Since that study, we have significantly enhanced the capabilities of OSPREY with not only improved modeling of backbone flexibility, but also efficient multi-state design, fast sparse approximations, partitioned continuous rotamers for more accurate energy bounds, and a computationally efficient representation of molecular-mechanics and quantum-mechanical energy functions. Here, using SaDHFR as an example, we present a protocol for resistance prediction using the latest version of OSPREY. Specifically, we show how to use a combination of positive and negative design to predict active site escape mutations that maintain the enzyme's catalytic function but selectively ablate binding of an inhibitor.
Collapse
Affiliation(s)
- Adegoke Ojewole
- Program in Computational Biology and Bioinformatics, Duke University, Durham, NC, 27708, USA
| | - Anna Lowegard
- Program in Computational Biology and Bioinformatics, Duke University, Durham, NC, 27708, USA
| | - Pablo Gainza
- Department of Computer Science, Duke University, Durham, NC, 27708, USA
| | - Stephanie M Reeve
- Department of Pharmaceutical Sciences, University of Connecticut, Storrs, CT, 06269, USA
| | - Ivelin Georgiev
- Department of Computer Science, Duke University, Durham, NC, 27708, USA
- Vaccine Research Center, National Institute of Allergy and Infectious Diseases, Bethesda, MD, 20892, USA
| | - Amy C Anderson
- Department of Pharmaceutical Sciences, University of Connecticut, Storrs, CT, 06269, USA
| | - Bruce R Donald
- Department of Computer Science, Duke University, Durham, NC, 27708, USA.
- Department of Biochemistry, Duke University, Durham, NC, 27708, USA.
- Department of Chemistry, Duke University, Durham, NC, 27708, USA.
| |
Collapse
|
31
|
Amrein BA, Steffen-Munsberg F, Szeler I, Purg M, Kulkarni Y, Kamerlin SCL. CADEE: Computer-Aided Directed Evolution of Enzymes. IUCRJ 2017; 4:50-64. [PMID: 28250941 PMCID: PMC5331465 DOI: 10.1107/s2052252516018017] [Citation(s) in RCA: 35] [Impact Index Per Article: 5.0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Received: 09/12/2016] [Accepted: 11/09/2016] [Indexed: 05/10/2023]
Abstract
The tremendous interest in enzymes as biocatalysts has led to extensive work in enzyme engineering, as well as associated methodology development. Here, a new framework for computer-aided directed evolution of enzymes (CADEE) is presented which allows a drastic reduction in the time necessary to prepare and analyze in silico semi-automated directed evolution of enzymes. A pedagogical example of the application of CADEE to a real biological system is also presented in order to illustrate the CADEE workflow.
Collapse
Affiliation(s)
- Beat Anton Amrein
- Science for Life Laboratory, Department of Cell and Molecular Biology, Uppsala University, BMC Box 596, S-751 24 Uppsala, Sweden
| | - Fabian Steffen-Munsberg
- Science for Life Laboratory, Department of Cell and Molecular Biology, Uppsala University, BMC Box 596, S-751 24 Uppsala, Sweden
| | - Ireneusz Szeler
- Science for Life Laboratory, Department of Cell and Molecular Biology, Uppsala University, BMC Box 596, S-751 24 Uppsala, Sweden
| | - Miha Purg
- Science for Life Laboratory, Department of Cell and Molecular Biology, Uppsala University, BMC Box 596, S-751 24 Uppsala, Sweden
| | - Yashraj Kulkarni
- Science for Life Laboratory, Department of Cell and Molecular Biology, Uppsala University, BMC Box 596, S-751 24 Uppsala, Sweden
| | - Shina Caroline Lynn Kamerlin
- Science for Life Laboratory, Department of Cell and Molecular Biology, Uppsala University, BMC Box 596, S-751 24 Uppsala, Sweden
| |
Collapse
|
32
|
Watkins AM, Bonneau R, Arora PS. Modeling and Design of Peptidomimetics to Modulate Protein-Protein Interactions. Methods Mol Biol 2017; 1561:291-307. [PMID: 28236245 DOI: 10.1007/978-1-4939-6798-8_17] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/28/2022]
Abstract
We describe a modular approach to identify and inhibit protein-protein interactions (PPIs) that are mediated by protein secondary and tertiary structures with rationally designed peptidomimetics. Our analysis begins with entries of high-resolution complexes in the Protein Data Bank and utilizes conformational sampling, scoring, and design capabilities of advanced biomolecular modeling software to develop peptidomimetics.
Collapse
Affiliation(s)
| | - Richard Bonneau
- Department of Biology, Center for Genomics and Systems Biology, New York University, New York, NY, USA
- Computer Science Department, Courant Institute of Mathematical Sciences, New York University, New York, NY, USA
| | - Paramjit S Arora
- Department of Chemistry, New York University, 29 Washington Place, Brown Bldg., Room 360, New York, NY, USA.
| |
Collapse
|
33
|
Traoré S, Allouche D, André I, Schiex T, Barbe S. Deterministic Search Methods for Computational Protein Design. Methods Mol Biol 2017; 1529:107-123. [PMID: 27914047 DOI: 10.1007/978-1-4939-6637-0_4] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 06/06/2023]
Abstract
One main challenge in Computational Protein Design (CPD) lies in the exploration of the amino-acid sequence space, while considering, to some extent, side chain flexibility. The exorbitant size of the search space urges for the development of efficient exact deterministic search methods enabling identification of low-energy sequence-conformation models, corresponding either to the global minimum energy conformation (GMEC) or an ensemble of guaranteed near-optimal solutions. In contrast to stochastic local search methods that are not guaranteed to find the GMEC, exact deterministic approaches always identify the GMEC and prove its optimality in finite but exponential worst-case time. After a brief overview on these two classes of methods, we discuss the grounds and merits of four deterministic methods that have been applied to solve CPD problems. These approaches are based either on the Dead-End-Elimination theorem combined with A* algorithm (DEE/A*), on Cost Function Networks algorithms (CFN), on Integer Linear Programming solvers (ILP) or on Markov Random Fields solvers (MRF). The way two of these methods (DEE/A* and CFN) can be used in practice to identify low-energy sequence-conformation models starting from a pairwise decomposed energy matrix is detailed in this review.
Collapse
Affiliation(s)
- Seydou Traoré
- INSA, UPS, INP, Université de Toulouse, 135 Avenue de Rangueil, 31077, Toulouse, France
- Laboratoire d'Ingénierie Ingénierie des Systèmes Biologiques et des Procédés - INSA, INRA, UMR792, 31400, Toulouse, France
- CNRS, UMR5504, 31400, Toulouse, France
| | - David Allouche
- Unité de Mathématiques et Informatique de Toulouse, UR 875, INRA, 31320, Castanet Tolosan, France
| | - Isabelle André
- INSA, UPS, INP, Université de Toulouse, 135 Avenue de Rangueil, 31077, Toulouse, France
- Laboratoire d'Ingénierie Ingénierie des Systèmes Biologiques et des Procédés - INSA, INRA, UMR792, 31400, Toulouse, France
- CNRS, UMR5504, 31400, Toulouse, France
| | - Thomas Schiex
- Unité de Mathématiques et Informatique de Toulouse, UR 875, INRA, 31320, Castanet Tolosan, France
| | - Sophie Barbe
- INSA, UPS, INP, Université de Toulouse, 135 Avenue de Rangueil, 31077, Toulouse, France.
- Laboratoire d'Ingénierie Ingénierie des Systèmes Biologiques et des Procédés - INSA, INRA, UMR792, 31400, Toulouse, France.
- CNRS, UMR5504, 31400, Toulouse, France.
| |
Collapse
|
34
|
Abstract
Computational structure-based protein design (CSPD) is an important problem in computational biology, which aims to design or improve a prescribed protein function based on a protein structure template. It provides a practical tool for real-world protein engineering applications. A popular CSPD method that guarantees to find the global minimum energy solution (GMEC) is to combine both dead-end elimination (DEE) and A* tree search algorithms. However, in this framework, the A* search algorithm can run in exponential time in the worst case, which may become the computation bottleneck of large-scale computational protein design process. To address this issue, we extend and add a new module to the OSPREY program that was previously developed in the Donald lab (Gainza et al., Methods Enzymol 523:87, 2013) to implement a GPU-based massively parallel A* algorithm for improving protein design pipeline. By exploiting the modern GPU computational framework and optimizing the computation of the heuristic function for A* search, our new program, called gOSPREY, can provide up to four orders of magnitude speedups in large protein design cases with a small memory overhead comparing to the traditional A* search algorithm implementation, while still guaranteeing the optimality. In addition, gOSPREY can be configured to run in a bounded-memory mode to tackle the problems in which the conformation space is too large and the global optimal solution cannot be computed previously. Furthermore, the GPU-based A* algorithm implemented in the gOSPREY program can be combined with the state-of-the-art rotamer pruning algorithms such as iMinDEE (Gainza et al., PLoS Comput Biol 8:e1002335, 2012) and DEEPer (Hallen et al., Proteins 81:18-39, 2013) to also consider continuous backbone and side-chain flexibility.
Collapse
Affiliation(s)
- Yichao Zhou
- Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, P. R. China
| | - Bruce R Donald
- Department of Computer Science, Duke University, Durham, NC, USA
- Department of Biochemistry, Duke University Medical Center, Durham, NC, USA
| | - Jianyang Zeng
- Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, P. R. China.
| |
Collapse
|
35
|
Druart K, Bigot J, Audit E, Simonson T. A Hybrid Monte Carlo Scheme for Multibackbone Protein Design. J Chem Theory Comput 2016; 12:6035-6048. [DOI: 10.1021/acs.jctc.6b00421] [Citation(s) in RCA: 12] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/30/2022]
Affiliation(s)
- Karen Druart
- Laboratoire
de Biochimie (CNRS UMR7654), Ecole Polytechnique, Palaiseau, France
- Maison
de la Simulation, CEA, CNRS, Univ. Paris-Sud, UVSQ, Université Paris-Saclay, 91191 Gif-sur-Yvette, France
| | - Julien Bigot
- Maison
de la Simulation, CEA, CNRS, Univ. Paris-Sud, UVSQ, Université Paris-Saclay, 91191 Gif-sur-Yvette, France
| | - Edouard Audit
- Maison
de la Simulation, CEA, CNRS, Univ. Paris-Sud, UVSQ, Université Paris-Saclay, 91191 Gif-sur-Yvette, France
| | - Thomas Simonson
- Laboratoire
de Biochimie (CNRS UMR7654), Ecole Polytechnique, Palaiseau, France
| |
Collapse
|
36
|
Hallen MA, Jou JD, Donald BR. LUTE (Local Unpruned Tuple Expansion): Accurate Continuously Flexible Protein Design with General Energy Functions and Rigid Rotamer-Like Efficiency. J Comput Biol 2016; 24:536-546. [PMID: 27681371 DOI: 10.1089/cmb.2016.0136] [Citation(s) in RCA: 17] [Impact Index Per Article: 2.1] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/03/2023] Open
Abstract
Most protein design algorithms search over discrete conformations and an energy function that is residue-pairwise, that is, a sum of terms that depend on the sequence and conformation of at most two residues. Although modeling of continuous flexibility and of non-residue-pairwise energies significantly increases the accuracy of protein design, previous methods to model these phenomena add a significant asymptotic cost to design calculations. We now remove this cost by modeling continuous flexibility and non-residue-pairwise energies in a form suitable for direct input to highly efficient, discrete combinatorial optimization algorithms such as DEE/A* or branch-width minimization. Our novel algorithm performs a local unpruned tuple expansion (LUTE), which can efficiently represent both continuous flexibility and general, possibly nonpairwise energy functions to an arbitrary level of accuracy using a discrete energy matrix. We show using 47 design calculation test cases that LUTE provides a dramatic speedup in both single-state and multistate continuously flexible designs.
Collapse
Affiliation(s)
- Mark A Hallen
- 1 Department of Computer Science, Levine Science Research Center, Duke University , Durham, North Carolina
| | - Jonathan D Jou
- 1 Department of Computer Science, Levine Science Research Center, Duke University , Durham, North Carolina
| | - Bruce R Donald
- 1 Department of Computer Science, Levine Science Research Center, Duke University , Durham, North Carolina.,2 Department of Chemistry, Duke University , Durham, North Carolina.,3 Department of Biochemistry, Duke University Medical Center , Durham, North Carolina
| |
Collapse
|
37
|
Pan Y, Dong Y, Zhou J, Hallen M, Donald BR, Zeng J, Xu W. cOSPREY: A Cloud-Based Distributed Algorithm for Large-Scale Computational Protein Design. J Comput Biol 2016; 23:737-49. [PMID: 27154509 PMCID: PMC5586165 DOI: 10.1089/cmb.2015.0234] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/14/2023] Open
Abstract
Finding the global minimum energy conformation (GMEC) of a huge combinatorial search space is the key challenge in computational protein design (CPD) problems. Traditional algorithms lack a scalable and efficient distributed design scheme, preventing researchers from taking full advantage of current cloud infrastructures. We design cloud OSPREY (cOSPREY), an extension to a widely used protein design software OSPREY, to allow the original design framework to scale to the commercial cloud infrastructures. We propose several novel designs to integrate both algorithm and system optimizations, such as GMEC-specific pruning, state search partitioning, asynchronous algorithm state sharing, and fault tolerance. We evaluate cOSPREY on three different cloud platforms using different technologies and show that it can solve a number of large-scale protein design problems that have not been possible with previous approaches.
Collapse
Affiliation(s)
- Yuchao Pan
- Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China
| | - Yuxi Dong
- Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China
| | - Jingtian Zhou
- Department of Pharmacology and Pharmaceutical Sciences, Tsinghua University, Beijing, China
| | - Mark Hallen
- Department of Computer Science, Duke University, Durham, North Carolina
- Department of Biochemistry, Duke University Medical Center, Durham, North Carolina
| | - Bruce R. Donald
- Department of Computer Science, Duke University, Durham, North Carolina
- Department of Biochemistry, Duke University Medical Center, Durham, North Carolina
| | - Jianyang Zeng
- Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China
| | - Wei Xu
- Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China
| |
Collapse
|
38
|
Hallen MA, Gainza P, Donald BR. Compact Representation of Continuous Energy Surfaces for More Efficient Protein Design. J Chem Theory Comput 2016; 11:2292-306. [PMID: 26089744 DOI: 10.1021/ct501031m] [Citation(s) in RCA: 22] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/30/2022]
Abstract
In macromolecular design, conformational energies are sensitive to small changes in atom coordinates; thus, modeling the small, continuous motions of atoms around low-energy wells confers a substantial advantage in structural accuracy. However, modeling these motions comes at the cost of a very large number of energy function calls, which form the bottleneck in the design calculations. In this work, we remove this bottleneck by consolidating all conformational energy evaluations into the pre-computation of a local polynomial expansion of the energy about the "ideal" conformation for each low-energy, "rotameric" state of each residue pair. This expansion is called "energy as polynomials in internal coordinates" (EPIC), where the internal coordinates can be side-chain dihedrals, backrub angles, and/or any other continuous degrees of freedom of a macromolecule, and any energy function can be used without adding any asymptotic complexity to the design. We demonstrate that EPIC efficiently represents the energy surface for both molecular-mechanics and quantum-mechanical energy functions, and apply it specifically to protein design for modeling both side chain and backbone degrees of freedom.
Collapse
|
39
|
Gainza P, Nisonoff HM, Donald BR. Algorithms for protein design. Curr Opin Struct Biol 2016; 39:16-26. [PMID: 27086078 PMCID: PMC5065368 DOI: 10.1016/j.sbi.2016.03.006] [Citation(s) in RCA: 58] [Impact Index Per Article: 7.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/17/2015] [Revised: 03/15/2016] [Accepted: 03/22/2016] [Indexed: 02/05/2023]
Abstract
Computational structure-based protein design programs are becoming an increasingly important tool in molecular biology. These programs compute protein sequences that are predicted to fold to a target structure and perform a desired function. The success of a program's predictions largely relies on two components: first, the input biophysical model, and second, the algorithm that computes the best sequence(s) and structure(s) according to the biophysical model. Improving both the model and the algorithm in tandem is essential to improving the success rate of current programs, and here we review recent developments in algorithms for protein design, emphasizing how novel algorithms enable the use of more accurate biophysical models. We conclude with a list of algorithmic challenges in computational protein design that we believe will be especially important for the design of therapeutic proteins and protein assemblies.
Collapse
Affiliation(s)
- Pablo Gainza
- Department of Computer Science, Duke University, Durham, NC, United States
| | - Hunter M Nisonoff
- Department of Computer Science, Duke University, Durham, NC, United States
| | - Bruce R Donald
- Department of Computer Science, Duke University, Durham, NC, United States; Department of Biochemistry, Duke University Medical Center, Durham, NC, United States; Department of Chemistry, Duke University, Durham, NC, United States.
| |
Collapse
|
40
|
Sun MGF, Seo MH, Nim S, Corbi-Verge C, Kim PM. Protein engineering by highly parallel screening of computationally designed variants. SCIENCE ADVANCES 2016; 2:e1600692. [PMID: 27453948 PMCID: PMC4956399 DOI: 10.1126/sciadv.1600692] [Citation(s) in RCA: 30] [Impact Index Per Article: 3.8] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 03/31/2016] [Accepted: 06/23/2016] [Indexed: 06/06/2023]
Abstract
Current combinatorial selection strategies for protein engineering have been successful at generating binders against a range of targets; however, the combinatorial nature of the libraries and their vast undersampling of sequence space inherently limit these methods due to the difficulty in finely controlling protein properties of the engineered region. Meanwhile, great advances in computational protein design that can address these issues have largely been underutilized. We describe an integrated approach that computationally designs thousands of individual protein binders for high-throughput synthesis and selection to engineer high-affinity binders. We show that a computationally designed library enriches for tight-binding variants by many orders of magnitude as compared to conventional randomization strategies. We thus demonstrate the feasibility of our approach in a proof-of-concept study and successfully obtain low-nanomolar binders using in vitro and in vivo selection systems.
Collapse
Affiliation(s)
- Mark G. F. Sun
- Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3E1, Canada
- Terrence Donnelly Centre for Cellular and Biomolecular Research, University of Toronto, Toronto, Ontario M5S 3E1, Canada
| | - Moon-Hyeong Seo
- Terrence Donnelly Centre for Cellular and Biomolecular Research, University of Toronto, Toronto, Ontario M5S 3E1, Canada
| | - Satra Nim
- Terrence Donnelly Centre for Cellular and Biomolecular Research, University of Toronto, Toronto, Ontario M5S 3E1, Canada
| | - Carles Corbi-Verge
- Terrence Donnelly Centre for Cellular and Biomolecular Research, University of Toronto, Toronto, Ontario M5S 3E1, Canada
| | - Philip M. Kim
- Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3E1, Canada
- Terrence Donnelly Centre for Cellular and Biomolecular Research, University of Toronto, Toronto, Ontario M5S 3E1, Canada
- Department of Molecular Genetics, University of Toronto, Toronto, Ontario M5S 3E1, Canada
| |
Collapse
|
41
|
Liu H, Chen Q. Computational protein design for given backbone: recent progresses in general method-related aspects. Curr Opin Struct Biol 2016; 39:89-95. [PMID: 27348345 DOI: 10.1016/j.sbi.2016.06.013] [Citation(s) in RCA: 17] [Impact Index Per Article: 2.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/06/2016] [Revised: 05/18/2016] [Accepted: 06/15/2016] [Indexed: 10/21/2022]
Abstract
To achieve high success rate in protein design requires a reliable sequence design method to find amino acid sequences that stably fold into a desired backbone structure. This problem is addressed by computational protein design through the approach of energy minimization. Here we review recent method progresses related to improving the accuracy of this approach. First, the quality of the energy model is a key factor. Second, with structure sensitive energy functions, whether and how backbone flexibility is considered can have large effects on design accuracy, although usually only small adjustments of the backbone structure itself are involved. Third, the effective accuracy of design results can be boosted by post-processing a small number of designed sequences with complementary models that may not be efficient enough for full sequence optimization. Finally, computational method development will benefit greatly from increasingly efficient experimental approaches that can be applied to obtain extensive feedbacks.
Collapse
Affiliation(s)
- Haiyan Liu
- School of Life Sciences, University of Science and Technology of China, China; Hefei National Laboratory for Physical Sciences at the Microscales, China; Collaborative Innovation Center of Chemistry for Life Sciences, Hefei, Anhui 230027, China; Hefei Institutes of Physical Science, Chinese Academy of Sciences, Hefei, Anhui 230031, China.
| | - Quan Chen
- School of Life Sciences, University of Science and Technology of China, China
| |
Collapse
|
42
|
Xiao X, Agris PF, Hall CK. Designing peptide sequences in flexible chain conformations to bind RNA: a search algorithm combining Monte Carlo, self-consistent mean field and concerted rotation techniques. J Chem Theory Comput 2016; 11:740-52. [PMID: 26579605 DOI: 10.1021/ct5008247] [Citation(s) in RCA: 13] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/20/2023]
Abstract
A search algorithm combining Monte Carlo, self-consistent mean field, and concerted rotation techniques was developed to discover peptide sequences that are reasonable HIV drug candidates due to their exceptional binding to human tRNAUUU(Lys3), the primer of HIV replication. The search algorithm allows for iteration between sequence mutations and conformation changes during sequence evolution. Searches conducted for different classes of peptides identified several potential peptide candidates. Analysis of the energy revealed that the asparagine and cysteine at residues 11 and 12 play important roles in "recognizing" tRNA(Lys3) via van der Waals interactions, contributing to binding specificity. Arginines preferentially attract the phosphate linkage via charge-charge interaction, contributing to binding affinity. Evaluation of the RNA/peptide complex's structure revealed that adding conformation changes to the search algorithm yields peptides with better binding affinity and specificity to tRNA(Lys3) than a previous mutation-only algorithm.
Collapse
Affiliation(s)
- Xingqing Xiao
- Chemical and Biomolecular Engineering Department, North Carolina State University , Raleigh, North Carolina 27695-7905, United States
| | - Paul F Agris
- The RNA Institute, University at Albany, State University of New York , Albany, New York 12222, United States
| | - Carol K Hall
- Chemical and Biomolecular Engineering Department, North Carolina State University , Raleigh, North Carolina 27695-7905, United States
| |
Collapse
|
43
|
Taghizadeh M, Goliaei B, Madadkar-Sobhani A. Variability of the Cyclin-Dependent Kinase 2 Flexibility Without Significant Change in the Initial Conformation of the Protein or Its Environment; a Computational Study. IRANIAN JOURNAL OF BIOTECHNOLOGY 2016; 14:1-12. [PMID: 28959320 DOI: 10.15171/ijb.1419] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
BACKGROUND Protein flexibility, which has been referred as a dynamic behavior has various roles in proteins' functions. Furthermore, for some developed tools in bioinformatics, such as protein-protein docking software, considering the protein flexibility, causes a higher degree of accuracy. Through undertaking the present work, we have accomplished the quantification plus analysis of the variations in the human Cyclin Dependent Kinase 2 (hCDK2) protein flexibility without affecting a significant change in its initial environment or the protein per se. OBJECTIVES The main goal of the present research was to calculate variations in the flexibility for each residue of the hCDK2, analysis of their flexibility variations through clustering, and to investigate the functional aspects of the residues with high flexibility variations. MATERIALS AND METHODS Using Gromacs package (version 4.5.4), three independent molecular dynamics (MD) simulations of the hCDK2 protein (PDB ID: 1HCL) was accomplished with no significant changes in their initial environments, structures, or conformations, followed by Root Mean Square Fluctuations (RMSF) calculation of these MD trajectories. The amount of variations in these three curves of RMSF was calculated using two formulas. RESULTS More than 50% of the variation in the flexibility (the distance between the maximum and the minimum amount of the RMSF) was found at the region of Val-154. As well, there are other major flexibility fluctuations in other residues. These residues were mostly positioned in the vicinity of the functional residues. The subsequent works were done, as followed by clustering all hCDK2 residues into four groups considering the amount of their variability with respect to flexibility and their position in the RMSF curves. CONCLUSIONS This work has introduced a new class of flexibility aspect of the proteins' residues. It could also help designing and engineering proteins, with introducing a new dynamic aspect of hCDK2, and accordingly, for the other similar globular proteins. In addition, it could provide a better computational calculation of the protein flexibility, which is, especially important in the comparative studies of the proteins' flexibility.
Collapse
Affiliation(s)
- Mohammad Taghizadeh
- Laboratory of Biophysics and Molecular Biology, Institute of Biochemistry and Biophysics, University of Tehran, Tehran, Iran
| | - Bahram Goliaei
- Laboratory of Biophysics and Molecular Biology, Institute of Biochemistry and Biophysics, University of Tehran, Tehran, Iran
| | | |
Collapse
|
44
|
Traoré S, Roberts KE, Allouche D, Donald BR, André I, Schiex T, Barbe S. Fast search algorithms for computational protein design. J Comput Chem 2016; 37:1048-58. [PMID: 26833706 PMCID: PMC4828276 DOI: 10.1002/jcc.24290] [Citation(s) in RCA: 26] [Impact Index Per Article: 3.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/14/2015] [Revised: 09/23/2015] [Accepted: 11/27/2015] [Indexed: 12/12/2022]
Abstract
One of the main challenges in computational protein design (CPD) is the huge size of the protein sequence and conformational space that has to be computationally explored. Recently, we showed that state-of-the-art combinatorial optimization technologies based on Cost Function Network (CFN) processing allow speeding up provable rigid backbone protein design methods by several orders of magnitudes. Building up on this, we improved and injected CFN technology into the well-established CPD package Osprey to allow all Osprey CPD algorithms to benefit from associated speedups. Because Osprey fundamentally relies on the ability of A* to produce conformations in increasing order of energy, we defined new A* strategies combining CFN lower bounds, with new side-chain positioning-based branching scheme. Beyond the speedups obtained in the new A*-CFN combination, this novel branching scheme enables a much faster enumeration of suboptimal sequences, far beyond what is reachable without it. Together with the immediate and important speedups provided by CFN technology, these developments directly benefit to all the algorithms that previously relied on the DEE/ A* combination inside Osprey* and make it possible to solve larger CPD problems with provable algorithms.
Collapse
Affiliation(s)
- Seydou Traoré
- Université de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France
- INRA, UMR792, Ingénierie des Systèmes Biologiques et des Procédés, F-31400 Toulouse, France
- CNRS, UMR5504, F-31400 Toulouse, France
| | - Kyle E. Roberts
- Department of Biochemistry, Department of Computer Science, Department of Chemistry, Duke University, Durham, NC, USA
| | - David Allouche
- Unité de Mathématiques et Informatique Appliquées de Toulouse, UR 875, INRA, F-31320 Castanet Tolosan, France
| | - Bruce R. Donald
- Department of Biochemistry, Department of Computer Science, Department of Chemistry, Duke University, Durham, NC, USA
| | - Isabelle André
- Université de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France
- INRA, UMR792, Ingénierie des Systèmes Biologiques et des Procédés, F-31400 Toulouse, France
- CNRS, UMR5504, F-31400 Toulouse, France
| | - Thomas Schiex
- Unité de Mathématiques et Informatique Appliquées de Toulouse, UR 875, INRA, F-31320 Castanet Tolosan, France
| | - Sophie Barbe
- Université de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France
- INRA, UMR792, Ingénierie des Systèmes Biologiques et des Procédés, F-31400 Toulouse, France
- CNRS, UMR5504, F-31400 Toulouse, France
| |
Collapse
|
45
|
Purvine E, Monson K, Jurrus E, Star K, Baker NA. Energy Minimization of Discrete Protein Titration State Models Using Graph Theory. J Phys Chem B 2016; 120:8354-60. [PMID: 27089174 DOI: 10.1021/acs.jpcb.6b02059] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/28/2022]
Abstract
There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.
Collapse
Affiliation(s)
| | | | | | | | - Nathan A Baker
- Division of Applied Mathematics, Brown University , Providence, Rhode Island 02912, United States
| |
Collapse
|
46
|
Hallen MA, Donald BR. 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; 23:311-21. [PMID: 26761641 DOI: 10.1089/cmb.2015.0188] [Citation(s) in RCA: 27] [Impact Index Per Article: 3.4] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022] Open
Abstract
Practical protein design problems require designing sequences with a combination of affinity, stability, and specificity requirements. Multistate protein design algorithms model multiple structural or binding "states" of a protein to address these requirements. comets provides a new level of versatile, efficient, and provable multistate design. It provably returns the minimum with respect to sequence of any desired linear combination of the energies of multiple protein states, subject to constraints on other linear combinations. Thus, it can target nearly any combination of affinity (to one or multiple ligands), specificity, and stability (for multiple states if needed). Empirical calculations on 52 protein design problems showed comets is far more efficient than the previous state of the art for provable multistate design (exhaustive search over sequences). comets can handle a very wide range of protein flexibility and can enumerate a gap-free list of the best constraint-satisfying sequences in order of objective function value.
Collapse
Affiliation(s)
- Mark A Hallen
- 1 Department of Computer Science, Levine Science Research Center, Duke University , North Carolina
- 2 Department of Biochemistry, Duke University Medical Center , Durham, North Carolina
| | - Bruce R Donald
- 1 Department of Computer Science, Levine Science Research Center, Duke University , North Carolina
- 2 Department of Biochemistry, Duke University Medical Center , Durham, North Carolina
- 3 Department of Chemistry, Duke University , Durham, North Carolina
| |
Collapse
|
47
|
Jou JD, Jain S, Georgiev IS, Donald BR. BWM*: A Novel, Provable, Ensemble-based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design. J Comput Biol 2016; 23:413-24. [PMID: 26744898 DOI: 10.1089/cmb.2015.0194] [Citation(s) in RCA: 22] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/13/2022] Open
Abstract
Sparse energy functions that ignore long range interactions between residue pairs are frequently used by protein design algorithms to reduce computational cost. Current dynamic programming algorithms that fully exploit the optimal substructure produced by these energy functions only compute the GMEC. This disproportionately favors the sequence of a single, static conformation and overlooks better binding sequences with multiple low-energy conformations. Provable, ensemble-based algorithms such as A* avoid this problem, but A* cannot guarantee better performance than exhaustive enumeration. We propose a novel, provable, dynamic programming algorithm called Branch-Width Minimization* (BWM*) to enumerate a gap-free ensemble of conformations in order of increasing energy. Given a branch-decomposition of branch-width w for an n-residue protein design with at most q discrete side-chain conformations per residue, BWM* returns the sparse GMEC in O([Formula: see text]) time and enumerates each additional conformation in merely O([Formula: see text]) time. We define a new measure, Total Effective Search Space (TESS), which can be computed efficiently a priori before BWM* or A* is run. We ran BWM* on 67 protein design problems and found that TESS discriminated between BWM*-efficient and A*-efficient cases with 100% accuracy. As predicted by TESS and validated experimentally, BWM* outperforms A* in 73% of the cases and computes the full ensemble or a close approximation faster than A*, enumerating each additional conformation in milliseconds. Unlike A*, the performance of BWM* can be predicted in polynomial time before running the algorithm, which gives protein designers the power to choose the most efficient algorithm for their particular design problem.
Collapse
Affiliation(s)
- Jonathan D Jou
- 1 Department of Computer Science, Duke University , Durham, North Carolina
| | - Swati Jain
- 1 Department of Computer Science, Duke University , Durham, North Carolina.,2 Department of Biochemistry, Duke University Medical Center , Durham, North Carolina.,3 Department of Computational Biology and Bioinformatics Program, Duke University , Durham, North Carolina
| | - Ivelin S Georgiev
- 1 Department of Computer Science, Duke University , Durham, North Carolina
| | - Bruce R Donald
- 1 Department of Computer Science, Duke University , Durham, North Carolina.,2 Department of Biochemistry, Duke University Medical Center , Durham, North Carolina.,4 Department of Chemistry, Duke University , Durham, North Carolina
| |
Collapse
|
48
|
Simoncini D, Allouche D, de Givry S, Delmas C, Barbe S, Schiex T. Guaranteed Discrete Energy Optimization on Large Protein Design Problems. J Chem Theory Comput 2015; 11:5980-9. [DOI: 10.1021/acs.jctc.5b00594] [Citation(s) in RCA: 49] [Impact Index Per Article: 5.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/28/2022]
Affiliation(s)
| | - David Allouche
- INRA MIAT, UR 875, Castanet-Tolosan, 31326 Cedex, France
| | - Simon de Givry
- INRA MIAT, UR 875, Castanet-Tolosan, 31326 Cedex, France
| | - Céline Delmas
- INRA MIAT, UR 875, Castanet-Tolosan, 31326 Cedex, France
| | - Sophie Barbe
- Université de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France
- CNRS, UMR5504, F-31400 Toulouse, France
- INRA, UMR792 Ingénierie des Systèmes Biologiques et des Procédés, F-31400 Toulouse, France
| | - Thomas Schiex
- INRA MIAT, UR 875, Castanet-Tolosan, 31326 Cedex, France
| |
Collapse
|
49
|
Keedy DA, Fraser JS, van den Bedem H. Exposing Hidden Alternative Backbone Conformations in X-ray Crystallography Using qFit. PLoS Comput Biol 2015; 11:e1004507. [PMID: 26506617 PMCID: PMC4624436 DOI: 10.1371/journal.pcbi.1004507] [Citation(s) in RCA: 59] [Impact Index Per Article: 6.6] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/05/2015] [Accepted: 06/22/2015] [Indexed: 12/13/2022] Open
Abstract
Proteins must move between different conformations of their native ensemble to perform their functions. Crystal structures obtained from high-resolution X-ray diffraction data reflect this heterogeneity as a spatial and temporal conformational average. Although movement between natively populated alternative conformations can be critical for characterizing molecular mechanisms, it is challenging to identify these conformations within electron density maps. Alternative side chain conformations are generally well separated into distinct rotameric conformations, but alternative backbone conformations can overlap at several atomic positions. Our model building program qFit uses mixed integer quadratic programming (MIQP) to evaluate an extremely large number of combinations of sidechain conformers and backbone fragments to locally explain the electron density. Here, we describe two major modeling enhancements to qFit: peptide flips and alternative glycine conformations. We find that peptide flips fall into four stereotypical clusters and are enriched in glycine residues at the n+1 position. The potential for insights uncovered by new peptide flips and glycine conformations is exemplified by HIV protease, where different inhibitors are associated with peptide flips in the “flap” regions adjacent to the inhibitor binding site. Our results paint a picture of peptide flips as conformational switches, often enabled by glycine flexibility, that result in dramatic local rearrangements. Our results furthermore demonstrate the power of large-scale computational analysis to provide new insights into conformational heterogeneity. Overall, improved modeling of backbone heterogeneity with high-resolution X-ray data will connect dynamics to the structure-function relationship and help drive new design strategies for inhibitors of biomedically important systems. Describing the multiple conformations of proteins is important for understanding the relationship between molecular flexibility and function. However, most methods for interpreting data from X-ray crystallography focus on building a single structure of the protein, which limits the potential for biological insights. Here we introduce an improved algorithm for using crystallographic data to model these multiple conformations that addresses two previously overlooked types of protein backbone flexibility: peptide flips and glycine movements. The method successfully models known examples of these types of multiple conformations, and also identifies new cases that were previously unrecognized but are well supported by the experimental data. For example, we discover glycine-driven peptide flips in the inhibitor-gating “flaps” of the drug target HIV protease that were not modeled in the original structures. Automatically modeling “hidden” multiple conformations of proteins using our algorithm may help drive biomedically relevant insights in structural biology pertaining to, e.g., drug discovery for HIV–1 protease and other therapeutic targets.
Collapse
Affiliation(s)
- Daniel A. Keedy
- Department of Bioengineering and Therapeutic Sciences, University of California, San Francisco, San Francisco, California, United States of America
| | - James S. Fraser
- Department of Bioengineering and Therapeutic Sciences, University of California, San Francisco, San Francisco, California, United States of America
| | - Henry van den Bedem
- Division of Biosciences, SLAC National Accelerator Laboratory, Stanford University, California, United States of America
- * E-mail:
| |
Collapse
|
50
|
Roberts KE, Gainza P, Hallen MA, Donald BR. Fast gap-free enumeration of conformations and sequences for protein design. Proteins 2015; 83:1859-1877. [PMID: 26235965 DOI: 10.1002/prot.24870] [Citation(s) in RCA: 18] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/24/2015] [Revised: 07/14/2015] [Accepted: 07/21/2015] [Indexed: 12/12/2022]
Abstract
Despite significant successes in structure-based computational protein design in recent years, protein design algorithms must be improved to increase the biological accuracy of new designs. Protein design algorithms search through an exponential number of protein conformations, protein ensembles, and amino acid sequences in an attempt to find globally optimal structures with a desired biological function. To improve the biological accuracy of protein designs, it is necessary to increase both the amount of protein flexibility allowed during the search and the overall size of the design, while guaranteeing that the lowest-energy structures and sequences are found. DEE/A*-based algorithms are the most prevalent provable algorithms in the field of protein design and can provably enumerate a gap-free list of low-energy protein conformations, which is necessary for ensemble-based algorithms that predict protein binding. We present two classes of algorithmic improvements to the A* algorithm that greatly increase the efficiency of A*. First, we analyze the effect of ordering the expansion of mutable residue positions within the A* tree and present a dynamic residue ordering that reduces the number of A* nodes that must be visited during the search. Second, we propose new methods to improve the conformational bounds used to estimate the energies of partial conformations during the A* search. The residue ordering techniques and improved bounds can be combined for additional increases in A* efficiency. Our enhancements enable all A*-based methods to more fully search protein conformation space, which will ultimately improve the accuracy of complex biomedically relevant designs.
Collapse
Affiliation(s)
- Kyle E Roberts
- Department of Computer Science, Duke University, Durham, NC
| | - Pablo Gainza
- Department of Computer Science, Duke University, Durham, NC
| | - Mark A Hallen
- Department of Computer Science, Duke University, Durham, NC
| | - Bruce R Donald
- Department of Computer Science, Duke University, Durham, NC.,Department of Biochemistry, Duke University Medical Center, Durham, NC.,Department of Chemistry, Duke University, Durham, NC
| |
Collapse
|