Interactions in protein networks may place constraints on protein interface sequences to maintain correct and avoid unwanted interactions. Here we describe a “multi-constraint” protein design protocol to predict sequences optimized for multiple criteria, such as maintaining sets of interactions, and apply it to characterize the mechanism and extent to which 20 multi-specific proteins are constrained by binding to multiple partners. We find that multi-specific binding is accommodated by at least two distinct patterns. In the simplest case, all partners share key interactions, and sequences optimized for binding to either single or multiple partners recover only a subset of native amino acid residues as optimal. More interestingly, for signaling interfaces functioning as network “hubs,” we identify a different, “multi-faceted” mode, where each binding partner prefers its own subset of wild-type residues within the promiscuous binding site. Here, integration of preferences across all partners results in sequences much more “native-like” than seen in optimization for any single binding partner alone, suggesting these interfaces are substantially optimized for multi-specificity. The two strategies make distinct predictions for interface evolution and design. Shared interfaces may be better small molecule targets, whereas multi-faceted interactions may be more “designable” for altered specificity patterns. The computational methodology presented here is generalizable for examining how naturally occurring protein sequences have been selected to satisfy a variety of positive and negative constraints, as well as for rationally designing proteins to have desired patterns of altered specificity. Computational methods have recently led to remarkable successes in the design of molecules with novel functions. These approaches offer great promise for creating highly selective molecules to accurately control biological processes. However, to reach these goals modeling procedures are needed that are able to define the optimal “fitness” of a protein to function correctly within complex biological networks and in the context of many possible interaction partners. To make progress toward these goals, we describe a computational design procedure that predicts protein sequences optimized to bind not only to a single protein but also to a set of target interaction partners. Application of the method to characterize “hub” proteins in cellular interaction networks gives insights into the mechanisms nature has used to tune protein surfaces to recognize multiple correct partner proteins. Our study also provides a starting point to engineer designer molecules that could modulate or replace naturally occurring protein interaction networks to combat misregulation in disease or to build new sets of protein interactions for synthetic biology.
Unlike proteins, the RNA backbone has numerous degrees of freedom (eight, if one counts the sugar pucker), making RNA modeling, structure building and prediction a multidimensional problem of exceptionally high complexity. And yet RNA tertiary structures are not infinite in their structural morphology; rather, they are built from a limited set of discrete units. In order to reduce the dimensionality of the RNA backbone in a physically reasonable way, a shorthand notation was created that reduced the RNA backbone torsion angles to two (η and θ, analogous to φ and ψ in proteins). When these torsion angles are calculated for nucleotides in a crystallographic database and plotted against one another, one obtains a plot analogous to a Ramachandran plot (the η/θ plot), with highly populated and unpopulated regions. Nucleotides that occupy proximal positions on the plot have identical structures and are found in the same units of tertiary structure. In this review, we describe the statistical validation of the η/θ formalism and the exploration of features within the η/θ plot. We also describe the application of the η/θ formalism in RNA motif discovery, structural comparison, RNA structure building and tertiary structure prediction. More than a tool, however, the η/θ formalism has provided new insights into RNA structure itself, revealing its fundamental components and the factors underlying RNA architectural form.
The discovery that RNA molecules can fold into complex structures and carry out diverse cellular roles has led to interest in developing tools for modeling RNA tertiary structure. While significant progress has been made in establishing that the RNA backbone is rotameric, few libraries of discrete conformations specifically for use in RNA modeling have been validated. Here, we present six libraries of discrete RNA conformations based on a simplified pseudo-torsional notation of the RNA backbone, comparable to phi and psi in the protein backbone. We evaluate the ability of each library to represent single nucleotide backbone conformations, and we show how individual library fragments can be assembled into dinucleotides that are consistent with established RNA backbone descriptors spanning from sugar to sugar. We then use each library to build all-atom models of 20 test folds, and we show how the composition of a fragment library can limit model quality. Despite the limitations inherent in using discretized libraries, we find that several hundred discrete fragments can rebuild RNA folds up to 174 nucleotides in length with atomic-level accuracy (<1.5 Å RMSD). We anticipate that the libraries presented here could easily be incorporated into RNA structural modeling, analysis, or refinement tools.