Improved Physics-Based Single-Position Protein Sequence Redesign with a Residue-Pairwise Generalized Born Model.

A long-standing goal of computational protein design is to create proteins similar to those found in Nature. One motivation is to harness the exquisite functional capabilities of proteins for our own purposes. The extent of similarity between designed and natural proteins also reports on how faithfully our models represent the selective pressures that determine protein sequences. As the field of protein design shifts emphasis from reproducing native-like protein structure to function, it has become important that these models treat the notion of specificity in molecular interactions. Although specificity may, in some cases, be achieved by optimization of a desired protein in isolation, methods have been developed to address directly the desire for proteins that exhibit specific functions and interactions.

We describe an efficient generalized Born (GB) approximation for proteins, in which the interaction energy between two amino acids depends on the whole protein structure, but can be accurately computed from residue-pairwise information. Two results make the scheme pairwise. First, an accurate expression exists for the interaction energy between two residues R and R' that depends on the product B = BRBR' of their residue Born solvation radii. Second, this expression is accurately fitted by a parabolic function of B; the (three) fitting coefficients depend only on the pair RR', not on its environment. In effect, the quantity B captures all the information that is relevant about the pair's dielectric environment. The method is tested with calculations on several hundred structures of the proteins trpcage, BPTI, ubiqutin, and thoredoxin. It yields solvation energies in better agreement with Poisson calculations than a traditional GB formulation. We also compute the effect of the protein/solvent environment on the interactions between pairs of charged residues in the active site of the enzyme aspartyl-tRNA synthetase. Our method captures this effect as accurately as traditional GB. Because it is residue-pairwise, the method can be incorporated into efficient protocols for rotamer placement and computational protein design.

Computational protein design aims to create proteins with novel properties. A key element is the energy or scoring function used to select the sequences and conformations. We study the performance of an "MMGBSA" energy function, which combines molecular mechanics terms, a generalized Born and surface area (GBSA) solvent model, with approximations that make the model pairwise additive. Our approach is implemented in the Proteus software. The use of a physics-based energy function ensures a certain model transferability and explanatory power. As a first test, we redesign the sequence of nine proteins, one position at a time, with the rest of the protein having its native sequence and crystallographic conformation. As a second test, all positions are designed together. The contributions of individual energy terms are evaluated, and various parametrizations are compared. We find that the GB term significantly improves the results compared to simple Coulomb electrostatics but is affected by pairwise decomposition errors when all positions are designed together. The SA term, with distinct energy coefficients for nonpolar and polar atoms, makes a decisive contribution to obtain realistic protein sequences and can partially compensate for the absence of a GB term. With the best GBSA protocol, we obtain nativelike protein cores and Superfamily recognition of almost all of our sequences.

BackgroundLarge-scale datasets of protein structures and sequences are becoming ubiquitous in many domains of biological research. Experimental approaches and computational modelling methods are generating biological data at an unprecedented rate. The detailed analysis of structure-sequence relationships is critical to unveil governing principles of protein folding, stability and function. Computational protein design (CPD) has emerged as an important structure-based approach to engineer proteins for novel functions. Generally, CPD workflows rely on the generation of large numbers of structural models to search for the optimal structure-sequence configurations. As such, an important step of the CPD process is the selection of a small subset of sequences to be experimentally characterized. Given the limitations of current CPD scoring functions, multi-step design protocols and elaborated analysis of the decoy populations have become essential for the selection of sequences for experimental characterization and the success of CPD strategies.ResultsHere, we present the rstoolbox, a Python library for the analysis of large-scale structural data tailored for CPD applications. rstoolbox is oriented towards both CPD software users and developers, being easily integrated in analysis workflows. For users, it offers the ability to profile and select decoy sets, which may guide multi-step design protocols or for follow-up experimental characterization. rstoolbox provides intuitive solutions for the visualization of large sequence/structure datasets (e.g. logo plots and heatmaps) and facilitates the analysis of experimental data obtained through traditional biochemical techniques (e.g. circular dichroism and surface plasmon resonance) and high-throughput sequencing. For CPD software developers, it provides a framework to easily benchmark and compare different CPD approaches. Here, we showcase the rstoolbox in both types of applications.Conclusionsrstoolbox is a library for the evaluation of protein structures datasets tailored for CPD data. It provides interactive access through seamless integration with IPython, while still being suitable for high-performance computing. In addition to its functionalities for data analysis and graphical representation, the inclusion of rstoolbox in protein design pipelines will allow to easily standardize the selection of design candidates, as well as, to improve the overall reproducibility and robustness of CPD selection processes.

Protein engineering, the process by which novel proteins with desired properties are developed, has grown by leaps and bounds since the first examples of protein mutagenesis were described over three decades ago. In the last 30 years, protein engineers have successfully created a wide range of proteins tailored to specific industrial, medical, and research applications. Yet challenges remain that prevent the engineering of complex protein functions on demand. With the aim of creating a forum for the protein engineering community, the inaugural Protein Engineering Canada Conference was held on June 20–22, 2014, in Ottawa, Canada. Over the course of the 2-day conference, 115 protein scientists from over 30 institutions representing 5 countries shared ideas, networked with colleagues, and learned about exciting new research covering a broad array of topics such as enzyme engineering, computational protein design, X-ray crystallography, protein NMR, molecular modeling, and protein evolution. This special issue highlights the breadth of research that was covered during the Protein Engineering Canada Conference by including previously unpublished research articles submitted by speakers as well as some selections that were submitted directly to Protein Science.

The robust computational design of functional proteins has the potential to deeply impact translational research and broaden our understanding of the determinants of protein function and stability. The low success rates of computational design protocols and the extensive in vitro optimization often required, highlight the challenge of designing proteins that perform essential biochemical functions, such as binding or catalysis. One of the most simplistic approaches for the design of function is to adopt functional motifs in naturally occurring proteins and transplant them to computationally designed proteins. The structural complexity of the functional motif largely determines how readily one can find host protein structures that are “designable”, meaning that are likely to present the functional motif in the desired conformation. One promising route to enhance the “designability” of protein structures is to allow backbone flexibility. Here, we present a computational approach that couples conformational folding with sequence design to embed functional motifs into heterologous proteins—Rosetta Functional Folding and Design (FunFolDes). We performed extensive computational benchmarks, where we observed that the enforcement of functional requirements resulted in designs distant from the global energetic minimum of the protein. An observation consistent with several experimental studies that have revealed function-stability tradeoffs. To test the design capabilities of FunFolDes we transplanted two viral epitopes into distant structural templates including one de novo “functionless” fold, which represent two typical challenges where the designability problem arises. The designed proteins were experimentally characterized showing high binding affinities to monoclonal antibodies, making them valuable candidates for vaccine design endeavors. Overall, we present an accessible strategy to repurpose old protein folds for new functions. This may lead to important improvements on the computational design of proteins, with structurally complex functional sites, that can perform elaborate biochemical functions related to binding and catalysis.

Computational protein design (CPD) can address the inverse folding problem, exploring a large space of sequences and selecting ones predicted to fold. CPD was used previously to redesign several proteins, employing a knowledge-based energy function for both the folded and unfolded states. We show that a PDZ domain can be entirely redesigned using a “physics-based” energy for the folded state and a knowledge-based energy for the unfolded state. Thousands of sequences were generated by Monte Carlo simulation. Three were chosen for experimental testing, based on their low energies and several empirical criteria. All three could be overexpressed and had native-like circular dichroism spectra and 1D-NMR spectra typical of folded structures. Two had upshifted thermal denaturation curves when a peptide ligand was present, indicating binding and suggesting folding to a correct, PDZ structure. Evidently, the physical principles that govern folded proteins, with a dash of empirical post-filtering, can allow successful whole-protein redesign.

We describe a two-stage computational protein design (CPD) methodology for the design of peptides binding to the FAT domain of the protein focal adhesion kinase. The first stage involves high-throughput CPD calculations with the Proteus software. The energies of the folded state are described by a physics-based energy function and of the unfolded peptides by a knowledge-based model that reproduces aminoacid compositions consistent with a helicity scale. The obtained sequences are filtered in terms of the affinity and the stability of the complex. In the second stage, design sequences are further evaluated by all-atom molecular dynamics simulations and binding free energy calculations with a molecular mechanics/implicit solvent free energy function.

Computational protein design: Advancing biotechnology through in silico engineering.

Computational protein design (CPD) is the automated identification of amino acid sequences that will fold into a specified three-dimensional structure. This method has emerged as a promising tool for engineering enzymes. In this thesis, I describe my efforts at improving and applying CPD methods to the design of enzymes. Chapter II describes the development and benchmark results for a molecular dynamics (MD) protocol to prescreen enzyme designs. Results indicate that the MD protocol is successful in screening enzymes for enzymatic activity. The protocol is general, reproducible, and excels at discarding false positive designs while predicting the most active enzymes correctly. Conformational changes are part of the repertoire that natural enzymes use to catalyze reactions. Chapter III comprises the computational design and experimental characterization of triosephosphate isomerase (TIM), a model enzyme for the study of catalytic activity in the context of conformational changes. Using a novel multi-state design (MSD) method that can consider multiple states in a single protein sequence optimization calculation, we designed the flexible hinges in TIM’s active site loop. A central challenge in the CPD field is the reliable engineering of an enzyme for any desired reaction. In Chapter IV, I describe the conceptualization and application of a high-throughput computational framework for the de novo design of enzymatic activity into inert scaffolds. TIM is used as a model system.

Shortcomings in the definition of effective free-energy surfaces of proteins are recognized to be a major contributory factor responsible for the low success rates of existing automated methods for computational protein design (CPD). The formulation of an atomistic statistically effective energy function (SEEF) suitable for a wide range of CPD applications and its derivation from structural data extracted from protein domains and protein-ligand complexes are described here. The proposed energy function comprises nonlocal atom-based and local residue-based SEEFs, which are coupled using a novel atom connectivity number factor to scale short-range, pairwise, nonbonded atomic interaction energies and a surface-area-dependent cavity energy term. This energy function was used to derive additional SEEFs describing the unfolded-state ensemble of any given residue sequence based on computed average energies for partially or fully solvent-exposed fragments in regions of irregular structure in native proteins. Relative thermal stabilities of 97 T4 bacteriophage lysozyme mutants were predicted from calculated energy differences for folded and unfolded states with an average unsigned error (AUE) of 0.84 kcal mol(-1) when compared to experiment. To demonstrate the utility of the energy function for CPD, further validation was carried out in tests of its capacity to recover cognate protein sequences and to discriminate native and near-native protein folds, loop conformers, and small-molecule ligand binding poses from non-native benchmark decoys. Experimental ligand binding free energies for a diverse set of 80 protein complexes could be predicted with an AUE of 2.4 kcal mol(-1) using an additional energy term to account for the loss in ligand configurational entropy upon binding. The atomistic SEEF is expected to improve the accuracy of residue-based coarse-grained SEEFs currently used in CPD and to extend the range of applications of extant atom-based protein statistical potentials.

Structure-based Computational Protein design (CPD) plays a critical role in advancing the field of protein engineering. Using an all-atom energy function, CPD tries to identify amino acid sequences that fold into a target structure and ultimately perform a desired function. Energy functions remain however imperfect and injecting relevant information from known structures in the design process should lead to improved designs. We introduce Shades, a data-driven CPD method that exploits local structural environments in known protein structures together with energy to guide sequence design, while sampling side-chain and backbone conformations to accommodate mutations. Shades (Structural Homology Algorithm for protein DESign), is based on customized libraries of non-contiguous in-contact amino acid residue motifs. We have tested Shades on a public benchmark of 40 proteins selected from different protein families. When excluding homologous proteins, Shades achieved a protein sequence recovery of 30% and a protein sequence similarity of 46% on average, compared with the PFAM protein family of the target protein. When homologous structures were added, the wild-type sequence recovery rate achieved 93%. Shades source code is available at https://bitbucket.org/satsumaimo/shades as a patch for Rosetta 3.8 with a curated protein structure database and ITEM library creation software. Supplementary data are available at Bioinformatics online.

Computational protein design — the next generation tool to expand synthetic biology applications

The inclusion of explicit solvent water in molecular dynamics refinement of NMR structures ought to provide the most physically meaningful accounting for the effects of solvent on structure, but is computationally expensive. In order to evaluate the validity of commonly used vacuum refinements and of recently developed continuum solvent model methods, we have used three different methods to refine a set of NMR solution structures of a medium sized protein, Escherichia coli glutaredoxin 2, from starting structures calculated using the program DYANA. The three different refinement protocols used molecular dynamics simulated annealing with the program AMBER in vacuum (VAC), including a generalized Born (GB) solvent model, and a full calculation including explicit solvent water (WAT). The structures obtained using the three methods of refinements were very similar, a reflection of their generally well-determined nature. However, the structures refined with the generalized Born model were more similar to those from explicit water refinement than those refined in vacuum. Significant improvement was seen in the percentage of backbone dihedral angles in the most favored regions of phi, psi space and in hydrogen bond pattern for structures refined with the GB and WAT models, compared with the structures refined in vacuum. The explicit water calculation took an average of 200 h of CPU time per structure on an SGI cluster, compared to 15-90 h for the GB calculation (depending on the parameters used) and 2 h for the vacuum calculation. The generalized Born solvent model proved to be an excellent compromise between the vacuum and explicit water refinements, giving results comparable to those of the explicit water calculation. Some improvement for phi and psi angle distribution and hydrogen bond pattern can also be achieved by energy minimizing the vacuum structures with the GB model, which takes a much shorter time than MD simulations with the GB model.

Computational protein design remains a challenging task despite its remarkable success in the past few decades. With the rapid progress of deep-learning techniques and the accumulation of three-dimensional protein structures, the use of deep neural networks to learn the relationship between protein sequences and structures and then automatically design a protein sequence for a given protein backbone structure is becoming increasingly feasible. In this study, we developed a deep neural network named DenseCPD that considers the three-dimensional density distribution of protein backbone atoms and predicts the probability of 20 natural amino acids for each residue in a protein. The accuracy of DenseCPD was 53.24 ± 0.17% in a 5-fold cross-validation on the training set and 55.53% and 50.71% on two independent test sets, which is more than 10% higher than those of previous state-of-the-art methods. Two approaches for using DenseCPD predictions in computational protein design were analyzed. The approach using the cutoff of accumulative probability had a smaller sequence search space compared with the approach that simply uses the top-k predictions and therefore enabled higher sequence identity in redesigning three proteins with Rosetta. The network and the datasets are available on a web server at http://protein.org.cn/densecpd.html. The results of this study may benefit the further development of computational protein design methods.