Computational design of a PDZ domain peptide inhibitor that rescues CFTR activity

Study of key residues in MERS-CoV and SARS-CoV-2 main proteases for resistance against clinically applied inhibitors nirmatrelvir and ensitrelvir

The Middle East Respiratory Syndrome Coronavirus (MERS-CoV) is an epidemic, zoonotically emerging pathogen initially reported in Saudi Arabia in 2012. MERS-CoV has the potential to mutate or recombine with other coronaviruses, thus acquiring the ability to efficiently spread among humans and become pandemic. Its high mortality rate of up to 35% and the absence of effective targeted therapies call for the development of antiviral drugs for this pathogen. Since the beginning of the SARS-CoV-2 pandemic, extensive research has focused on identifying protease inhibitors for the treatment of SARS-CoV-2. Our intention was therefore to assess whether these protease inhibitors are viable options for combating MERS-CoV. To that end, we used previously established protease assays to quantify inhibition of SARS-CoV-2, MERS-CoV and other main proteases. Nirmatrelvir inhibited several of these proteases, whereas ensitrelvir was less broadly active. To simulate nirmatrelvir's clinical use against MERS-CoV and subsequent resistance development, we applied a safe, surrogate virus-based system. Using the surrogate virus, we previously selected hallmark mutations of SARS-CoV-2-Mpro, such as T21I, M49L, S144A, E166A/K/V and L167F. In the current study, we selected a pool of MERS-CoV-Mpro mutants, characterized the resistance and modelled the steric effect of catalytic site mutants S142G, S142R, S147Y and A171S.

DexDesign: A new OSPREY-based algorithm for designing de novo D-peptide inhibitors

With over 270 unique occurrences in the human genome, peptide-recognizing PDZ domains play a central role in modulating polarization, signaling, and trafficking pathways. Mutations in PDZ domains lead to diseases such as cancer and cystic fibrosis, making PDZ domains attractive targets for therapeutic intervention. D-peptide inhibitors offer unique advantages as therapeutics, including increased metabolic stability and low immunogenicity. Here, we introduce DexDesign, a novel OSPREY-based algorithm for computationally designing de novo D-peptide inhibitors. DexDesign leverages three novel techniques that are broadly applicable to computational protein design: the Minimum Flexible Set, K*-based Mutational Scan, and Inverse Alanine Scan, which enable exponential reductions in the size of the peptide sequence search space. We apply these techniques and DexDesign to generate novel D-peptide inhibitors of two biomedically important PDZ domain targets: CAL and MAST2. We introduce a new framework for analyzing de novo peptides-evaluation along a replication/restitution axis-and apply it to the DexDesign-generated D-peptides. Notably, the peptides we generated are predicted to bind their targets tighter than their targets' endogenous ligands, validating the peptides' potential as lead therapeutic candidates. We provide an implementation of DexDesign in the free and open source computational protein design software OSPREY.

DexDesign: an OSPREY-based algorithm for designing de novo D-peptide inhibitors

With over 270 unique occurrences in the human genome, peptide-recognizing PDZ domains play a central role in modulating polarization, signaling, and trafficking pathways. Mutations in PDZ domains lead to diseases such as cancer and cystic fibrosis, making PDZ domains attractive targets for therapeutic intervention. D-peptide inhibitors offer unique advantages as therapeutics, including increased metabolic stability and low immunogenicity. Here, we introduce DexDesign, a novel OSPREY-based algorithm for computationally designing de novo D-peptide inhibitors. DexDesign leverages three novel techniques that are broadly applicable to computational protein design: the Minimum Flexible Set, K*-based Mutational Scan, and Inverse Alanine Scan. We apply these techniques and DexDesign to generate novel D-peptide inhibitors of two biomedically important PDZ domain targets: CAL and MAST2. We introduce a framework for analyzing de novo peptides-evaluation along a replication/restitution axis-and apply it to the DexDesign-generated D-peptides. Notably, the peptides we generated are predicted to bind their targets tighter than their targets' endogenous ligands, validating the peptides' potential as lead inhibitors. We also provide an implementation of DexDesign in the free and open source computational protein design software OSPREY.

A comprehensive study of SARS-CoV-2 main protease (Mpro) inhibitor-resistant mutants selected in a VSV-based system

Nirmatrelvir was the first protease inhibitor (PI) specifically developed against the SARS-CoV-2 main protease (3CLpro/Mpro) and licensed for clinical use. As SARS-CoV-2 continues to spread, variants resistant to nirmatrelvir and other currently available treatments are likely to arise. This study aimed to identify and characterize mutations that confer resistance to nirmatrelvir. To safely generate Mpro resistance mutations, we passaged a previously developed, chimeric vesicular stomatitis virus (VSV-Mpro) with increasing, yet suboptimal concentrations of nirmatrelvir. Using Wuhan-1 and Omicron Mpro variants, we selected a large set of mutants. Some mutations are frequently present in GISAID, suggesting their relevance in SARS-CoV-2. The resistance phenotype of a subset of mutations was characterized against clinically available PIs (nirmatrelvir and ensitrelvir) with cell-based and biochemical assays. Moreover, we showed the putative molecular mechanism of resistance based on in silico molecular modelling. These findings have implications on the development of future generation Mpro inhibitors, will help to understand SARS-CoV-2 protease-inhibitor-resistance mechanisms and show the relevance of specific mutations in the clinic, thereby informing treatment decisions.

Protocol for predicting drug-resistant protein mutations to an ERK2 inhibitor using RESISTOR

Prospective predictions of drug-resistant protein mutants could improve the design of therapeutics less prone to resistance. Here, we describe RESISTOR, an algorithm that uses structure- and sequence-based criteria to predict resistance mutations. We demonstrate the process of using RESISTOR to predict ERK2 mutants likely to arise in melanoma ablating the efficacy of the ERK1/2 inhibitor SCH779284. RESISTOR is included in the free and open-source computational protein design software OSPREY. For complete details on the use and execution of this protocol, please refer to Guerin et al..1.

Additive energetic contributions of multiple peptide positions determine the relative promiscuity of viral and human sequences for PDZ domain targets

Protein-protein interactions that involve recognition of short peptides are critical in cellular processes. Protein-peptide interaction surface areas are relatively small and shallow, and there are often overlapping specificities in families of peptide-binding domains. Therefore, dissecting selectivity determinants can be challenging. PDZ domains are a family of peptide-binding domains located in several intracellular signaling and trafficking pathways. These domains are also directly targeted by pathogens, and a hallmark of many oncogenic viral proteins is a PDZ-binding motif. However, amidst sequences that target PDZ domains, there is a wide spectrum in relative promiscuity. For example, the viral HPV16 E6 oncoprotein recognizes over double the number of PDZ domain-containing proteins as the cystic fibrosis transmembrane conductance regulator (CFTR) in the cell, despite similar PDZ targeting-sequences and identical motif residues. Here, we determine binding affinities for PDZ domains known to bind either HPV16 E6 alone or both CFTR and HPV16 E6, using peptides matching WT and hybrid sequences. We also use energy minimization to model PDZ-peptide complexes and use sequence analyses to investigate this difference. We find that while the majority of single mutations had marginal effects on overall affinity, the additive effect on the free energy of binding accurately describes the selectivity observed. Taken together, our results describe how complex and differing PDZ interactomes can be programmed in the cell.

Additive energetic contributions of multiple peptide positions determine the relative promiscuity of viral and human sequences for PDZ domain targets

Protein-protein interactions that include recognition of short sequences of amino acids, or peptides, are critical in cellular processes. Protein-peptide interaction surface areas are relatively small and shallow, and there are often overlapping specificities in families of peptide-binding domains. Therefore, dissecting selectivity determinants can be challenging. PDZ domains are an example of a peptide-binding domain located in several intracellular signaling and trafficking pathways, which form interactions critical for the regulation of receptor endocytic trafficking, tight junction formation, organization of supramolecular complexes in neurons, and other biological systems. These domains are also directly targeted by pathogens, and a hallmark of many oncogenic viral proteins is a PDZ-binding motif. However, amidst sequences that target PDZ domains, there is a wide spectrum in relative promiscuity. For example, the viral HPV16 E6 oncoprotein recognizes over double the number of PDZ domain-containing proteins as the cystic fibrosis transmembrane conductance regulator (CFTR) in the cell, despite similar PDZ targeting-sequences and identical motif residues. Here, we determine binding affinities for PDZ domains known to bind either HPV16 E6 alone or both CFTR and HPV16 E6, using peptides matching WT and hybrid sequences. We also use energy minimization to model PDZ-peptide complexes and use sequence analyses to investigate this difference. We find that while the majority of single mutations had a marginal effect on overall affinity, the additive effect on the free energy of binding accurately describes the selectivity observed. Taken together, our results describe how complex and differing PDZ interactomes can be programmed in the cell.

Tryptophan mutations in G3BP1 tune the stability of a cellular signaling hub by weakening transient interactions with Caprin1 and USP10

Intrinsically disordered proteins (IDPs) often coordinate transient interactions with multiple proteins to mediate complex signals within large protein networks. Among these, the IDP hub protein G3BP1 can form complexes with cytoplasmic phosphoprotein Caprin1 and ubiquitin peptidase USP10; the resulting control of USP10 activity contributes to a pathogenic virulence system that targets endocytic recycling of the ion channel CFTR. However, while the identities of protein interactors are known for many IDP hub proteins, the relationship between pairwise affinities and the extent of protein recruitment and activity is not well understood. Here, we describe in vitro analysis of these G3BP1 affinities and show tryptophan substitutions of specific G3BP1 residues reduce its affinity for both USP10 and Caprin1. We show that these same mutations reduce the stability of complexes between the full-length proteins, suggesting that copurification can serve as a surrogate measure of interaction strength. The crystal structure of G3BP1 TripleW (F15W/F33W/F124W) mutant reveals a clear reorientation of the side chain of W33, creating a steric clash with USP10 and Caprin1. Furthermore, an amino-acid scan of USP10 and Caprin1 peptides reveals similarities and differences in the ability to substitute residues in the core motifs as well as specific substitutions with the potential to create higher affinity peptides. Taken together, these data show that small changes in component binding affinities can have significant effects on the composition of cellular interaction hubs. These specific protein mutations can be harnessed to manipulate complex protein networks, informing future investigations into roles of these networks in cellular processes.

RESISTOR: A New OSPREY Module to Predict Resistance Mutations

Computational, in silico prediction of resistance-conferring escape mutations could accelerate the design of therapeutics less prone to resistance. This article describes how to use the Resistor algorithm to predict escape mutations. Resistor employs Pareto optimization on four resistance-conferring criteria-positive and negative design, mutational probability, and hotspot cardinality-to assign a Pareto rank to each prospective mutant. It also predicts the mechanism of resistance, that is, whether a mutant ablates binding to a drug, strengthens binding to the endogenous ligand, or a combination of these two factors, and provides structural models of the mutants. Resistor is part of the free and open-source computational protein design software OSPREY.

Proteostasis Regulators in Cystic Fibrosis: Current Development and Future Perspectives

In cystic fibrosis (CF), the deletion of phenylalanine 508 (F508del) in the CF transmembrane conductance regulator (CFTR) leads to misfolding and premature degradation of the mutant protein. These defects can be targeted with pharmacological agents named potentiators and correctors. During the past years, several efforts have been devoted to develop and approve new effective molecules. However, their clinical use remains limited, as they fail to fully restore F508del-CFTR biological function. Indeed, the search for CFTR correctors with different and additive mechanisms has recently increased. Among them, drugs that modulate the CFTR proteostasis environment are particularly attractive to enhance therapy effectiveness further. This Perspective focuses on reviewing the recent progress in discovering CFTR proteostasis regulators, mainly describing the design, chemical structure, and structure-activity relationships. The opportunities, challenges, and future directions in this emerging and promising field of research are discussed, as well.

Computational Tools and Strategies to Develop Peptide-Based Inhibitors of Protein-Protein Interactions

Protein-protein interactions play crucial and subtle roles in many biological processes and modifications of their fine mechanisms generally result in severe diseases. Peptide derivatives are very promising therapeutic agents for modulating protein-protein associations with sizes and specificities between those of small compounds and antibodies. For the same reasons, rational design of peptide-based inhibitors naturally borrows and combines computational methods from both protein-ligand and protein-protein research fields. In this chapter, we aim to provide an overview of computational tools and approaches used for identifying and optimizing peptides that target protein-protein interfaces with high affinity and specificity. We hope that this review will help to implement appropriate in silico strategies for peptide-based drug design that builds on available information for the systems of interest.

Inhibition of Viral Membrane Fusion by Peptides and Approaches to Peptide Design

Fusion of lipid-enveloped viruses with the cellular plasma membrane or the endosome membrane is mediated by viral envelope proteins that undergo large conformational changes following binding to receptors. The HIV-1 fusion protein gp41 undergoes a transition into a "six-helix bundle" after binding of the surface protein gp120 to the CD4 receptor and a co-receptor. Synthetic peptides that mimic part of this structure interfere with the formation of the helix structure and inhibit membrane fusion. This approach also works with the S spike protein of SARS-CoV-2. Here we review the peptide inhibitors of membrane fusion involved in infection by influenza virus, HIV-1, MERS and SARS coronaviruses, hepatitis viruses, paramyxoviruses, flaviviruses, herpesviruses and filoviruses. We also describe recent computational methods used for the identification of peptide sequences that can interact strongly with protein interfaces, with special emphasis on SARS-CoV-2, using the PePI-Covid19 database.

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.

Automated affinity selection for rapid discovery of peptide binders

In-solution affinity selection (AS) of large synthetic peptide libraries affords identification of binders to protein targets through access to an expanded chemical space. Standard affinity selection methods, however, can be time-consuming, low-throughput, or provide hits that display low selectivity to the target. Here we report an automated bio-layer interferometry (BLI)-assisted affinity selection platform. When coupled with tandem mass spectrometry (MS), this method enables both rapid de novo discovery and affinity maturation of known peptide binders with high selectivity. The BLI-assisted AS-MS technology also features real-time monitoring of the peptide binding during the library selection process, a feature unattainable by current selection approaches. We show the utility of the BLI AS-MS platform toward rapid identification of novel nanomolar (dissociation constant, K_D < 50 nM) non-canonical binders to the leukemia-associated oncogenic protein menin. To our knowledge, this is the first application of BLI to the affinity selection of synthetic peptide libraries. We believe our approach can significantly accelerate the use of synthetic peptidomimetic libraries in drug discovery.

This work reports an automated affinity selection-mass spectrometry (AS-MS) approach amenable to both de novo peptide binder discovery and affinity maturation of known binders in a high-throughput and selective manner.

Development and applications of artificial symmetrical proteins

Since the determination of the first molecular models of proteins there has been interest in creating proteins artificially, but such methods have only become widely successful in the last decade. Gradual improvements over a long period of time have now yielded numerous examples of non-natural proteins, many of which are built from repeated elements. In this review we discuss the design of such symmetrical proteins and their various applications in chemistry and medicine.

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 (KRas^GTP). 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 KRas^GTP, 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.

Dynamics, a Powerful Component of Current and Future in Silico Approaches for Protein Design and Engineering

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.

A bacterial vaccine polypeptide protective against nontypable Haemophilus influenzae

Nontypeable strains of Haemophilus influenzae (NTHi) are one of the most common cause of otitis media and the most frequent infection associated with exacerbations of chronic obstructive pulmonary disease; there is currently no vaccine in the U.S. to prevent NTHi. Using bioinformatics and structural vaccinology, we previously identified several NTHi species-conserved and sequence-conserved peptides that mediate passive protection in the rat model of infection. Using these, and similar peptides, we designed Hi Poly 1, a Bacterial Vaccine Polypeptide, comprising 9 unique peptides from 6 different surface proteins. Recombinant Hi Poly 1 was purified by affinity chromatography. Forty chinchillas were immunized three times with 200 µg of Hi Poly 1 with alum adjuvant; similarly, 41 controls were immunized with adjuvant alone. The average Log₂ IgG titer among immunized animals was 17.04, and IgG antibodies against each component peptide were detected. In the infant rat model, antisera from immunized chinchillas provided significant passive protection compared to PBS (p = 0.01) and pre-immune sera (p = 0.03). In the established chinchilla model of NTHi otitis media, the vaccinated group cleared infection faster than the control group as indicated by significantly decreased positive findings on video-otoscopy (p < 0.0001) and tympanometry (p = 0.0002) on day 7, and for middle ear fluid obtained by aspiration (p = 0.0001) on day 10 post-infection. Using 12 representative NTHi strains in a Live-Cell ELISA, greater antibody binding to each strain was detected with post Hi Poly 1 than the pre-immune chinchilla antisera. The data from this proof-of-principle study demonstrate the effectiveness of Hi Poly 1 against the NTHi in two relevant preclinical models of bacteremia and otitis media as well as surface antibody binding across the species. The Bacterial Vaccine Polypeptide approach to a vaccine against NTHi also serves as a paradigm for development of similar vaccines to protect against other bacteria.

Specificity in PDZ-peptide interaction networks: Computational analysis and review

Globular PDZ domains typically serve as protein-protein interaction modules that regulate a wide variety of cellular functions via recognition of short linear motifs (SLiMs). Often, PDZ mediated-interactions are essential components of macromolecular complexes, and disruption affects the entire scaffold. Due to their roles as linchpins in trafficking and signaling pathways, PDZ domains are attractive targets: both for controlling viral pathogens, which bind PDZ domains and hijack cellular machinery, as well as for developing therapies to combat human disease. However, successful therapeutic interventions that avoid off-target effects are a challenge, because each PDZ domain interacts with a number of cellular targets, and specific binding preferences can be difficult to decipher. Over twenty-five years of research has produced a wealth of data on the stereochemical preferences of individual PDZ proteins and their binding partners. Currently the field lacks a central repository for this information. Here, we provide this important resource and provide a manually curated, comprehensive list of the 271 human PDZ domains. We use individual domain, as well as recent genomic and proteomic, data in order to gain a holistic view of PDZ domains and interaction networks, arguing this knowledge is critical to optimize targeting selectivity and to benefit human health.

Inhaled Biologicals for the Treatment of Cystic Fibrosis

Background:

Cystic Fibrosis (CF), one of the most frequent genetic diseases, is characterized by the production of viscous mucus in several organs. In the lungs, mucus clogs the airways and traps bacteria, leading to recurrent/resistant infections and lung damage. For cystic fibrosis patients, respiratory failure is still lethal in early adulthood since available treatments display incomplete efficacy.

Objective:

The objective of this review is to extend the current knowledge in the field of available treat-ments for cystic fibrosis. A special focus has been given to inhaled peptide-based drugs.

Methods:

The current review is based on recent and/or relevant literature and patents already available in various scientific databases, which include PubMed, PubMed Central, Patentscope and Science Direct. The information obtained through these diverse databases is compiled, critically interpreted and presented in the current study. An in-depth but not systematic approach to the specific research question has been adopted.

Results:

Recently, peptides have been proposed as possible pharmacologic agents for the treatment of respiratory diseases. Of note, peptides are suitable to be administered by inhalation to maximize efficacy and reduce systemic side effects. Moreover, innovative delivery carriers have been developed for drug administration through inhalation, allowing not only protection against proteolysis, but also a prolonged and controlled release.

Conclusion:

Here, we summarize newly patented peptides that have been developed in the last few years and advanced technologies for inhaled drug delivery to treat cystic fibrosis.

A general-purpose protein design framework based on mining sequence-structure relationships in known protein structures

Current state-of-the-art approaches to computational protein design (CPD) aim to capture the determinants of structure from physical principles. While this has led to many successful designs, it does have strong limitations associated with inaccuracies in physical modeling, such that a reliable general solution to CPD has yet to be found. Here, we propose a design framework-one based on identifying and applying patterns of sequence-structure compatibility found in known proteins, rather than approximating them from models of interatomic interactions. We carry out extensive computational analyses and an experimental validation for our method. Our results strongly argue that the Protein Data Bank is now sufficiently large to enable proteins to be designed by using only examples of structural motifs from unrelated proteins. Because our method is likely to have orthogonal strengths relative to existing techniques, it could represent an important step toward removing remaining barriers to robust CPD.

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 V_HH, 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 Analysis of Energy Landscapes Reveals Dynamic Features That Contribute to Binding of Inhibitors to CFTR-Associated Ligand

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.

MotifAnalyzer-PDZ: A computational program to investigate the evolution of PDZ-binding target specificity

Recognition of short linear motifs (SLiMs) or peptides by proteins is an important component of many cellular processes. However, due to limited and degenerate binding motifs, prediction of cellular targets is challenging. In addition, many of these interactions are transient and of relatively low affinity. Here, we focus on one of the largest families of SLiM-binding domains in the human proteome, the PDZ domain. These domains bind the extreme C-terminus of target proteins, and are involved in many signaling and trafficking pathways. To predict endogenous targets of PDZ domains, we developed MotifAnalyzer-PDZ, a program that filters and compares all motif-satisfying sequences in any publicly available proteome. This approach enables us to determine possible PDZ binding targets in humans and other organisms. Using this program, we predicted and biochemically tested novel human PDZ targets by looking for strong sequence conservation in evolution. We also identified three C-terminal sequences in choanoflagellates that bind a choanoflagellate PDZ domain, the Monsiga brevicollis SHANK1 PDZ domain (mbSHANK1), with endogenously-relevant affinities, despite a lack of conservation with the targets of a homologous human PDZ domain, SHANK1. All three are predicted to be signaling proteins, with strong sequence homology to cytosolic and receptor tyrosine kinases. Finally, we analyzed and compared the positional amino acid enrichments in PDZ motif-satisfying sequences from over a dozen organisms. Overall, MotifAnalyzer-PDZ is a versatile program to investigate potential PDZ interactions. This proof-of-concept work is poised to enable similar types of analyses for other SLiM-binding domains (e.g., MotifAnalyzer-Kinase). MotifAnalyzer-PDZ is available at http://motifAnalyzerPDZ.cs.wwu.edu.

Protein Design by Provable Algorithms

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

PDZ Domains as Drug Targets

Protein-protein interactions within protein networks shape the human interactome, which often is promoted by specialized protein interaction modules, such as the postsynaptic density-95 (PSD-95), discs-large, zona occludens 1 (ZO-1) (PDZ) domains. PDZ domains play a role in several cellular functions, from cell-cell communication and polarization, to regulation of protein transport and protein metabolism. PDZ domain proteins are also crucial in the formation and stability of protein complexes, establishing an important bridge between extracellular stimuli detected by transmembrane receptors and intracellular responses. PDZ domains have been suggested as promising drug targets in several diseases, ranging from neurological and oncological disorders to viral infections. In this review, the authors describe structural and genetic aspects of PDZ-containing proteins and discuss the current status of the development of small-molecule and peptide modulators of PDZ domains. An overview of potential new therapeutic interventions in PDZ-mediated protein networks is also provided.

Tertiary Structural Motif Sequence Statistics Enable Facile Prediction and Design of Peptides that Bind Anti-apoptotic Bfl-1 and Mcl-1

Understanding the relationship between protein sequence and structure well enough to design new proteins with desired functions is a longstanding goal in protein science. Here, we show that recurring tertiary structural motifs (TERMs) in the PDB provide rich information for protein-peptide interaction prediction and design. TERM statistics can be used to predict peptide binding energies for Bcl-2 family proteins as accurately as widely used structure-based tools. Furthermore, design using TERM energies (dTERMen) rapidly and reliably generates high-affinity peptide binders of anti-apoptotic proteins Bfl-1 and Mcl-1 with just 15%-38% sequence identity to any known native Bcl-2 family protein ligand. High-resolution structures of four designed peptides bound to their targets provide opportunities to analyze the strengths and limitations of the computational design method. Our results support dTERMen as a powerful approach that can complement existing tools for protein engineering.

Accurate PDZ/Peptide Binding Specificity with Additive and Polarizable Free Energy Simulations

PDZ domains contain 80-100 amino acids and bind short C-terminal sequences of target proteins. Their specificity is essential for cellular signaling pathways. We studied the binding of the Tiam1 PDZ domain to peptides derived from the C-termini of its Syndecan-1 and Caspr4 targets. We used free energy perturbation (FEP) to characterize the binding energetics of one wild-type and 17 mutant complexes by simulating 21 alchemical transformations between pairs of complexes. Thirteen complexes had known experimental affinities. FEP is a powerful tool to understand protein/ligand binding. It depends, however, on the accuracy of molecular dynamics force fields and conformational sampling. Both aspects require continued testing, especially for ionic mutations. For six mutations that did not modify the net charge, we obtained excellent agreement with experiment using the additive, AMBER ff99SB force field, with a root mean square deviation (RMSD) of 0.37 kcal/mol. For six ionic mutations that modified the net charge, agreement was also good, with one large error (3 kcal/mol) and an RMSD of 0.9 kcal/mol for the other five. The large error arose from the overstabilization of a protein/peptide salt bridge by the additive force field. Four of the ionic mutations were also simulated with the polarizable Drude force field, which represents the first test of this force field for protein/ligand binding free energy changes. The large error was eliminated and the RMS error for the four mutations was reduced from 1.8 to 1.2 kcal/mol. The overall accuracy of FEP indicates it can be used to understand PDZ/peptide binding. Importantly, our results show that for ionic mutations in buried regions, electronic polarization plays a significant role.

Emerging Themes in PDZ Domain Signaling: Structure, Function, and Inhibition

Post-synaptic density-95, disks-large and zonula occludens-1 (PDZ) domains are small globular protein-protein interaction domains widely conserved from yeast to humans. They are composed of ∼90 amino acids and form a classical two α-helical/six β-strand structure. The prototypical ligand is the C-terminus of partner proteins; however, they also bind internal peptide sequences. Recent findings indicate that PDZ domains also bind phosphatidylinositides and cholesterol. Through their ligand interactions, PDZ domain proteins are critical for cellular trafficking and the surface retention of various ion channels. In addition, PDZ proteins are essential for neuronal signaling, memory, and learning. PDZ proteins also contribute to cytoskeletal dynamics by mediating interactions critical for maintaining cell-cell junctions, cell polarity, and cell migration. Given their important biological roles, it is not surprising that their dysfunction can lead to multiple disease states. As such, PDZ domain-containing proteins have emerged as potential targets for the development of small molecular inhibitors as therapeutic agents. Recent data suggest that the critical binding function of PDZ domains in cell signaling is more than just glue, and their binding function can be regulated by phosphorylation or allosterically by other binding partners. These studies also provide a wealth of structural and biophysical data that are beginning to reveal the physical features that endow this small modular domain with a central role in cell signaling.

OSPREY 3.0: Open-source protein redesign for you, with powerful new features

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.

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

Strategies for designing non-natural enzymes and binders

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.

CATS (Coordinates of Atoms by Taylor Series): protein design with backbone flexibility in all locally feasible directions

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.

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, K_a, 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 K_a 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 K_a for up to 10⁵-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 K_a 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.

Simplifying the Design of Protein-Peptide Interaction Specificity with Sequence-Based Representations of Atomistic Models

Computationally designed peptides targeting protein-protein interaction interfaces are of great interest as reagents for biological research and potential therapeutics. In recent years, it has been shown that detailed structure-based calculations can, in favorable cases, describe relevant determinants of protein-peptide recognition. Yet, despite large increases in available computing power, such accurate modeling of the binding reaction is still largely outside the realm of protein design. The chief limitation is in the large sequence spaces generally involved in protein design problems, such that it is typically infeasible to apply expensive modeling techniques to score each sequence. Toward addressing this issue, we have previously shown that by explicitly evaluating the scores of a relatively small number of sequences, it is possible to synthesize a direct mapping between sequences and scores, such that the entire sequence space can be analyzed extremely rapidly. The associated method, called Cluster Expansion, has been used in a number of studies to design binding affinity and specificity. In this chapter, we provide instructions and guidance for applying this technique in the context of designing protein-peptide interactions to enable the use of more detailed and expensive scoring approaches than is typically possible.

Enriching Peptide Libraries for Binding Affinity and Specificity Through Computationally Directed Library Design

Peptide reagents with high affinity or specificity for their target protein interaction partner are of utility for many important applications. Optimization of peptide binding by screening large libraries is a proven and powerful approach. Libraries designed to be enriched in peptide sequences that are predicted to have desired affinity or specificity characteristics are more likely to yield success than random mutagenesis. We present a library optimization method in which the choice of amino acids to encode at each peptide position can be guided by available experimental data or structure-based predictions. We discuss how to use analysis of predicted library performance to inform rounds of library design. Finally, we include protocols for more complex library design procedures that consider the chemical diversity of the amino acids at each peptide position and optimize a library score based on a user-specified input model.

CFTR-NHERF2-LPA₂ Complex in the Airway and Gut Epithelia

The cystic fibrosis transmembrane conductance regulator (CFTR) is a cAMP- and cGMP-regulated chloride (Cl⁻) and bicarbonate (HCO₃⁻) channel localized primarily at the apical plasma membrane of epithelial cells lining the airway, gut and exocrine glands, where it is responsible for transepithelial salt and water transport. Several human diseases are associated with altered CFTR channel function. Cystic fibrosis (CF) is caused by the absence or dysfunction of CFTR channel activity, resulting from mutations in the gene. Secretory diarrhea is caused by the hyperactivation of CFTR channel activity in the gastrointestinal tract. CFTR is a validated target for drug development to treat CF, and extensive research has been conducted to develop CFTR inhibitors for therapeutic interventions of secretory diarrhea. The intracellular processing, trafficking, apical membrane localization, and channel function of CFTR are regulated by dynamic protein–protein interactions in a complex network. In this paper, we review the current knowledge of a macromolecular complex of CFTR, Na⁺/H⁺ exchanger regulatory factor 2 (NHERF2), and lysophosphatidic acids (LPA) receptor 2 (LPA₂) at the apical plasma membrane of airway and gut epithelial cells, and discuss its relevance in human physiology and diseases. We also explore the possibilities of targeting this complex to fine tune CFTR channel activity, with a hope to open up new avenues to develop novel therapies for CF and secretory diarrhea.

Computationally optimized deimmunization libraries yield highly mutated enzymes with low immunogenicity and enhanced activity

Therapeutic proteins of wide-ranging function hold great promise for treating disease, but immune surveillance of these macromolecules can drive an antidrug immune response that compromises efficacy and even undermines safety. To eliminate widespread T-cell epitopes in any biotherapeutic and thereby mitigate this key source of detrimental immune recognition, we developed a Pareto optimal deimmunization library design algorithm that optimizes protein libraries to account for the simultaneous effects of combinations of mutations on both molecular function and epitope content. Active variants identified by high-throughput screening are thus inherently likely to be deimmunized. Functional screening of an optimized 10-site library (1,536 variants) of P99 β-lactamase (P99βL), a component of ADEPT cancer therapies, revealed that the population possessed high overall fitness, and comprehensive analysis of peptide-MHC II immunoreactivity showed the population possessed lower average immunogenic potential than the wild-type enzyme. Although similar functional screening of an optimized 30-site library (2.15 × 10⁹ variants) revealed reduced population-wide fitness, numerous individual variants were found to have activity and stability better than the wild type despite bearing 13 or more deimmunizing mutations per enzyme. The immunogenic potential of one highly active and stable 14-mutation variant was assessed further using ex vivo cellular immunoassays, and the variant was found to silence T-cell activation in seven of the eight blood donors who responded strongly to wild-type P99βL. In summary, our multiobjective library-design process readily identified large and mutually compatible sets of epitope-deleting mutations and produced highly active but aggressively deimmunized constructs in only one round of library screening.

Computational Design of the Tiam1 PDZ Domain and Its Ligand Binding

PDZ domains direct protein-protein interactions and serve as models for protein design. Here, we optimized a protein design energy function for the Tiam1 and Cask PDZ domains that combines a molecular mechanics energy, Generalized Born solvent, and an empirical unfolded state model. Designed sequences were recognized as PDZ domains by the Superfamily fold recognition tool and had similarity scores comparable to natural PDZ sequences. The optimized model was used to redesign the two PDZ domains, by gradually varying the chemical potential of hydrophobic amino acids; the tendency of each position to lose or gain a hydrophobic character represents a novel hydrophobicity index. We also redesigned four positions in the Tiam1 PDZ domain involved in peptide binding specificity. The calculated affinity differences between designed variants reproduced experimental data and suggest substitutions with altered specificities.

A critical analysis of computational protein design with sparse residue interaction graphs

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.

OSPREY Predicts Resistance Mutations Using Positive and Negative Computational Protein Design

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.

Molecular modelling and molecular dynamics of CFTR

The cystic fibrosis transmembrane conductance regulator (CFTR) protein is a member of the ATP-binding cassette (ABC) transporter superfamily that functions as an ATP-gated channel. Considerable progress has been made over the last years in the understanding of the molecular basis of the CFTR functions, as well as dysfunctions causing the common genetic disease cystic fibrosis (CF). This review provides a global overview of the theoretical studies that have been performed so far, especially molecular modelling and molecular dynamics (MD) simulations. A special emphasis is placed on the CFTR-specific evolution of an ABC transporter framework towards a channel function, as well as on the understanding of the effects of disease-causing mutations and their specific modulation. This in silico work should help structure-based drug discovery and design, with a view to develop CFTR-specific pharmacotherapeutic approaches for the treatment of CF in the context of precision medicine.

Parallel Computational Protein Design

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.

Flexible Backbone Methods for Predicting and Designing Peptide Specificity

Protein-protein interactions play critical roles in essentially every cellular process. These interactions are often mediated by protein interaction domains that enable proteins to recognize their interaction partners, often by binding to short peptide motifs. For example, PDZ domains, which are among the most common protein interaction domains in the human proteome, recognize specific linear peptide sequences that are often at the C-terminus of other proteins. Determining the set of peptide sequences that a protein interaction domain binds, or it's "peptide specificity," is crucial for understanding its cellular function, and predicting how mutations impact peptide specificity is important for elucidating the mechanisms underlying human diseases. Moreover, engineering novel cellular functions for synthetic biology applications, such as the biosynthesis of biofuels or drugs, requires the design of protein interaction specificity to avoid crosstalk with native metabolic and signaling pathways. The ability to accurately predict and design protein-peptide interaction specificity is therefore critical for understanding and engineering biological function. One approach that has recently been employed toward accomplishing this goal is computational protein design. This chapter provides an overview of recent methodological advances in computational protein design and highlights examples of how these advances can enable increased accuracy in predicting and designing peptide specificity.

LUTE (Local Unpruned Tuple Expansion): Accurate Continuously Flexible Protein Design with General Energy Functions and Rigid Rotamer-Like Efficiency

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.

cOSPREY: A Cloud-Based Distributed Algorithm for Large-Scale Computational Protein Design

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.

Compact Representation of Continuous Energy Surfaces for More Efficient Protein Design

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.