Protein Design Algorithms Research Articles

De novo design of knotted tandem repeat proteins

De novo protein design methods can create proteins with folds not yet seen in nature. These methods largely focus on optimizing the compatibility between the designed sequence and the intended conformation, without explicit consideration of protein folding pathways. Deeply knotted proteins, whose topologies may introduce substantial barriers to folding, thus represent an interesting test case for protein design. Here we report our attempts to design proteins with trefoil (31) and pentafoil (51) knotted topologies. We extended previously described algorithms for tandem repeat protein design in order to construct deeply knotted backbones and matching designed repeat sequences (N = 3 repeats for the trefoil and N = 5 for the pentafoil). We confirmed the intended conformation for the trefoil design by X ray crystallography, and we report here on this protein’s structure, stability, and folding behaviour. The pentafoil design misfolded into an asymmetric structure (despite a 5-fold symmetric sequence); two of the four repeat-repeat units matched the designed backbone while the other two diverged to form local contacts, leading to a trefoil rather than pentafoil knotted topology. Our results also provide insights into the folding of knotted proteins.

In Silico and In Vitro Evaluation of Bevacizumab Biosimilar MB02 as an Antitumor Agent in Canine Mammary Carcinoma.

Canine mammary carcinomas (CMC) are associated with major aggressive clinical behavior and high mortality. The current standard of care is based on surgical resection, without an established effective treatment scheme, highlighting the urgent need to develop novel effective therapies. Vascular endothelial growth factor (VEGF) is a key regulator of tumor angiogenesis and progression in the majority of solid cancers, including human and canine mammary carcinomas. The first therapy developed to target VEGF was bevacizumab, a recombinant humanized monoclonal antibody, which has already been approved as an anticancer agent in several human cancers. The goal of this work was to establish the therapeutic value of MB02 bevacizumab biosimilar in CMC. First, through different in silico approaches using the MUSCLE multiple-sequence alignment tool and the FoldX protein design algorithm, we were able to predict that canine VEGF is recognized by bevacizumab, after showing an extremely high sequence similarity between canine and human VEGF. Further, by using an ELISA-based in vitro binding assay, we confirmed that MB02 biosimilar was able to recognize canine VEGF. Additionally, canine VEGF-induced microvascular endothelial cell proliferation was inhibited in a concentration-dependent manner by MB02 biosimilar. These encouraging results show a high potential for MB02 as a promising therapeutic agent for the management of CMC.

Generate Biomedicines opens cryo-EM lab to feed data back into its protein design algorithms

Generate Biomedicines opens cryo-EM lab to feed data back into its protein design algorithms

A sequence space search engine for computational protein design to modulate molecular functionality

De-novo protein design explores the untapped sequence space that is otherwise less discovered during the evolutionary process. This necessitates an efficient sequence space search engine for effective convergence in computational protein design. We propose a greedy simulated annealing-based Monte-Carlo parallel search algorithm for better sequence-structure compatibility probing in protein design. The guidance provided by the evolutionary profile, the greedy approach, and the cooling schedule adopted in the Monte Carlo simulation ensures sufficient exploration and exploitation of the search space leading to faster convergence. On evaluating the proposed algorithm, we find that a dataset of 76 target scaffolds report an average root-mean-square-deviation (RMSD) of 1.07 Å and an average TM-Score of 0.93 with the modeled designed protein sequences. High sequence recapitulation of 48.7% (59.4%) observed in the design sequences for all (hydrophobic) solvent-inaccessible residues again establish the goodness of the proposed algorithm. A high (93.4%) intra-group recapitulation of hydrophobic residues in the solvent-inaccessible region indicates that the proposed protein design algorithm preserves the core residues in the protein and provides alternative residue combinations in the solvent-accessible regions of the target protein. Furthermore, a COFACTOR-based protein functional analysis shows that the design sequences exhibit altered molecular functionality and introduce new molecular functions compared to the target scaffolds. Communicated by Ramaswamy H. Sarma

Chiral evasion and stereospecific antifolate resistance in Staphylococcus aureus

Antimicrobial resistance presents a significant health care crisis. The mutation F98Y in Staphylococcus aureus dihydrofolate reductase (SaDHFR) confers resistance to the clinically important antifolate trimethoprim (TMP). Propargyl-linked antifolates (PLAs), next generation DHFR inhibitors, are much more resilient than TMP against this F98Y variant, yet this F98Y substitution still reduces efficacy of these agents. Surprisingly, differences in the enantiomeric configuration at the stereogenic center of PLAs influence the isomeric state of the NADPH cofactor. To understand the molecular basis of F98Y-mediated resistance and how PLAs' inhibition drives NADPH isomeric states, we used protein design algorithms in the osprey protein design software suite to analyze a comprehensive suite of structural, biophysical, biochemical, and computational data. Here, we present a model showing how F98Y SaDHFR exploits a different anomeric configuration of NADPH to evade certain PLAs' inhibition, while other PLAs remain unaffected by this resistance mechanism.

Algorithms for protein design.

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.

Modularity-based parallel protein design algorithm with an implementation using shared memory programming.

Given a target protein structure, the prime objective of protein design is to find amino acid sequences that will fold/acquire to the given three-dimensional structure. The protein design problem belongs to the non-deterministic polynomial-time-hard class as sequence search space increases exponentially with protein length. To ensure better search space exploration and faster convergence, we propose a protein modularity-based parallel protein design algorithm. The modular architecture of the protein structure is exploited by considering an intermediate structural organization between secondary structure and domain defined as protein unit (PU). Here, we have incorporated a divide-and-conquer approach where a protein is split into PUs and each PU region is explored in a parallel fashion. It has been further analyzed that our shared memory implementation of modularity-based parallel sequence search leads to better search space exploration compared to the case of traditional full protein design. Sequence-based analysis on design sequences depicts an average of 39.7% sequence similarity on the benchmark data set. Structure-based comparison of the modeled structures of the design protein with the target structure exhibited an average root-mean-square deviation of 1.17 Å and an average template modeling score of 0.89. The selected modeled structures of the design protein sequences are validated using 100 ns molecular dynamics simulations where 80% of the proteins have shown better or similar stability to the respective target proteins. Our study informs that our modularity-based protein design algorithm can be extended to protein interaction design as well.

Computationally designed pyocyanin demethylase acts synergistically with tobramycin to kill recalcitrant Pseudomonas aeruginosa biofilms

Pseudomonas aeruginosa is an opportunistic human pathogen that develops difficult-to-treat biofilms in immunocompromised individuals, cystic fibrosis patients, and in chronic wounds. P. aeruginosa has an arsenal of physiological attributes that enable it to evade standard antibiotic treatments, particularly in the context of biofilms where it grows slowly and becomes tolerant to many drugs. One of its survival strategies involves the production of the redox-active phenazine, pyocyanin, which promotes biofilm development. We previously identified an enzyme, PodA, that demethylated pyocyanin and disrupted P. aeruginosa biofilm development in vitro. Here, we asked if this protein could be used as a potential therapeutic for P. aeruginosa infections together with tobramycin, an antibiotic typically used in the clinic. A major roadblock to answering this question was the poor yield and stability of wild-type PodA purified from standard Escherichia coli overexpression systems. We hypothesized that the insufficient yields were due to poor packing within PodA's obligatory homotrimeric interfaces. We therefore applied the protein design algorithm, AffiLib, to optimize the symmetric core of this interface, resulting in a design that incorporated five mutations leading to a 20-fold increase in protein yield from heterologous expression and purification and a substantial increase in stability to environmental conditions. The addition of the designed PodA with tobramycin led to increased killing of P. aeruginosa cultures under oxic and hypoxic conditions in both the planktonic and biofilm states. This study highlights the potential for targeting extracellular metabolites to assist the control of P. aeruginosa biofilms that tolerate conventional antibiotic treatment.

Computational design of SARS-CoV-2 spike glycoproteins to increase immunogenicity by T cell epitope engineering

The development of effective and safe vaccines is the ultimate way to efficiently stop the ongoing COVID-19 pandemic, which is caused by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). Built on the fact that SARS-CoV-2 utilizes the association of its Spike (S) protein with the human angiotensin-converting enzyme 2 (ACE2) receptor to invade host cells, we computationally redesigned the S protein sequence to improve its immunogenicity and antigenicity. Toward this purpose, we extended an evolutionary protein design algorithm, EvoDesign, to create thousands of stable S protein variants that perturb the core protein sequence but keep the surface conformation and B cell epitopes. The T cell epitope content and similarity scores of the perturbed sequences were calculated and evaluated. Out of 22,914 designs with favorable stability energy, 301 candidates contained at least two pre-existing immunity-related epitopes and had promising immunogenic potential. The benchmark tests showed that, although the epitope restraints were not included in the scoring function of EvoDesign, the top S protein design successfully recovered 31 out of the 32 major histocompatibility complex (MHC)-II T cell promiscuous epitopes in the native S protein, where two epitopes were present in all seven human coronaviruses. Moreover, the newly designed S protein introduced nine new MHC-II T cell promiscuous epitopes that do not exist in the wildtype SARS-CoV-2. These results demonstrated a new and effective avenue to enhance a target protein’s immunogenicity using rational protein design, which could be applied for new vaccine design against COVID-19 and other pathogens.

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.

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.

De novo protein design enables the precise induction of RSV-neutralizing antibodies.

De novo protein design has been successful in expanding the natural protein repertoire. However, most de novo proteins lack biological function, presenting a major methodological challenge. In vaccinology, the induction of precise antibody responses remains a cornerstone for next-generation vaccines. Here, we present a protein design algorithm called TopoBuilder, with which we engineered epitope-focused immunogens displaying complex structural motifs. In both mice and nonhuman primates, cocktails of three de novo-designed immunogens induced robust neutralizing responses against the respiratory syncytial virus. Furthermore, the immunogens refocused preexisting antibody responses toward defined neutralization epitopes. Overall, our design approach opens the possibility of targeting specific epitopes for the development of vaccines and therapeutic antibodies and, more generally, will be applicable to the design of de novo proteins displaying complex functional motifs.

TopoBuilding precision vaccines

Vaccinology To induce strong and targeted neutralizing antibody (nAb) responses against vaccine targets, one strategy has been to use computationally designed immunogens. However, the structural complexity of many known neutralization epitopes has posed a major challenge for the design of accurate epitope mimetics. Sesterhenn et al. created a protein design algorithm called TopoBuilder to design scaffolds for irregular and discontinuous neutralization epitopes. As a proof of principle, the authors generated epitope-focused immunogens based on the prefusion conformation of the respiratory syncytial virus (RSV) fusion protein. When these immunogens were used to vaccinate mice and nonhuman primates in RSV infection models, they generated targeted nAb responses to RSV and boosted site-specific nAb responses in heterologous prime-boost vaccination schemes. Science , this issue p. [eaay5051][1] [1]: /lookup/doi/10.1126/science.aay5051

Minimization-Aware Recursive K*: A Novel, Provable Algorithm that Accelerates Ensemble-Based Protein Design and Provably Approximates the Energy Landscape.

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.

Computational redesign of the Escherichia coli ribose-binding protein ligand binding pocket for 1,3-cyclohexanediol and cyclohexanol

Bacterial periplasmic-binding proteins have been acclaimed as general biosensing platform, but their range of natural ligands is too limited for optimal development of chemical compound detection. Computational redesign of the ligand-binding pocket of periplasmic-binding proteins may yield variants with new properties, but, despite earlier claims, genuine changes of specificity to non-natural ligands have so far not been achieved. In order to better understand the reasons of such limited success, we revisited here the Escherichia coli RbsB ribose-binding protein, aiming to achieve perceptible transition from ribose to structurally related chemical ligands 1,3-cyclohexanediol and cyclohexanol. Combinations of mutations were computationally predicted for nine residues in the RbsB binding pocket, then synthesized and tested in an E. coli reporter chassis. Two million variants were screened in a microcolony-in-bead fluorescence-assisted sorting procedure, which yielded six mutants no longer responsive to ribose but with 1.2–1.5 times induction in presence of 1 mM 1,3-cyclohexanediol, one of which responded to cyclohexanol as well. Isothermal microcalorimetry confirmed 1,3-cyclohexanediol binding, although only two mutant proteins were sufficiently stable upon purification. Circular dichroism spectroscopy indicated discernable structural differences between these two mutant proteins and wild-type RbsB. This and further quantification of periplasmic-space abundance suggested most mutants to be prone to misfolding and/or with defects in translocation compared to wild-type. Our results thus affirm that computational design and library screening can yield RbsB mutants with recognition of non-natural but structurally similar ligands. The inherent arisal of protein instability or misfolding concomitant with designed altered ligand-binding pockets should be overcome by new experimental strategies or by improved future protein design algorithms.

Protein Design by Provable Algorithms.

Protein design algorithms can leverage provable guarantees of accuracy to provide new insights and unique optimized molecules.

PLUG (Pruning of Local Unrealistic Geometries) removes restrictions on biophysical modeling for protein design.

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).

Design of Peptoid-peptide Macrocycles to Inhibit the \u03b2-catenin TCF Interaction in Prostate Cancer

New chemical inhibitors of protein–protein interactions are needed to propel advances in molecular pharmacology. Peptoids are peptidomimetic oligomers with the capability to inhibit protein-protein interactions by mimicking protein secondary structure motifs. Here we report the in silico design of a macrocycle primarily composed of peptoid subunits that targets the β-catenin:TCF interaction. The β-catenin:TCF interaction plays a critical role in the Wnt signaling pathway which is over-activated in multiple cancers, including prostate cancer. Using the Rosetta suite of protein design algorithms, we evaluate how different macrocycle structures can bind a pocket on β-catenin that associates with TCF. The in silico designed macrocycles are screened in vitro using luciferase reporters to identify promising compounds. The most active macrocycle inhibits both Wnt and AR-signaling in prostate cancer cell lines, and markedly diminishes their proliferation. In vivo potential is demonstrated through a zebrafish model, in which Wnt signaling is potently inhibited.

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.

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.

Protein Engineering Approaches in the Post-Genomic Era.

Proteins are one of the most multifaceted macromolecules in living systems. Proteins have evolved to function under physiological conditions and, therefore, are not usually tolerant of harsh experimental and environmental conditions. The growing use of proteins in industrial processes as a greener alternative to chemical catalysts often demands constant innovation to improve their performance. Protein engineering aims to design new proteins or modify the sequence of a protein to create proteins with new or desirable functions. With the emergence of structural and functional genomics, protein engineering has been invigorated in the post-genomic era. The three-dimensional structures of proteins with known functions facilitate protein engineering approaches to design variants with desired properties. There are three major approaches of protein engineering research, namely, directed evolution, rational design, and de novo design. Rational design is an effective method of protein engineering when the threedimensional structure and mechanism of the protein is well known. In contrast, directed evolution does not require extensive information and a three-dimensional structure of the protein of interest. Instead, it involves random mutagenesis and selection to screen enzymes with desired properties. De novo design uses computational protein design algorithms to tailor synthetic proteins by using the three-dimensional structures of natural proteins and their folding rules. The present review highlights and summarizes recent protein engineering approaches, and their challenges and limitations in the post-genomic era.

Generation of rationally-designed nerve growth factor (NGF) variants with receptor specificity

Nerve growth factor (NGF) is the prototypic member of the neurotrophin family and binds two receptors, TrkA and the 75 kDa neurotrophin receptor (p75NTR), through which diverse and sometimes opposing effects are mediated. Using the FoldX protein design algorithm, we generated eight NGF variants with different point mutations predicted to have altered binding to TrkA or p75NTR. Of these, the I31R NGF variant exhibited specific binding to p75NTR. The generation of this NGF variant with selective affinity for p75NTR can be used to enhance understanding of neurotrophin receptor imbalance in diseases and identifies a key targetable residue for the development of small molecules to disrupt binding of NGF to TrkA with potential uses in chronic pain.