An improved protein decoy set for testing energy functions for protein structure prediction

We have improved the original Rosetta centroid/backbone decoy set by increasing the number of proteins and frequency of near native models and by building on sidechains and minimizing clashes. The new set consists of 1,400 model structures for 78 different and diverse protein targets and provides a challenging set for the testing and evaluation of scoring functions. We evaluated the extent to which a variety of all-atom energy functions could identify the native and close-to-native structures in the new decoy sets. Of various implicit solvent models, we found that a solvent-accessible surface area-based solvation provided the best enrichment and discrimination of close-to-native decoys. The combination of this solvation treatment with Lennard Jones terms and the original Rosetta energy provided better enrichment and discrimination than any of the individual terms. The results also highlight the differences in accuracy of NMR and X-ray crystal structures: a large energy gap was observed between native and non-native conformations for X-ray structures but not for NMR structures.     

Protein–protein structure prediction by scoring molecular dynamics trajectories of putative poses

The prediction of protein–protein interactions and their structural configuration remains a largely unsolved problem. Most of the algorithms aimed at finding the native conformation of a protein complex starting from the structure of its monomers are based on searching the structure corresponding to the global minimum of a suitable scoring function. However, protein complexes are often highly flexible, with mobile side chains and transient contacts due to thermal fluctuations. Flexibility can be neglected if one aims at finding quickly the approximate structure of the native complex, but may play a role in structure refinement, and in discriminating solutions characterized by similar scores. We here benchmark the capability of some state‐of‐the‐art scoring functions (BACH‐SixthSense, PIE/PISA and Rosetta) in discriminating finite‐temperature ensembles of structures corresponding to the native state and to non‐native configurations. We produce the ensembles by running thousands of molecular dynamics simulations in explicit solvent starting from poses generated by rigid docking and optimized in vacuum. We find that while Rosetta outperformed the other two scoring functions in scoring the structures in vacuum, BACH‐SixthSense and PIE/PISA perform better in distinguishing near‐native ensembles of structures generated by molecular dynamics in explicit solvent. Proteins 2016; 84:1312–1320. © 2016 Wiley Periodicals, Inc.     

A computational method for the design of nested proteins by loop‐directed domain insertion

The computational design of novel nested proteins—in which the primary structure of one protein domain (insert) is flanked by the primary structure segments of another (parent)—would enable the generation of multifunctional proteins. Here we present a new algorithm, called Loop‐Directed Domain Insertion (LooDo), implemented within the Rosetta software suite, for the purpose of designing nested protein domain combinations connected by flexible linker regions. Conformational space for the insert domain is sampled using large libraries of linker fragments for linker‐to‐parent domain superimposition followed by insert‐to‐linker superimposition. The relative positioning of the two domains (treated as rigid bodies) is sampled efficiently by a grid‐based, mutual placement compatibility search. The conformations of the loop residues, and the identities of loop as well as interface residues, are simultaneously optimized using a generalized kinematic loop closure algorithm and Rosetta EnzymeDesign, respectively, to minimize interface energy. The algorithm was found to consistently sample near‐native conformations and interface sequences for a benchmark set of structurally similar but functionally divergent domain‐inserted enzymes from the α/β hydrolase superfamily, and discriminates well between native and nonnative conformations and sequences, although loop conformations tended to deviate from the native conformations. Furthermore, in cross‐domain placement tests, native insert‐parent domain combinations were ranked as the best‐scoring structures compared to nonnative domain combinations. This algorithm should be broadly applicable to the design of multi‐domain protein complexes with any combination of inserted or tandem domain connections.     

Restricted sidechain plasticity in the structures of native proteins and complexes

Protein-design methodology can now generate models of protein structures and interfaces with computed energies in the range of those of naturally occurring structures. Comparison of the properties of native structures and complexes to isoenergetic design models can provide insight into the properties of the former that reflect selection pressure for factors beyond the energy of the native state. We report here that sidechains in native structures and interfaces are significantly more constrained than designed interfaces and structures with equal computed binding energy or stability, which may reflect selection against potentially deleterious non-native interactions.     

Motif‐directed redesign of enzyme specificity

Computational protein design relies on several approximations, including the use of fixed backbones and rotamers, to reduce protein design to a computationally tractable problem. However, allowing backbone and off‐rotamer flexibility leads to more accurate designs and greater conformational diversity. Exhaustive sampling of this additional conformational space is challenging, and often impossible. Here, we report a computational method that utilizes a preselected library of native interactions to direct backbone flexibility to accommodate placement of these functional contacts. Using these native interaction modules, termed motifs, improves the likelihood that the interaction can be realized, provided that suitable backbone perturbations can be identified. Furthermore, it allows a directed search of the conformational space, reducing the sampling needed to find low energy conformations. We implemented the motif‐based design algorithm in Rosetta, and tested the efficacy of this method by redesigning the substrate specificity of methionine aminopeptidase. In summary, native enzymes have evolved to catalyze a wide range of chemical reactions with extraordinary specificity. Computational enzyme design seeks to generate novel chemical activities by altering the target substrates of these existing enzymes. We have implemented a novel approach to redesign the specificity of an enzyme and demonstrated its effectiveness on a model system.     

Native fold and docking pose discrimination by the same residue‐based scoring function

Structure prediction and quality assessment are crucial steps in modeling native protein conformations. Statistical potentials are widely used in related algorithms, with different parametrizations typically developed for different contexts such as folding protein monomers or docking protein complexes. Here, we describe BACH‐SixthSense, a single residue‐based statistical potential that can be successfully employed in both contexts. BACH‐SixthSense shares the same approach as BACH, a knowledge‐based potential originally developed to score monomeric protein structures. A term that penalizes steric clashes as well as the distinction between polar and apolar sidechain‐sidechain contacts are crucial novel features of BACH‐SixthSense. The performance of BACH‐SixthSense in discriminating correctly the native structure among a competing set of decoys is significantly higher than other state‐of‐the‐art scoring functions, that were specifically trained for a single context, for both monomeric proteins (QMEAN, Rosetta, RF_CB_SRS_OD, benchmarked on CASP targets) and protein dimers (IRAD, Rosetta, PIE*PISA, HADDOCK, FireDock, benchmarked on 14 CAPRI targets). The performance of BACH‐SixthSense in recognizing near‐native docking poses within CAPRI decoy sets is good as well. Proteins 2015; 83:621–630. © 2015 Wiley Periodicals, Inc.     

Tertiary motifs as building blocks for the design of protein‐binding peptides

Despite advances in protein engineering, the de novo design of small proteins or peptides that bind to a desired target remains a difficult task. Most computational methods search for binder structures in a library of candidate scaffolds, which can lead to designs with poor target complementarity and low success rates. Instead of choosing from pre‐defined scaffolds, we propose that custom peptide structures can be constructed to complement a target surface. Our method mines tertiary motifs (TERMs) from known structures to identify surface‐complementing fragments or “seeds.” We combine seeds that satisfy geometric overlap criteria to generate peptide backbones and score the backbones to identify the most likely binding structures. We found that TERM‐based seeds can describe known binding structures with high resolution: the vast majority of peptide binders from 486 peptide‐protein complexes can be covered by seeds generated from single‐chain structures. Furthermore, we demonstrate that known peptide structures can be reconstructed with high accuracy from peptide‐covering seeds. As a proof of concept, we used our method to design 100 peptide binders of TRAF6, seven of which were predicted by Rosetta to form higher‐quality interfaces than a native binder. The designed peptides interact with distinct sites on TRAF6, including the native peptide‐binding site. These results demonstrate that known peptide‐binding structures can be constructed from TERMs in single‐chain structures and suggest that TERM information can be applied to efficiently design novel target‐complementing binders.     

Design and structure of two new protein cages illustrate successes and ongoing challenges in protein engineering

In recent years, new protein engineering methods have produced more than a dozen symmetric, self‐assembling protein cages whose structures have been validated to match their design models with near‐atomic accuracy. However, many protein cage designs that are tested in the lab do not form the desired assembly, and improving the success rate of design has been a point of recent emphasis. Here we present two protein structures solved by X‐ray crystallography of designed protein oligomers that form two‐component cages with tetrahedral symmetry. To improve on the past tendency toward poorly soluble protein, we used a computational protocol that favors the formation of hydrogen‐bonding networks over exclusively hydrophobic interactions to stabilize the designed protein–protein interfaces. Preliminary characterization showed highly soluble expression, and solution studies indicated successful cage formation by both designed proteins. For one of the designs, a crystal structure confirmed at high resolution that the intended tetrahedral cage was formed, though several flipped amino acid side chain rotamers resulted in an interface that deviates from the precise hydrogen‐bonding pattern that was intended. A structure of the other designed cage showed that, under the conditions where crystals were obtained, a noncage structure was formed wherein a porous 3D protein network in space group I2₁3 is generated by an off‐target twofold homomeric interface. These results illustrate some of the ongoing challenges of developing computational methods for polar interface design, and add two potentially valuable new entries to the growing list of engineered protein materials for downstream applications.     

A comparison of successful and failed protein interface designs highlights the challenges of designing buried hydrogen bonds

The accurate design of new protein–protein interactions is a longstanding goal of computational protein design. However, most computationally designed interfaces fail to form experimentally. This investigation compares five previously described successful de novo interface designs with 158 failures. Both sets of proteins were designed with the molecular modeling program Rosetta. Designs were considered a success if a high‐resolution crystal structure of the complex closely matched the design model and the equilibrium dissociation constant for binding was less than 10 μM. The successes and failures represent a wide variety of interface types and design goals including heterodimers, homodimers, peptide‐protein interactions, one‐sided designs (i.e., where only one of the proteins was mutated) and two‐sided designs. The most striking feature of the successful designs is that they have fewer polar atoms at their interfaces than many of the failed designs. Designs that attempted to create extensive sets of interface‐spanning hydrogen bonds resulted in no detectable binding. In contrast, polar atoms make up more than 40% of the interface area of many natural dimers, and native interfaces often contain extensive hydrogen bonding networks. These results suggest that Rosetta may not be accurately balancing hydrogen bonding and electrostatic energies against desolvation penalties and that design processes may not include sufficient sampling to identify side chains in preordered conformations that can fully satisfy the hydrogen bonding potential of the interface.     

Integration of the Rosetta suite with the python software stack via reproducible packaging and core programming interfaces for distributed simulation

The Rosetta software suite for macromolecular modeling is a powerful computational toolbox for protein design, structure prediction, and protein structure analysis. The development of novel Rosetta‐based scientific tools requires two orthogonal skill sets: deep domain‐specific expertise in protein biochemistry and technical expertise in development, deployment, and analysis of molecular simulations. Furthermore, the computational demands of molecular simulation necessitate large scale cluster‐based or distributed solutions for nearly all scientifically relevant tasks. To reduce the technical barriers to entry for new development, we integrated Rosetta with modern, widely adopted computational infrastructure. This allows simplified deployment in large‐scale cluster and cloud computing environments, and effective reuse of common libraries for simulation execution and data analysis. To achieve this, we integrated Rosetta with the Conda package manager; this simplifies installation into existing computational environments and packaging as docker images for cloud deployment. Then, we developed programming interfaces to integrate Rosetta with the PyData stack for analysis and distributed computing, including the popular tools Jupyter, Pandas, and Dask. We demonstrate the utility of these components by generating a library of a thousand de novo disulfide‐rich miniproteins in a hybrid simulation that included cluster‐based design and interactive notebook‐based analyses. Our new tools enable users, who would otherwise not have access to the necessary computational infrastructure, to perform state‐of‐the‐art molecular simulation and design with Rosetta.     

Detecting the native ligand orientation by interfacial rigidity: SiteInterlock

Understanding the physical attributes of protein‐ligand interfaces, the source of most biological activity, is a fundamental problem in biophysics. Knowing the characteristic features of interfaces also enables the design of molecules with potent and selective interactions. Prediction of native protein‐ligand interactions has traditionally focused on the development of physics‐based potential energy functions, empirical scoring functions that are fit to binding data, and knowledge‐based potentials that assess the likelihood of pairwise interactions. Here we explore a new approach, testing the hypothesis that protein‐ligand binding results in computationally detectable rigidification of the protein‐ligand interface. Our SiteInterlock approach uses rigidity theory to efficiently measure the relative interfacial rigidity of a series of small‐molecule ligand orientations and conformations for a number of protein complexes. In the majority of cases, SiteInterlock detects a near‐native binding mode as being the most rigid, with particularly robust performance relative to other methods when the ligand‐free conformation of the protein is provided. The interfacial rigidification of both the protein and ligand prove to be important characteristics of the native binding mode. This measure of rigidity is also sensitive to the spatial coupling of interactions and bond‐rotational degrees of freedom in the interface. While the predictive performance of SiteInterlock is competitive with the best of the five other scoring functions tested, its measure of rigidity encompasses cooperative rather than just additive binding interactions, providing novel information for detecting native‐like complexes. SiteInterlock shows special strength in enhancing the prediction of native complexes by ruling out inaccurate poses. Proteins 2016; 84:1888–1901. © 2016 Wiley Periodicals, Inc.     

Predicting protein complex geometries with a neural network

A major challenge of the protein docking problem is to define scoring functions that can distinguish near‐native protein complex geometries from a large number of non‐native geometries (decoys) generated with noncomplexed protein structures (unbound docking). In this study, we have constructed a neural network that employs the information from atom‐pair distance distributions of a large number of decoys to predict protein complex geometries. We found that docking prediction can be significantly improved using two different types of polar hydrogen atoms. To train the neural network, 2000 near‐native decoys of even distance distribution were used for each of the 185 considered protein complexes. The neural network normalizes the information from different protein complexes using an additional protein complex identity input neuron for each complex. The parameters of the neural network were determined such that they mimic a scoring funnel in the neighborhood of the native complex structure. The neural network approach avoids the reference state problem, which occurs in deriving knowledge‐based energy functions for scoring. We show that a distance‐dependent atom pair potential performs much better than a simple atom‐pair contact potential. We have compared the performance of our scoring function with other empirical and knowledge‐based scoring functions such as ZDOCK 3.0, ZRANK, ITScore‐PP, EMPIRE, and RosettaDock. In spite of the simplicity of the method and its functional form, our neural network‐based scoring function achieves a reasonable performance in rigid‐body unbound docking of proteins. Proteins 2010. © 2009 Wiley‐Liss, Inc.     

Distributions of beta sheets in proteins with application to structure prediction

We recently developed the Rosetta algorithm for ab initio protein structure prediction, which generates protein structures from fragment libraries using simulated annealing. The scoring function in this algorithm favors the assembly of strands into sheets. However, it does not discriminate between different sheet motifs. After generating many structures using Rosetta, we found that the folding algorithm predominantly generates very local structures. We surveyed the distribution of beta-sheet motifs with two edge strands (open sheets) in a large set of non-homologous proteins. We investigated how much of that distribution can be accounted for by rules previously published in the literature, and developed a filter and a scoring method that enables us to improve protein structure prediction for beta-sheet proteins. Proteins 2002;48:85-97.     

Improved energy bound accuracy enhances the efficiency of continuous protein design

Flexibility and dynamics are important for protein function and a protein's ability to accommodate amino acid substitutions. However, when computational protein design algorithms search over protein structures, the allowed flexibility is often reduced to a relatively small set of discrete side‐chain and backbone conformations. While simplifications in scoring functions and protein flexibility are currently necessary to computationally search the vast protein sequence and conformational space, a rigid representation of a protein causes the search to become brittle and miss low‐energy structures. Continuous rotamers more closely represent the allowed movement of a side chain within its torsional well and have been successfully incorporated into the protein design framework to design biomedically relevant protein systems. The use of continuous rotamers in protein design enables algorithms to search a larger conformational space than previously possible, but adds additional complexity to the design search. To design large, complex systems with continuous rotamers, new algorithms are needed to increase the efficiency of the search. We present two methods, PartCR and HOT, that greatly increase the speed and efficiency of protein design with continuous rotamers. These methods specifically target the large errors in energetic terms that are used to bound pairwise energies during the design search. By tightening the energy bounds, additional pruning of the conformation space can be achieved, and the number of conformations that must be enumerated to find the global minimum energy conformation is greatly reduced. Proteins 2015; 83:1151–1164. © 2015 Wiley Periodicals, Inc.     

An Integrated Framework Advancing Membrane Protein Modeling and Design

Membrane proteins are critical functional molecules in the human body, constituting more than 30% of open reading frames in the human genome. Unfortunately, a myriad of difficulties in overexpression and reconstitution into membrane mimetics severely limit our ability to determine their structures. Computational tools are therefore instrumental to membrane protein structure prediction, consequently increasing our understanding of membrane protein function and their role in disease. Here, we describe a general framework facilitating membrane protein modeling and design that combines the scientific principles for membrane protein modeling with the flexible software architecture of Rosetta3. This new framework, called RosettaMP, provides a general membrane representation that interfaces with scoring, conformational sampling, and mutation routines that can be easily combined to create new protocols. To demonstrate the capabilities of this implementation, we developed four proof-of-concept applications for (1) prediction of free energy changes upon mutation; (2) high-resolution structural refinement; (3) protein-protein docking; and (4) assembly of symmetric protein complexes, all in the membrane environment. Preliminary data show that these algorithms can produce meaningful scores and structures. The data also suggest needed improvements to both sampling routines and score functions. Importantly, the applications collectively demonstrate the potential of combining the flexible nature of RosettaMP with the power of Rosetta algorithms to facilitate membrane protein modeling and design.     

Structural insights into protein-metal ion partnerships

New metalloprotein structures continue to provide discoveries regarding protein-metal ion partnerships. Many recent structures reveal metal ion sites that control or are controlled by protein conformational change, including modulation by alternative splice variants and striking conformational changes. Only a few novel catalytic metal centers have been revealed recently, such as the surprising Ni-hook superoxide dismutase catalytic site and the cubane-like Mn(3)CaO(4) photosynthetic oxygen-evolving center. However, important new variations on old heme themes, breakthroughs in the fields of metal ion regulation and metallochaperones, and captivating insights into partnerships between proteins and minerals have also been described. Very high resolution metal site structures and metalloprotein design will be increasingly important in order to leverage the wealth of native metalloprotein structures into a deep understanding of metal ion site specificity and activity.     

Prediction of structures of zinc‐binding proteins through explicit modeling of metal coordination geometry

Metal ions play an essential role in stabilizing protein structures and contributing to protein function. Ions such as zinc have well‐defined coordination geometries, but it has not been easy to take advantage of this knowledge in protein structure prediction efforts. Here, we present a computational method to predict structures of zinc‐binding proteins given knowledge of the positions of zinc‐coordinating residues in the amino acid sequence. The method takes advantage of the “atom‐tree” representation of molecular systems and modular architecture of the Rosetta3 software suite to incorporate explicit metal ion coordination geometry into previously developed de novo prediction and loop modeling protocols. Zinc cofactors are tethered to their interacting residues based on coordination geometries observed in natural zinc‐binding proteins. The incorporation of explicit zinc atoms and their coordination geometry in both de novo structure prediction and loop modeling significantly improves sampling near the native conformation. The method can be readily extended to predict protein structures bound to other metal and/or small chemical cofactors with well‐defined coordination or ligation geometry.     

Discovery of Rab1 binding sites using an ensemble of clustering methods

Targeting non‐native‐ligand binding sites for potential investigative and therapeutic applications is an attractive strategy in proteins that share common native ligands, as in Rab1 protein. Rab1 is a subfamily member of Rab proteins, which are members of Ras GTPase superfamily. All Ras GTPase superfamily members bind to native ligands GTP and GDP, that switch on and off the proteins, respectively. Rab1 is physiologically essential for autophagy and transport between endoplasmic reticulum and Golgi apparatus. Pathologically, Rab1 is implicated in human cancers, a neurodegenerative disease, cardiomyopathy, and bacteria‐caused infectious diseases. We have performed structural analyses on Rab1 protein using a unique ensemble of clustering methods, including multi‐step principal component analysis, non‐negative matrix factorization, and independent component analysis, to better identify representative Rab1 proteins than the application of a single clustering method alone does. We then used the identified representative Rab1 structures, resolved in multiple ligand states, to map their known and novel binding sites. We report here at least a novel binding site on Rab1, involving Rab1‐specific residues that could be further explored for the rational design and development of investigative probes and/or therapeutic small molecules against the Rab1 protein. Proteins 2017; 85:859–871. © 2016 Wiley Periodicals, Inc.     

Protein-protein docking with multiple residue conformations and residue substitutions

The protein docking problem has two major aspects: sampling conformations and orientations, and scoring them for fit. To investigate the extent to which the protein docking problem may be attributed to the sampling of ligand side‐chain conformations, multiple conformations of multiple residues were calculated for the uncomplexed (unbound) structures of protein ligands. These ligand conformations were docked into both the complexed (bound) and unbound conformations of the cognate receptors, and their energies were evaluated using an atomistic potential function. The following questions were considered: (1) does the ensemble of precalculated ligand conformations contain a structure similar to the bound form of the ligand? (2) Can the large number of conformations that are calculated be efficiently docked into the receptors? (3) Can near‐native complexes be distinguished from non‐native complexes? Results from seven test systems suggest that the precalculated ensembles do include side‐chain conformations similar to those adopted in the experimental complexes. By assuming additivity among the side chains, the ensemble can be docked in less than 12 h on a desktop computer. These multiconformer dockings produce near‐native complexes and also non‐native complexes. When docked against the bound conformations of the receptors, the near‐native complexes of the unbound ligand were always distinguishable from the non‐native complexes. When docked against the unbound conformations of the receptors, the near‐native dockings could usually, but not always, be distinguished from the non‐native complexes. In every case, docking the unbound ligands with flexible side chains led to better energies and a better distinction between near‐native and non‐native fits. An extension of this algorithm allowed for docking multiple residue substitutions (mutants) in addition to multiple conformations. The rankings of the docked mutant proteins correlated with experimental binding affinities. These results suggest that sampling multiple residue conformations and residue substitutions of the unbound ligand contributes to, but does not fully provide, a solution to the protein docking problem. Conformational sampling allows a classical atomistic scoring function to be used; such a function may contribute to better selectivity between near‐native and non‐native complexes. Allowing for receptor flexibility may further extend these results.