Advertisement
Browse Subject Areas
?

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

  • Loading metrics

Open Access

Peer-reviewed

Research Article

Sequence statistics of tertiary structural motifs reflect protein stability

Abstract

The Protein Data Bank (PDB) has been a key resource for learning general rules of sequence-structure relationships in proteins. Quantitative insights have been gained by defining geometric descriptors of structure (e.g., distances, dihedral angles, solvent exposure, etc.) and observing their distributions and sequence preferences. Here we argue that as the PDB continues to grow, it may become unnecessary to reduce structure into a set of elementary descriptors. Instead, it could be possible to deduce quantitative sequence-structure relationships in the context of precisely-defined complex structural motifs by mining the PDB for closely matching backbone geometries. To validate this idea, we turned to the the task of predicting changes in protein stability upon amino-acid substitution—a difficult problem of broad significance. We defined non-contiguous tertiary motifs (TERMs) around a protein site of interest and extracted sequence preferences from ensembles of closely-matching substructures in the PDB to predict mutational stability changes at the site, ΔΔGm. We demonstrate that these ensemble statistics predict ΔΔGm on par with state-of-the-art statistical and machine-learning methods on large thermodynamic datasets, and outperform these, along with a leading structure-based modeling approach, when tested in the context of unbiased diverse mutations. Further, we show that the performance of the TERM-based method is directly related to the amount of available relevant structural data, automatically improving with the growing PDB. This enables a means of estimating prediction accuracy. Our results clearly demonstrate that: 1) statistics of non-contiguous structural motifs in the PDB encode fundamental sequence-structure relationships related to protein thermodynamic stability, and 2) the PDB is now large enough that such statistics are already useful in practice, with their accuracy expected to continue increasing as the database grows. These observations suggest new ways of using structural data towards addressing problems of computational structural biology.

Citation: Zheng F, Grigoryan G (2017) Sequence statistics of tertiary structural motifs reflect protein stability. PLoS ONE 12(5): e0178272. https://doi.org/10.1371/journal.pone.0178272

Editor: Narayanaswamy Srinivasan, Indian Institute of Science, INDIA

Received: February 23, 2017; Accepted: May 10, 2017; Published: May 26, 2017

Copyright: © 2017 Zheng, Grigoryan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

Data Availability: All relevant data are within the paper and its Supporting Information files.

Funding: This work was supported by National Science Foundation, DMR1534246 (GG) and National Institutes of Health, P20-GM113132 (GG). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

Competing interests: The authors have declared that no competing interests exist.

Introduction

Quantifying sequence-structure relationships in proteins has been a long-standing fundamental challenge in computational structural biology. In principle, a molecular mechanics (MM) description of the protein molecule offers the potential to estimate arbitrary thermodynamic parameters via statistical mechanics, as a function of sequence, but this suffers from issues of computational tractability [1–3]. Thus, a variety of empirical scoring functions have been developed for representing sequence-structure compatibility, offering reduced computational complexity at the expense of physical correctness [4–7]. Among these, knowledge-based potentials (also known as statistical potentials) have derived quantitative insights from statistics of native structures in the Protein Data Bank (PDB). The power of these approaches lies in their ability to treat relaxations of protein degrees of freedom implicitly, by drawing on structural observations in the PDB. For example, rotameric probabilities or backbone ϕ/ψ angle frequencies represent entire ensembles of similar conformations rather frozen structures [8]. A similar argument applies to distance bins in atomic or residue-level interaction potentials [9]. Knowledge-based potentials have contributed significantly towards progress in such grand challenges as structure prediction, and a broad variety of structural features have been exploited towards attaining better statistical potentials—e.g., backbone dihedral angles, atomic distances and densities, bond orientations, residue burial states, and inter-residue contacts, to name a few [9–14]. Statistics of these structural features, and their associated sequence propensities, have been combined into scoring functions in a variety of ways [9, 15–19].

Simple local structural descriptors, such as distances or angles, have the advantage that their individual statistics are well estimated from available structural data. On the other hand, combining the statistics of such descriptors into a single scoring function effectively amounts to estimating (either directly or indirectly) their joint probability distribution, which is not trivial due to inter-dependencies between descriptors. It is often necessary to imprecisely assume independence among features to produce generalized models. This limitation can be potentially addressed by using larger structural motifs in place of simple descriptors, such that the former would inherently capture correlations between elementary features. Further, a motif-based description of sequence-structure relationships would recognize the modular nature of protein structural patterns, the evidence for which across a range of scales has been mounting in recent studies [20–28]. Sequence-structure relationships extracted from modular contiguous backbone fragments have been instrumental in the advancement of structure prediction and protein design—e.g., as part of Rosetta [29–31] and I-TASSER [32, 33] methods. In recent years, modularity in structural motifs that extend beyond secondary structure has also been described and suggested to be of use in structural modeling and analysis [20–22, 34–36]. In a notable example, Feng and Barth have systematically analyzed structural motifs in multipass membrane proteins, having found that units of three interacting transmembrane helices mostly fall into six structural classes [21]. The authors went on to shown that the sequence-structure relationships implied by these motifs are predictive of topology and conformational flexibility [21]. Our own prior work has found that the protein structural universe is highly degenerate at the level of multi-segment tertiary motifs (TERMs), with emergent sequence-structure relationships able to predict native-like sequences given previously unseen native backbones [20].

At the extreme, motifs can be defined to represent the entire relevant structural environment, capturing the exact context, but statistics may become limiting. Thus, there is a tradeoff between accuracy and interpretability of statistics as motifs become more complex and detailed. So where is the optimum? In this work, we argue that at the current size of the structural database, it is already practical to quantify sequence-structure relationships using multi-segment TERMs, by extracting sequence models from ensembles of closely matching substructures. To this end, we focus on the task of predicting changes in protein stability upon point mutations, ΔΔGm. We show that quantitative estimates can be derived using information from TERMs alone, with resulting accuracy on par with or better than that of statistical potentials and state-of-the-art estimators.

To date, best performance in ΔΔGm prediction has been reported for machine-learning methods that combine multiple features and train on large sets of experimentally measured ΔΔGm values [37–42]. Despite notable successes, assessments of existing methods have concluded that none consistently make accurate predictions on diverse test sets, showing there to be significant room for improvement and motivating the development alternative approaches [43, 44]. Here we show that sequence statistics of TERMs surrounding the mutated position, emergent from closely matching substructures in the PDB, enable ΔΔGm prediction on par with state-of-the-art methods, while requiring no training on available data. Further, this estimator outperforms all tested competing models when applied on an unbiased dataset of diverse mutations from recent deep sequencing analyses [45]. In addition, we show that prediction accuracy is driven by the the amount of available structural data, enabling the method to estimate the confidence level of individual predictions. Taken together, our results show that tertiary structural motifs and their PDB-based sequence statistics encode sequence-structure relationships reflective of fundamental thermodynamics of structure. This suggests that data mining strategies with complex multi-segment motif should produce increasingly useful and accurate insights as the structural database continues to grow.

Theory

In previous work, we proposed the local tertiary motif (TERM) as a compact elementary unit of protein structure [20, 46]. Briefly, a TERM is defined around a “seed” position i to include its surrounding backbone segment and those of all positions poised to contact i—i.e., positions capable of hosting side-chains that can contact side-chains at i (Fig 1A; see Materials and methods). Thus, a TERM is (generally) a multi-segment motif representing the local structural environment surrounding its seed residue. Close structural matches to a given TERM, from unrelated proteins, can be seen as reporting on the sequence determinants of the TERM’s backbone geometry, under a certainly amount of implicit structural relaxation. Here we test wether these TERM statistics reflect fundamental determinants of structural stability by using them to predict ΔΔGm of point mutations.

thumbnail
Download:
Fig 1. TERM-based ΔΔGm prediction.

Procedural flow is indicated with arrows, starting from the top left. Given a structure of the protein of interest, a TERM is defiend around the mutated position (green sphere) to include any potentially contacting positions (yellow spheres) and flanking backbone segments (white sticks and ribbon). The TERM is next decomposed into sub-TERMs—i.e., substructures containing a subset of the contacting positions and flanking segments. Structural ensembles for each sub-TERMs are generated by searching the PDB for close structural matches using MASTER [47]. Finally, sequences from matching ensemble of all sub-TERMs (and the original TERM, data permitting) are used to extract positional and pair amino-acid preferences to predict ΔΔGm.

https://doi.org/10.1371/journal.pone.0178272.g001

Suppose we seek to estimate the change in stability upon mutating the protein position i from amino acid u to v, . If the TERM seeded at residue i has many diverse structural matches in the PDB, we may be able to deduce from the sequences of these matches whether u or v is energetically preferred at i, and by how much. In the limit of a large number of matches, it would be possible to derive a full statistical model for the TERM, describing the probability of observing it with any given amino-acid sequence. Then, the relative stability of u versus v, in the specific context of the protein in question, could be directly evaluated. Of course, such a complete model could not be obtained in many realistic cases, where the number of matches may be limited. But approximations involving a subset of positions in the TERM may be plausible. In the limit of very few available matches, the mere overall frequency of u versus v at i may still be informative. The approach we take here aims to build as complete and accurate of a model for the sequence preferences at and around i as possible, based on the totality of available structural match data (Fig 1).

General formulation

Here we assume that the only structural and sequence context that influences is captured by the TERM seeded at residue i; lets call it t. This includes the backbone ensemble represented by t and the amino acids at protein positions covered by t (excluding i), . We thus express as: (1) where is the effective statistical energy of amino acid x in the local sequence and structural environment of position i. Further, we assume this statistical energy to be composed of only effective self and pair energy contributions—energy parameters (EPs): (2) where is the effective self energy parameter (sEP) describing the compatibility of x at position i with the backbone ensemble of t, each represents an effective pair energy parameter (pEP) describing the correction to associated with the sequence context at position j (i.e., the amino acid ), and C is the set of positions within t that are most likely to influence amino-acid preferences at i. Here, we take C to contain the positions capable of accommodating contacts with i, defined via our previously presented pseudo-distance metric of “contact degree” [46] (see Materials and methods).

Our goal is to deduce EP values from the ensembles of structural fragments whose backbone conformations closely resemble t. We do so by seeking EPs that maximally describe the sequences observed within these matches. Identifying matches is made simple with our structure search engine MASTER [47], which can find all sub-structures from a structural database that are within a given backbone root-mean-square-deviation (RMSD) cutoff of t (see Materials and methods and S1 Text). However, complex TERMs may not have sufficiently many examples in the PDB to support our goal of extracting meaningful EPs. For this reason, we also consider substructures of t, which we refer to as “sub-TERMs”, and use the combined statistics of multiple sub-TERMs of varying sizes and complexities to approximate the sequence-structure relationships of the original t.

Motif definition and statistics extraction

An order-k sub-TERM of t is a substructure that includes residue i, with its local backbone segment, and k residues from C (0 ≤ k ≤ |C|), with their local backbone segments. Thus, a total of 2|C| sub-TERMs are possible, each induced by a unique subset of contacting residues, and all of these can be searched within the PDB to generate matching ensembles. However, we reasoned that higher-order sub-TERMs are unlikely to be well represented in the PDB if lower-order sub-TERMs contained within them are not. Thus, to limit computational time while preserving most of the relevant data, we initially searched for the elementary order-0 TERM (i.e., the local backbone segment around i) and all order-1 sub-TERMs, with each order-k sub-TERM (k ≥ 2) subsequently searched only if the number of matches for all of its constituent lower-order sub-TERMs exceeded 100. Structural matches were identified with MASTER [47], using a backbone RMSD cutoff that varied based on the size and complexity of the query TERM [20] (see Supplementary Methods in S1 Text). Matches were then filtered to remove those originating from proteins homologous to the protein with the analyzed mutation, so as to remove any unfair bias towards the native residue. Remaining matches were clustered based on their local sequence similarity around the mutated position, with only one representative match from each cluster preserved as a redundancy filter (see Materials and methods). This final set of matches was used for extracting sequence statistics and building a model to predict ΔΔGm, as detailed below.

Deducing energy parameters from match sequence statistics

Let m be a specific structural match to the sub-TERM ts induced by contacting positions Cs ⊆ C, and let be the sequence of that match. Then, the effective energy of amino acid x at the seed position i in the context of this match can be represented following Eq 2 as: (3) where is the amino acid in the j-th position of match m. From this, we can compute the probability of observing x at i in match m, , under our statistical energy model as: (4) where P0(x) represents the background bias frequency of observing amino acid x and Zm is the is the partition function over all possible amino acids: (5) The background frequency P0 accounts for the fact that different amino acids may have different a priori proposal probabilities due to reasons unrelated to either structure or function (e.g., due to fundamental rates of genomic nucleotide conversions). Biases in amino-acid distributions that appear in even non-coding intergenic DNA regions suggest that such a background is likely non-uniform [48]. On the other hand, such biases vary by species, so an exact definitive background is difficult to estimate. Still, Echols et al. showed that intergenic and genomic amino-acid distributions, across species, do agree in their overall trends—e.g., over-representations of such amino acids as Leu and Ser, and under-representation of Trp, Cys, and Tyr [48]. Thus, in our study, we took as P0 the overall distribution of amino acids in the structural database (see Table 1 in S1 Text), such that contributions from different species, folds, and structural environments would average out to some extent.

Using Eq 4, we can compute the distribution of amino acids we expect at the seed position i in matches to any sub-TERM ts, given a set of EP values. We then propose that the optimal EP values are those that maximally describe the amino acids actually observed at the seed position in these matches. That is, those parameters for which probabilities emergent from Eq 4 are maximally coincident with observed frequencies. Thus, we express the problem of estimating optimal EP values as minimization of the following objective function: (6) where S is the total number of sub-TERMs considered, Ms is the number of matches for the s-th sub-TERM, and ws is a weighting factor of the s-th sub-TERM that reduces the contribution of sub-TERMs with fewer matches as these may have unreliable statistics. We set ws to Ms/(Ms + 1000), such that 1,000 matches was the characteristic cutoff around which sub-TERM contributions changed significantly.

Robustness of prediction under sparse statistics

Our model needs to estimate 20 + 400 ⋅ n parameters for a position with n contacts, while not all of these may be equally well represented in sub-TERM matches. The objective function in Eq 6 alone may not guarantee robust estimation of all EPs. In an extreme case, when a certain amino acid is never observed in an ensemble, optimal values of associate EPs would be infinite, which is unrealistic. More generally, EP estimations are susceptible to stochastic noise if relevant observations are sparse. We address this by introducing prior EP values (i.e., starting assumptions) and a regularization term to the objective function that keeps EPs close to these priors, unless considerable evidence exists to suggest otherwise. The full objective function becomes: (7) where L0 is taken from Eq 6, λ is a parameter to control the strength of regularization, P is the set of all EPs, J(p) and are the current and prior values of a given parameter p, and O(p) is a measure of occurrence of p—i.e., the number of times the sequence pattern represented by p is observed in matches over all ensembles. For example, the occurrence of an sEP would be the number times x is observed at position i within all matches. We set the default values for all sEPs to be zeros, and those for pEPs to be equal to a generic residue-level contact potential derived from observations of amino-acid pairs at positions poised for interaction (see Materials and methods), unless otherwise specified. The impact of the modified objective in Eq 7 is that the estimation of EPs is driven by the data when relevant matches are abundant, but defaults to prior values smoothly when observations are too sparse.

Results

Predicting ΔΔGm of point mutations

To benchmark the performance of the above framework we used point mutations from the ProTherm database [49] with experimentally-measured ΔΔGm values and available structures in the PDB. Specifically, we used the subset of ProTherm curated by Dehouck et al. (mutations in globular proteins with values averaged over redundant entries), with a total of 2,648 point mutations at 1,428 unique protein sites from 115 proteins; hereafter referred to as S2648 [37]. This dataset covers mutations across diverse environments with respect to TERM-based statistics, as shown in Fig 1 in S1 Text (e.g., the number of contacts and sub-TERMs per position, and the number of matches per sub-TERM vary considerably). The set thus represents a robust test of whether TERMs capture relevant sequence-structure relationships.

The only free variable in our framework is the regularization parameter λ in Eq 7, which can be interpreted as the characteristic number of occurrences a given EP must reach before it can be allowed to significantly deviate from its default value. We thus reasoned that a value of λ = 1,000 maybe be roughly appropriate (e.g., for pair parameters, there are a total of 400 possible amino-acid combinations, so more matches should be needed to confidently resolve their relative effects). With this choice of λ we referred to our model as TERM-ΔΔG and used it to predicted the ΔΔGm for all mutations in S2648; see Fig 2 in S1 Text. Throughout the paper, performance is assessed by comparing predicted and experimentally-measured ΔΔGm values via the Pearson correlation coefficient (R), the Spearman rank-order correlation coefficient (ρ), the root mean square of the residuals after linear regression (RMSE), and the fraction of correctly predicted ΔΔG signs (Accuracy) (see Materials and methods). The performance on S2648 showed R = 0.56, ρ = 0.54, RMSE = 1.21 and Accuracy = 75%. To test how sensitive this result was to the choice of λ, we repeated all calculations with several other values, confirming that the initial intuitive choice was in the right range and that, in general, differences were small until λ deviated considerably from the 200-1,000 range (see Fig 3 in S1 Text and Table 1).

thumbnail
Download:
Table 1. Prediction performance with different strengths of regularization.

https://doi.org/10.1371/journal.pone.0178272.t001

Still, the performance did decrease when λ was either very low or very high (Table 1)—i.e., when either EP priors or TERM statistics were given little weight, respectively, suggesting that both were important for good prediction accuracy. To explore this further, we formulated two control models: one ignored TERM statistics and simply set EPs to their default values, amounting to a simple residue-level statistical contact potential (model ConPot), and another assumed no prior knowledge on EPs, setting their default values to zero, and used TERM statistics to derive parameters as described above (model TERM-ΔΔGx); see Table 2. Both models performed significantly worse than the initial model in all metrics. These results suggest that contact potential values and TERM statistics may complement each other—the former are much better defined statistically, but lack any structural context, whereas the latter have considerable contextual information, but may lack statistical strength in some cases. A prior constraint on EP values that weakens as TERM statistics become better defined appears to be an effective solution for combining the strengths of the two metrics.

thumbnail
Download:
Table 2. Prediction performance under different models.

https://doi.org/10.1371/journal.pone.0178272.t002

Contribution of higher-order tertiary structural motifs

In developing our model, we reasoned that statistics emergent from complex queries, those that simultaneously encompass multiple contacts of the mutated residue, would be important for correctly capturing the relevant structural environment. It is known that protein thermodynamics cannot be accurately modeled with independent pairwise additive inter-residue contributions [50, 51]. And although our framework does not attempt to model many-body interactions explicitly, it does require self and pair EPs to be optimized simultaneously in the context of all queried sub-TERMs. Thus, in match ensembles of complex sub-TERMs, multiple pEPs combine to evaluate amino-acid preferences at the mutated position (see Eq 3). In this way, parameters change concomitantly during optimization, which has the potential to capture couplings between contributions of multiple contacts, to some extent. Of course, this assumes that observations of relevant multi-contact sequence patterns are sufficiently abundant. To test whether statistics from complex sub-TERM ensembles really did benefit prediction, we considered models in which ensembles of some high-order sub-TERMs were removed.

When only zero- and first-order sub-TERMs were preserved, corresponding to one- and two-segment motifs only, prediction performance decreased relative to the full model (Table 2). Interestingly, however, a model that considered only zeroth-, first-, and second-order sub-TERM ensembles performed slightly better than the full model; see Table 2 and corresponding scatter plot in Fig 2. This suggests that the PDB is now large enough to allow capturing meaningful statistics for the coupling between two contacts, which are effectively three-body contributions. However, the benefit of mining for even higher-order correlations appears diminished. On the one hand, such couplings are expected to be small from physical principles (though not necessarily negligible). On the other hand, the representation of associated higher-order fragments is expected to be poorer. As a result, incorporation of data from such higher-order motifs does not appear to be beneficial at the moment, though it does not significantly degrade performance either. Perhaps unsurprisingly, zero-order sub-TERMs alone perform rather poorly (see Table 2, model TERM-ΔΔG0), despite having the highest number of structural matches and best-resolved sequence statistics. This marked difference between TERM-ΔΔG0 and either of the higher-order models demonstrates that tertiary-structure information encoded in TERMs contributes greatly to prediction accuracy.

thumbnail
Download:
Fig 2. The performance of TERM-ΔΔG2 on S2648.

Predicted and measured ΔΔGm values are plotted on the X- and Y-axes, respectively. Color represents point cloud density. The least-squares regression line is shown with dashes.

https://doi.org/10.1371/journal.pone.0178272.g002

Inclusion of multi-contact ensembles appears to better model mutations in crowded positions, where considering the contribution of each contact independently may cause an overestimation of the total effect. A representative example of this is the mutation I8A in 1RIS (ribosomal protein S6 from Thermus thermophilus). This position is in a β-strand, surrounded by several other β-strands and an α-helix, with a total of nine contacting positions by our definition (Fig 3A). Considering only local and first-order sub-TERMs strongly over-predicts the effect of mutating Ile to Ala, by simply adding the (generally unfavorable) contributions emergent from the statistics of each individual contact. On the other hand, when second-order sub-TERMs are included (a total of 36 in this case), effectively forcing pair EPs to be consistent with one another, the contributions of individual contacts decrease, and the final prediction closely agrees with the experimental value (see Fig 3). This appears to be a general trend, with mutations at more crowded positions (i.e., those with more available second-order sub-TERMs) exhibiting higher improvement in ΔΔGm prediction and more reduction of pEP magnitudes upon the addition of order-two sub-TERMs, compared to their less crowded counterparts (Fig 4A in S1 Text).

thumbnail
Download:
Fig 3. The role of multi-contact ensembles in ΔΔGm prediction, on the example of 1RIS_AI8A.

(A) and (B) correspond to models TERM-ΔΔG1 and TERM-ΔΔG2, respectively. The mutated position is shown in yellow and all its contacting positions (9 in total) are shown in cyan. Values of estimated sEP and pEPs are shown in red and blue, respectively. The experimental ΔΔGm for the mutation is 3.56 kcal/mol (destabilizing).

https://doi.org/10.1371/journal.pone.0178272.g003

Because of its comparable performance relative to the full model and the shorter running time, we chose TERM-ΔΔG2 as the standard model for the rest of the study. Its performance metrics on the S2648 are R = 0.564, ρ = 0.541, RMSE = 1.199, Accuracy = 0.747 (Fig 2), and if 10% of outliers are discarded (by to the same procedure as in Dehouck et al. [37]), R and ρ increase to 0.729 and 0.736, respectively (Table 2).

Comparison with existing methods

In developing their ΔΔGm prediction model, PoPMuSiC 2.0, Dehouck et al. used 2298 mutations from S2648 to learn (via neural networks) 27 scaling factors for combining 26 statistical energy contributions, setting the remaining 350 mutations aside for testing [37]. The same test set (S350) has been used as a standard benchmark by several other leading predictors, such as mCSM and STRUM [41, 42]. The performance of TERM-ΔΔG2 on S350 (R = 0.62, R = 0.78 with 10% outlier exclusion) is comparable to those of PoPMuSiC, mCSM, and STRUM (Table 3), while other predictors tested by Dehouck et al. showed considerably lower performance [37].

thumbnail
Download:
Table 3. The performance of the TERM-based model relative to other published methods.

https://doi.org/10.1371/journal.pone.0178272.t003

Importantly, our method does not involve training on experimental ΔΔGm data. Instead, it produces estimates based on the fundamental assumption that TERM sequence statistics are shaped by an underlying thermodynamic process. Thus, the extent to which the approach produces meaningful ΔΔGm values is a validation of this hypothesis. Further, because it requires no training on prior ΔΔGm data, the method is not subject to artifacts that can emerge in machine-learning models due to systematic biases in training/testing data. Predictors of ΔΔGm have generally been trained and tested on data from ProTherm [49]—a high-value resource for the field, which nevertheless has a biased representation of mutations. For example, 28% (744) of the mutations in S2648 are substitutions to Ala, as protein stabilities and functions are often probed with alanine-scanning experiments. Also, mutations from large to small side chains (i.e., those decreasing molecular weight by the equivalent of one -CH2- group or more) are dominant in S2648, making up 76% (2000) of all mutations. Finally, training biases can be introduced through the overlap between positions in the training and test sets. Our survey of S350 found that 71 out of 300 unique positions in this set also occurred among the 2298 mutations that remained after excluding S350 from S2648, each four times on average. Thus, the standard training and test sets used by many existing predictors are not truly independent. For all of these reasons, we sought to determine whether our TERM-based framework offers advantages over other predictors in scenarios where the mutations of interest are more diverse.

A truly stringent and unbiased test would be to predict the “thermodynamic landscape” of a protein—i.e., the ΔΔGm of all 19 possible mutations at all positions. Whereas direct experimental measurement of such landscapes is laborious, a growing number of recent studies have utilized deep sequencing technologies to systematically describe the effects of mutations on protein function, characterising “fitness landscape” instead [53]. Functional changes due to single mutations are not necessarily highly correlated with ΔΔGm, as the wild-type protein is usually stable enough that stabilizing mutations may not offer further fitness gains, and mildly destabilizing mutations are not always deleterious enough to cause a detectable fitness loss. However, it has been shown that the stability effect of a mutation can be instead identified in the context of a marginally stable protein (i.e., with appropriate destabilizing mutations as the background), and sequence libraries of double mutations have been created for this purpose [54, 55].

Sun and co-workers have created a fitness landscape for all single and double mutations of the 56-residue protein GB1 (G immunoglobulin-binding domain B1; PDB entry 1PGA) by mRNA display and deep sequencing techniques, using the binding to IgG as the functional readout [55]. They also derived a method for estimating the ΔΔGm of a mutation based on its fitness effect in an appropriate genetic background of marginal stability (), showing it to closely correlate with thermodynamically measured ΔΔGm values (R > 0.9 for 82 mutations). Here, we took 699 high-confidence estimates from the Wu et al. study as an unbiased benchmark dataset (S699) (see details in Materials and methods) to compare our TERM-based method with PoPMuSiC2.0, mCSM, and STRUM [55]. Our method performed the best in this test (R = 0.623, ρ = 0.601), closely followed by PoPMuSiC-2.0 (R = 0.626, ρ = 0.585). On the other hand, only weak correlations were observed between the and predictions of mCSM and STRUM (Fig 4 and Table 3), despite both of these showing outstanding performance on S2648 and S350. As with previous test sets, the performance of ConPot (a simple residue-level contact potential) on S699 is worse than that of the TERM-based approach, but the difference is far greater here. This suggests that the impact of TERM statistics is increased in the case of an unbiased set of mutations (compare Tables 2 and 3). Further supporting this, the full TERM-ΔΔG model, which considers all high-order sub-TERMs, marginally outperforms the standard TERM-ΔΔG2 on this dataset (see Fig 5 in S1 Text).

thumbnail
Download:
Fig 4. The performance of different methods on the S699 set.

Data in each pannel are shown in the same manner as in Fig 2, with panel title indicating the prediction method used.

https://doi.org/10.1371/journal.pone.0178272.g004

The stark differences in performance of some methods on the two types of test sets may be due to training biases—explicit (i.e., in the fitting of model parameters) or implicit (i.e., in the choice of model type and relevant descriptors). For example, the loss of buried surface area and secondary-structure propensities, appropriately combined, may be reasonably sufficient for predicting the effects of mutations to Ala, but could be less adequate for predicting other substitution types (e.g., introduction/loss of a buried hydrogen bond). To distinguish more intricate differences between amino-acid energetic preferences, the explicit local structural environment, which can be captured using TERM match ensemble statistics, could be increasingly important.

An alternative means of predicting ΔΔGm values is to physically model the consequence of the mutation on the structure and compare the apparent change in stability of the folded state to that of the unfolded state. Though this is a difficult task, structure/physics-based methods for predicting ΔΔGm have been proposed [56–59]. Chief among the difficulties with such predictions is anticipating changes in backbone structure upon mutation, as well as balancing the contribution from different physical effects (e.g., burial of polar groups versus additional hydrogen-bond interactions). Recently, capabilities implemented within the Rosetta software suite [31] have enabled the exploration of structure-based models that do explicitly account for structural deformations, and also aim to capture the various energetic contributions with a library of both physical and empirical energy terms. In a recent study, Park et al. systematically optimized the energy function within Rosetta by adjusting its various parameters to improve performance on a range of structure modeling tasks, including single-mutation ΔΔGm prediction [52]. The resulting optimal energy function, used in conjunction with a new thorough backbone sampling protocol, showed a large improvement in ΔΔGm prediction over Rosetta’s previous standard energy function talaris2014 [52]. We thus compared the performance of our TERM-based approach to that of this optimized Rosetta protocol as representing the state of the art in explicit structure-based modeling for ΔΔGm prediction. As shown in Fig 4F, the Rosetta-based approach performs better than some of the statistical methods or the simple ConPot model (R = 0.571, ρ = 0.591), but the TERM-ΔΔG2 approach performs better still (predictions of TERM-ΔΔG2 on S350 and S699 are provided as S1 Data).

Prediction accuracy depends on the amount of structural data

The accuracy of our ΔΔGm prediction varies considerably for different mutations. Understanding the origin of this variation could enable estimation of prediction quality and may suggest avenues for further model improvements. We reasoned that the accuracy of TERM-based ΔΔGm estimation should be affected by the amount of available structural data matching the local environment of the mutated position. To quantify this, we introduced the metric ubiquity for a mutation from u to v at position i, which captures how well the sequence/structure context of the mutation is represented in sub-TERM matches: (8) Here, the two inner terms capture the effective average occurrence of the EPs involved in modeling either of the amino acids at the site. Function max represents the intuition that if one amino acid is well represented in TERM statistics while the other is poorly represented, then there is sufficient evidence to predict that the former should be preferred at the position. On the other hand, if both amino acids are poorly represented, then estimating an accurate difference would seem difficult. We divided the S2648 set into its four quartiles by ubiquity (distribution shown in Fig 5A) and analyzed performance separately in each quartile. As shown in Fig 5B, performance increased markedly and monotonically with ubiquity across these subsets, suggesting that sufficient relevant structural data are indeed critical for prediction accuracy.

thumbnail
Download:
Fig 5. Abundance of structural information is critical to performance of prediction.

(A) The distribution of ubiquity for mutations in the S2648 set. Quartile boundaries are labeled as dashed lines. (B) Performance of prediction on the four subgroups, from low ubiquity (group 1) to high ubiquity (group 4). The same representation is used here as in Fig 2.

https://doi.org/10.1371/journal.pone.0178272.g005

Given the above, we should expect the performance of our predictions to increase as the amount of data in the PDB grows. To test this idea, we randomly subsampled the non-redundant PDB subset used throughout this study to 10%, 30%, 50%, 70% and 90% of its size, and re-ran the same prediction procedure as described above each time. To truly simulate a smaller PDB, we also re-derived the contact potential (i.e., default values for pEPs) for each subsampled subset. Once again, the performance on S2648 increased monotonically with growing database size (Fig 6). Note, that similar trends were observed with different λ values (50 and 1000), so the increase is not merely an artifact under a specific strength of regularization.

thumbnail
Download:
Fig 6. Prediction performance increases with the size of the structural database.

The model represented by each curve is indicated in the legend. For each level of subsampling, three samples were generated, with error bars showing the standard deviations among the three trials for each experiment. The functional form used in fitting is shown in the upper-left corner. The numbers on the right side of each curve indicate the corresponding best-fit plateau values (i.e., parameter a).

https://doi.org/10.1371/journal.pone.0178272.g006

One can ask whether the increasing performance is mainly due to better ensemble statistics or a better contact potential (i.e., better default pEPs). To discriminate between these two possibilities, we also considered the ConPot and TERM-ΔΔGx models (contact potential only and zero prior on EP values, respectively, as defined previously) for each structural subset. This revealed that better ensemble statistics were the primary driving force for performance improvements with larger structural subsets, whereas even 30% of structural data produced a contact potential that performed roughly as well as that from the entire database (Fig 6).

It is tempting to use the relationship between database size and prediction accuracy to extrapolate what performance one might expect as the PDB continues to grow. We observed that this relationship is well described by the Hill equation, and thus used this functional form to perform extrapolations (see Materials and methods). As shown in Fig 6, extrapolated performances suggest that TERM-based statistics will become more useful as structural data continue to accumulate. Models that involve weak regularization (λ = 50) are predicted to eventually outperform all those with strong regularization (λ = 1000), suggesting that it will become increasingly advantageous to use sequence statistics from explicitly-defined structural environments (i.e., TERMs and sub-TERMs) rather than “mean-field” statistics of simple geometric descriptors. Interestingly, the value of the best-fit plateau parameter from the Hill equation is near unity for models with weak regularization (i.e., perfect performance in the limit of infinite data), but not those with strong regularization. Fig 6 also shows that the performance of ConPot has already saturated, suggesting that contact potentials will not improve with more data. And whereas using ConPot values as priors helps for now (e.g., compare TERM-ΔΔG2, λ = 50 and TERM-ΔΔGx, λ = 50), their impact is predicted to diminish with database size. Whether these extrapolations are borne out in the future remains to be seen. Nevertheless, it is interesting that current trends point towards TERM-based mining of sequence-structure becoming increasingly useful.

Discussion

The primary goal of this study is to test the hypothesis that PDB-derived sequence statistics of tertiary structural motifs reflect fundamental sequence-structure relationships. We examine this idea by considering the problem of predicting ΔΔGm based solely on sequence preferences of sub-structures surrounding the mutated position. Instead of describing sequence propensities associated with elementary structural descriptors like distances or angles, as in traditional statistical potentials, we extract sequence statistics directly from explicit, complex structural units—TERMs and sub-TERMs. This has the potential benefit of inherently representing correlations between elementary features, taking advantage of the modular nature of protein structure space.

The significant correlation between TERM-derived and experimentally-determined ΔΔGm clearly supports our central hypothesis, demonstrating that TERMs can indeed be seen as encoding rules of sequence-structure compatibility. Further, the performance of TERM-based ΔΔGm itself is noteworthy, as it is on par with or exceeds that of alternative approaches. The current state-of-the-art in this problem is represented by statistical or machine-learning methods, which combine a variety of structural descriptors and train on existing thermodynamic mutational data. In contrast, the TERM-based approach does not involve training and simply rests on the assumption of the relevance and correctness of TERM sequence statistics. If TERM statistics were too noisy, strongly affected by database biases, or simply captured irrelevant effects, the prediction would work poorly. In this sense, the fact that the method is competitive with alternatives tuned for the task clearly validates PDB-derived tertiary structural statistics as a novel quantitative metric, which although not devoid of biases, should nevertheless be useful in practice with broad applicability.

Methods for ΔΔGm prediction have generally relied on the ProTherm database for training/testing. An invaluable large compendium of protein thermodynamic data, the database nevertheless represents a biased set of mutations, strongly skewed towards those more frequently attempted in standard biophysical analyses (e.g., mutations to Ala). This appears to have affected the generality of some previously-developed statistical methods (see Table 3). For example, the mCSM and STRUM approaches [41, 42] perform far better than any other tested method on the S350 subset from ProTherm (an “industry standard” training set), reaching an impressive R of 0.7 and 0.79, respectively, but far underperform relative to other models on the unbiased S699 set, with an R of 0.39 and 0.42, respectively. In contrast, the performance of the TERM-based approach is nearly identical on both sets. Interestingly, the decrease in performance from S350 to S699 is considerably smaller for PoPMuSiC2.0 [37]—another approach based on machine learning. We think this is because PoPMuSiC2.0, unlike the other two statistical methods tested here (mCSM and STRUM), uses statistical potential terms (e.g., torsion-angle and inter-residue distance potentials) among its descriptors. Because these are derived from a representative subset of the PDB, they are generalizable beyond any specific ΔΔGm training set.

Predicting ΔΔGm for mutations that increase side-chain bulk is known to be challenging [56], especially for physics-based models. It is difficult to differentiate between cases where the backbone rearranges to accommodate the mutation without affecting (or even improving) stability, relative to those where the additional bulk is incompatible with the folded ensemble and destabilizes the structure. Although explicit sampling of backbone degrees of freedom, e.g., as implemented in the Rosetta modeling suite [31], allows for the potential to recognize backbone relaxations upon mutation, it is unclear a priori which of the many possible sampling approaches and energy functions would work best for a given system [59]. Recently, Park et al. developed a new energy function in Rosetta, which showed better performance in a wide range of structure modeling applications, including ΔΔGm prediction [52]. The performance of this method on the unbiased S699 set is respectable (considering the difficulty of predicting ΔΔGm with explicit structural sampling), but does suggest that explicit modeling of backbone rearrangement remains a significant challenge (see Table 3). By representing the local environment around the mutation with structural ensembles, the TERM-based approach has the potential to implicitly account for backbone relaxation. On the other hand, the ensembles may also be too fuzzy and forgiving to recognize truly destabilizing perturbations. The fact that TERM-based predictions perform well in both stabilizing and destabilizing regimes (see Fig 4A) indicates that the former effect dominates over the latter, and that TERM match ensembles may be an effective means of recognizing the plasticity of the backbone.

Our analysis also revealed a clear association between prediction accuracy and the amount of available relevant structural data (see Fig 5). This enables our method to produce a metric of confidence (ubiquity, see Eq 8 and Fig 5A), along with the prediction itself, which is of clear utility in a practical setting. For example, in a bioengineering setting, if the goal is to improve the stability of a protein and two mutations have a similar predicted stabilizing ΔΔGm, knowing which result is likely to be more accurate can greatly aid in prioritizing experiments. The association between accuracy and the amount of available data also means that as the structural database continues to grow, we can expect our estimator to perform increasingly better. This effect can be clearly seen through subsampling the current structural database, enabling an extrapolation into the future to suggest how the performance may improve as the database continues to grow (Fig 6).

Beyond providing more TERM instances, the growing structural database will increasingly enable the consideration of more complex motifs. Our results indicate that tertiary motifs (i.e., sub-TERMs with two or more disjoint segments) are key to capturing correct sequence-structure relationships and achieving high ΔΔGm prediction performance. Inclusion of more complex multi-segment motifs generally improves performance, but appears to plateau after order-2 sub-TERMs (i.e., those with three segments). This is likely not because more complex TERMs are not important, but rather because their statistics become limiting. A larger structural database would enable more such motifs to be considered, such that future accuracy improvements may be larger than can be anticipated with a simple extrapolation. Further, some target proteins (or mutated positions) may be composed of more canonical structural patters, which would warrant inclusion of more complex motifs even now. Indeed, the average ubiquity of the S699 set is higher than that in S2648, and the “complete” model TERM-ΔΔG (which considers all possible sub-TERMs, provided they have sufficient statistics) exhibits marginally better prediction performance on this set than the standard TERM-ΔΔG2 model (see Fig 5 in S1 Text).

We have previously shown that protein structure space is highly modular at the level of TERMs, with as few as 652 motifs sufficient to describe over half of the structural universe at sub-Angstrom resolution [20]. Together with the fundings in the present study, tying TERM sequence statistics to thermodynamic determinants of structure, this suggests that the apparent modularity of structure space may be due to the limited number of stable local structural environments that are available in the context of naturally occurring amino acids.

Conclusion

Stability is a filter in the evolution of proteins, so sequence statistics associated with any structural motif, large or small, must at least be consistent with thermodynamic principles. On the other hand, many other considerations bias the choice of sequence through evolution (e.g., function). Further, the portion of the protein structural universe that is available to us is biased by many factors, including limitations of structure determination. We set out to investigate whether sequence propensities emergent from structural matches to local tertiary motifs, TERMs, could be seen as encoding fundamental sequence-structure relationships or whether the various biases and limited statistics would make these ineffective in practice. The task of predicting ΔΔGm is ideal for resolving this question. This is a challenging problem, as illustrated by the limited performance of even the best methods, so serendipitously good correlations on large datasets are extremely unlikely. The strong performance of TERM statistics in predicting ΔΔGm implicate thermodynamic principles as a major driving force behind TERM formation and their sequence preferences. In our view, this finding has both fundamental implications towards our understanding of the modularity in the protein structural universe, and applied implications for statistics-based modeling of protein energetics. Statistical potentials have made tremendous impact towards protein modeling, and our results suggest that a new kind of statistics-based model of protein sequence-structure relationships may be possible—one based on localized sequence models describing the preferences of individual complex structural motifs comprising a protein in question.

Materials and methods

Contact degree

The metric of contact degree between two positions, introduced in our earlier studies [20, 46], was computed as follows: (9) where i and j are the two positions, Ri(a) is a set of side-chain rotamers of amino acid a at position i (after discarding rotamers that clash with the backbone), Iij(ri, rj) is a binary variable indicating whether the two rotamers ri and rj would likely strongly influence each other’s presence (have non-hydrogen atom pairs within 3 Å), Pr(a) is the frequency of amino acid a in the structural database (see Table 1 in S1 Text), and p(ri) is the probability of rotamer ri. Rotamers and their probabilities were taken from the backbone dependent library developed by Dunbrack and coworkers [60]. Positions i and j were said to be poised to interact (i.e., their amino-acid choices were expected to be strongly inter-dependent) if c(i, j) exceeded 0.02.

Structural ensembles and redundancy removal

Matching ensembles for each motif were obtained by using MASTER [47] to search structure fragments in a curated list of 16,967 non-redundant PDB chains from X-ray structures with resolution of 2.5 Å or better [46], in which the sequence identity between any two chains was under 30%, and peptide chains (those with fewer than 30 residues) were excluded. The search was performed by full-backbone RMSD, with the cutoff chosen automatically, as reported previously [20], based on the complexity of the query motif (see S1 Text).

To ensure that our results reflected purely structure-based principles and not homology relationships, TERM match ensembles were post-processed to remove matches from proteins that appeared to share even remote homology, locally or over the entire chain, to the protein under study (i.e., the protein whose mutations were being estimated). Specifically, the chain sequence of the studied protein was searched against the PDB using the BLASTpgp program in BLAST2.26 [61], and proteins giving rise to any alignments with an E-value below 1.0 were defined as homologous and marked for removal from the match ensemble. This effectively removed homology to the studied protein, but did not deal with the redundancy of the structural database. Although we were already dealing with a redundancy-pruned subset of the PDB (see above), redundancy on the local level was still possible. To address this, we extracted the local sequence around the seed residue of every match in the ensemble of a given TERM, taking 15 positions on each side of the seed position or a 31-residue window. We then used the program Usearch [62] to efficiently cluster these 31-mer sequences at 40% sequence identity, keeping only a single match from within each resulting cluster (the one with the lowest RMSD to the query). The clustering was performed with the following command:

usearch8.0 –cluster_fast in_file –id 0.4 –centroids out_file –fulldp –query_cov 1 –target_cov 1 –maxgaps 0

where in_file included one-letter amino-acid sequences of all the 31-aa windows (one per line) and out_file contained the clustering results.

Contact potentials

All contacting residue pairs from our non-redundant PDB subset (i.e., pairs with contact degrees above 0.02) were collected and further sub-divided into 5 bins by contact degree: [0.02, 0.05), [0.05, 0.1), [0.1, 0.2), [0.2, 0.5), [0.5, 1]. Within each bin, we calculated the statistical potential fo interaction between amino acids a and b as follows: (10) where Nobs(a, b) and Nexp(a, b) are the observed and expected number of occurrences of the amino-acid pair in the bin, respectively. Whereas Nobs(a, b) is simply given y the data, appropriately evaluating Nexp(a, b) is critical for a statistical potential. A naive approach is simply multiplying the background frequencies of a and b by the total number of contacts in each bin. However, it has been shown that this approach erroneously evaluated the magnitudes of inter-residue forces [50]. For example, due to the closely packed nature of protein interiors, many pairs of hydrophobic residues in proximity are merely “by-standers” of “real” attractive interactions (much fewer in number). Therefore, the burial state of residue pairs needs to be considered to properly estimate the background expectations.

To this end, we introduced a sequence-independent metric of residue burial, called freedom, which ranges from 0 to 1 and describes the fraction of rotamers of all amino acids at a given position that can be accommodated (without clashes) in the context of the backbone alone (see S1 Text for details). This metric effectively captures the amount of free space available around a given residue that is relevant for placing side-chains. We computed freedom for all residues in our structural database, dividing them into 70 equally-spaced freedom bins to compute amino-acid freedom propensities. Given this, the expected number of amino-acid pair a, b in a given contact-degree bin was computed as: (11) where is the total number of contacts found in the bin, ki ad li are the two positions forming the i-th contact, respectively, P(a|Fki) is the probability of observing a at position ki given the freedom bin corresponding to the freedom value of position ki (Fki). I [a = b] is a binary indicator variable, which evaluates to unity if a and b are the same amino acid and to zero otherwise. This is needed because the terms under the sum in Eq 11, which compute the expectation of observing the amino-acid pair a, b at a given pair of positions, account for both occurrences of a, b and b, a, which overcounts by a factor of two if a and b are the same.

Extraction of energy parameters

With our automated RMSD cutoff function (see S1 Text), the predominant majority of MASTER searches (92.5% of those for S2648 with model TERM-ΔΔG, see Fig 1 in S1 Text) returned fewer than 20,000 matches. Thus, to reduce computational cost, for larger match ensembles, only the top 20,000 matches were kept in the stage of EP extraction. The objective function in Eq 7 was minimized in MATLAB, using the function fminsearch in the Optimization Toolbox, which implements a Nelder-Mead simplex search algorithm. To speed up the optimization, EPs were subdivided into 1 + |C| groups, each containing either 20 sEPs or 400 pEPs for one of the |C| contacts, with optimization performed sequentially for each EP group. During optimization for one group, the EPs in other groups were held fixed. One cycle of optimization involved visiting each group once, and this was repeated until either 1) the improvement of objective function between consecutive cycles was smaller than 10−5 or 2) the l2-norms of EP value differences between adjacent cycles were smaller than 0.01 for all groups.

Performance metrics

Pearson (R) and Spearman (ρ) correlation coefficients were calculated with standard formulas. The RMSE was computed by first performing a linear regression using predicted and experimental values as the independent and dependent variables, respectively, and then computing the root mean squared deviation between the experimental values and the optimally-transformed predicted ones.

In each test, we report R, ρ, and RMSE for the entire dataset as well as after removal of most outlying 10% of the points. Outliers were removed iteratively in a greedy fashion, by finding the point that most improves the corresponding metric at each iteration and removing it.

Calculating ΔΔGfit from the GB1 fitness landscape

Sun and co-workers used an mRNA display technique in combination with deep sequencing to characterize the relative binding efficiency of all single and and nearly all double mutants of IgG-binding domain of protein G (GB1) to IgG-Fc [55]. To this end, the frequency of each variant i was measured before and after one generation of affinity enrichment, defining the fitness score of the variant, Wi, relative to wild type as: (12) where Ni,input and Ni, selected are the raw sequence counts of variant i before and after enrichment, respectively, and Nwt,selected and Nwt,input are the same for the wild type, respectively. The authors showed that these data enable one to quantitatively estimate the of a given mutant B via the formula [45, 55]: (13) where A was a reference mutation and WAB the fitness of the A, B double mutant, showing their estimates to be highly correlated (R > 0.9 for 82 mutations) with biophysically-measured stability changes. As discussed in detail by the authors [45], the optimal reference mutation is that, which exhausts the stability margin of the protein, such that any further change in stability could be accurately estimated based on fitness changes. For the specific choice of GB1, Sun and co-workers found five such reference mutations (Y3A, Y3C, L5N, L5S, F30N) and we used all five in our analysis. Taking the raw counts from the original study [55], we computed the above estimate for all substitutions (for which there were data) using all five reference mutations, and further applied several quality filters. An estimate was discarded if 1) WB ≤ WAB, as this violated an implicit assumption behind deriving Eq 13, 2) NAB, input < 90, to remove noise from low sequencing counts (this exclude ∼ 10% of double mutants with the lowest sequencing counts), or 3) WB < 0.24, since Olson et. al observed that were most accurate when substitution B had sufficient fitness to give the dynamic range for estimating (WB − WAB)/WAB. After applying all of the filters, an estimate based on at least one background mutation survived for 699 mutations, with the final for each taken to be the average over all available background mutations.

Performance as a function of database size

To subsample our structural database, we randomly chose 10%, 30%, 50%, 70%, or 90% of the chains comprising the initial non-redundant database. Each level of subsampling was independently repeated 3 times. To test a given subsample, the same procedures as elsewhere were employed for structural searching, data collection and pruning (i.e., for redundancy and homology), and extraction of energy parameters, but using a reduced database. For models involving the contact potential as a prior, the potential was re-calculated from the reduced set of contacts corresponding to subsampled database.

The relationship between database size and and the Pearson correlation coefficient (see Fig 6) was fit to the Hill equation, a ⋅ xn/(xn + Kn), where x is the fraction of subsampling, a is the maximal attainable performance value, n is the Hill coefficient, and K is the database size at which half the maximal attainable performance is expected. Fitting was performed using the function fit in MATLAB. Adjustable parameters (i.e., a, n, and K) were constrained to be non-negative and a was constrained not to exceed 1 (maximal possible R value) by adjusting the fitting function to be min(|a|, 1) ⋅ x|n|/(x|n| + |K||n|) and interpreting optimal parameters accordingly. A total of 100 fittings were attempted for each curve, starting with random parameters, and the values giving the lowest sum squared error were reported. Repetition of this procedure produced in very similar values, suggesting that the fitting was robust.

Code availability

Code and running instruction for performing TERM-based prediction of ΔΔGm can be found at http://grigoryanlab.org/terms/.

Supporting information

S1 Text. Supplementary Methods, Supplementary Figures 1-5, Supplementary Table 1.

https://doi.org/10.1371/journal.pone.0178272.s001

(PDF)

S1 Data. A spreadsheet containing predictions of model TERM-ΔΔG2 the S350 and the S699 mutation sets.

https://doi.org/10.1371/journal.pone.0178272.s002

(XLSX)

Author Contributions

  1. Conceptualization: FZ GG.
  2. Data curation: FZ GG.
  3. Formal analysis: FZ GG.
  4. Funding acquisition: GG.
  5. Investigation: FZ GG.
  6. Methodology: FZ GG.
  7. Project administration: GG.
  8. Software: FZ.
  9. Supervision: GG.
  10. Validation: FZ GG.
  11. Visualization: FZ GG.
  12. Writing – original draft: FZ GG.
  13. Writing – review & editing: FZ GG.

References

  1. 1. Christ CD, Mark AE, Van Gunsteren WF. Basic ingredients of free energy calculations: a review. Journal of computational chemistry. 2010;31(8):1569–1582. pmid:20033914
  2. 2. Woo HJ, Roux B. Calculation of absolute protein-ligand binding free energy from computer simulations. Proc Natl Acad Sci U S A. 2005 May;102(19):6825–30. pmid:15867154
  3. 3. Grigoryan G. Absolute free energies of biomolecules from unperturbed ensembles. Journal of computational chemistry. 2013;34(31):2726–2741. pmid:24132787
  4. 4. Skolnick J. In quest of an empirical potential for protein structure prediction. Current opinion in structural biology. 2006;16(2):166–171. pmid:16524716
  5. 5. Li Z, Yang Y, Zhan J, Dai L, Zhou Y. Energy Functions in De Novo Protein Design: Current Challenges and Future Prospects. Annual Review of Biophysics. 2013 may;42(1):315–335. pmid:23451890
  6. 6. Lazaridis T, Karplus M. Effective energy functions for protein structure prediction. Curr Opin Struct Biol. 2000 Apr;10(2):139–45. pmid:10753811
  7. 7. Boas FE, Harbury PB. Potential energy functions for protein design. Current opinion in structural biology. 2007;17(2):199–204. pmid:17387014
  8. 8. Shapovalov MV, Dunbrack RL. A smoothed backbone-dependent rotamer library for proteins derived from adaptive kernel density estimates and regressions. Structure. 2011;19(6):844–858. pmid:21645855
  9. 9. Zhou H, Zhou Y. Distance-scaled, finite ideal-gas reference state improves structure-derived potentials of mean force for structure selection and stability prediction. Protein Sci. 2002 Nov;11(11):2714–26. pmid:12381853
  10. 10. Betancourt MR, Skolnick J. Local propensities and statistical potentials of backbone dihedral angles in proteins. Journal of molecular biology. 2004;342(2):635–649. pmid:15327961
  11. 11. Kortemme T, Morozov AV, Baker D. An orientation-dependent hydrogen bonding potential improves prediction of specificity and structure for proteins and protein–protein complexes. Journal of molecular biology. 2003;326(4):1239–1259. pmid:12589766
  12. 12. Chakravarty S, Varadarajan R. Residue depth: a novel parameter for the analysis of protein structure and stability. Structure. 1999;7(7):723–732. pmid:10425675
  13. 13. Miyazawa S, Jernigan RL. Residue–residue potentials with a favorable contact pair term and an unfavorable high packing density term, for simulation and threading. Journal of molecular biology. 1996;256(3):623–644. pmid:8604144
  14. 14. Yuan C, Chen H, Kihara D. Effective inter-residue contact definitions for accurate protein fold recognition. BMC bioinformatics. 2012;13(1):1. pmid:23140471
  15. 15. Topham CM, Srinivasan N, Blundell TL. Prediction of the stability of protein mutants based on structural environment-dependent amino acid substitution and propensity tables. Protein Engineering. 1997;10(1):7–21. pmid:9051729
  16. 16. Shen My, Sali A. Statistical potential for assessment and prediction of protein structures. Protein science. 2006;15(11):2507–2524. pmid:17075131
  17. 17. Zhang J, Zhang Y. A novel side-chain orientation dependent potential derived from random-walk reference state for protein fold selection and structure prediction. PloS one. 2010;5(10):e15386. pmid:21060880
  18. 18. Zhou H, Skolnick J. GOAP: a generalized orientation-dependent, all-atom statistical potential for protein structure prediction. Biophysical journal. 2011;101(8):2043–2052. pmid:22004759
  19. 19. Kmiecik S, Gront D, Kolinski M, Wieteska L, Dawid AE, Kolinski A. Coarse-grained protein models and their applications. Chemical Reviews. 2016;116(14):7898–7936. pmid:27333362
  20. 20. Mackenzie CO, Zhou J, Grigoryan G. Tertiary alphabet for the observable protein structural universe. Proc Natl Acad Sci U S A. 2016 Nov;.
  21. 21. Feng X, Barth P. A topological and conformational stability alphabet for multipass membrane proteins. Nat Chem Biol. 2016 Mar;12(3):167–73. pmid:26780406
  22. 22. Zhang SQ, Kulp DW, Schramm CA, Mravic M, Samish I, DeGrado WF. The membrane-and soluble-protein helix-helix interactome: similar geometry via different interactions. Structure. 2015;23(3):527–541. pmid:25703378
  23. 23. Verschueren E, Vanhee P, Rousseau F, Schymkowitz J, Serrano L. Protein-peptide complex prediction through fragment interaction patterns. Structure. 2013;21(5):789–797. pmid:23583037
  24. 24. Vanhee P, Verschueren E, Baeten L, Stricher F, Serrano L, Rousseau F, et al. BriX: a database of protein building blocks for structural analysis, modeling and design. Nucleic Acids Res. 2011 Jan;39(Database issue):D435–42. pmid:20972210
  25. 25. Baeten L, Reumers J, Tur V, Stricher F, Lenaerts T, Serrano L, et al. Reconstruction of protein backbones from the BriX collection of canonical protein fragments. PLoS Comput Biol. 2008;4(5):e1000083. pmid:18483555
  26. 26. Grigoryan G, Degrado WF. Probing designability via a generalized model of helical bundle geometry. J Mol Biol. 2011 Jan;405(4):1079–100. pmid:20932976
  27. 27. Kolodny R, Koehl P, Guibas L, Levitt M. Small libraries of protein fragments model native protein structures accurately. Journal of molecular biology. 2002;323(2):297–307. pmid:12381322
  28. 28. Budowski-Tal I, Nov Y, Kolodny R. FragBag, an accurate representation of protein structure, retrieves structural neighbors from the entire PDB quickly and accurately. Proceedings of the National Academy of Sciences. 2010;107(8):3481–3486. pmid:20133727
  29. 29. Simons KT, Kooperberg C, Huang E, Baker D. Assembly of protein tertiary structures from fragments with similar local sequences using simulated annealing and Bayesian scoring functions. Journal of molecular biology. 1997;268(1):209–225. pmid:9149153
  30. 30. Das R, Baker D. Macromolecular modeling with rosetta. Annu Rev Biochem. 2008;77:363–82. pmid:18410248
  31. 31. Leaver-Fay A, Tyka M, Lewis SM, Lange OF, Thompson J, Jacak R, et al. ROSETTA3: an object-oriented software suite for the simulation and design of macromolecules. Methods in enzymology. 2011;487:545. pmid:21187238
  32. 32. Xu D, Zhang Y. Ab initio protein structure assembly using continuous structure fragments and optimized knowledge-based force field. Proteins: Structure, Function, and Bioinformatics. 2012;80(7):1715–1735. pmid:22411565
  33. 33. Yang J, Yan R, Roy A, Xu D, Poisson J, Zhang Y. The I-TASSER Suite: protein structure and function prediction. Nat Methods. 2015 Jan;12(1):7–8. pmid:25549265
  34. 34. Vallat B, Madrid-Aliste C, Fiser A. Modularity of Protein Folds as a Tool for Template-Free Modeling of Structures. PLoS computational biology. 2015 Aug;11(8):e1004419. pmid:26252221
  35. 35. Alva V, Söding J, Lupas A. A vocabulary of ancient peptides at the origin of folded proteins. eLife. 2015;4. pmid:26653858
  36. 36. Smock RG, Yadid I, Dym O, Clarke J, Tawfik DS. De Novo Evolutionary Emergence of a Symmetrical Protein Is Shaped by Folding Constraints. Cell. 2016 Jan;164(3):476–86. pmid:26806127
  37. 37. Dehouck Y, Grosfils A, Folch B, Gilis D, Bogaerts P, Rooman M. Fast and accurate predictions of protein stability changes upon mutations using statistical potentials and neural networks: PoPMuSiC-2.0. Bioinformatics. 2009;25(19):2537–2543. pmid:19654118
  38. 38. Capriotti E, Fariselli P, Casadio R. I-Mutant2.0: predicting stability changes upon mutation from the protein sequence or structure. Nucleic Acids Res. 2005 Jul;33(Web Server issue):W306–10. pmid:15980478
  39. 39. Parthiban V, Gromiha MM, Schomburg D. CUPSAT: prediction of protein stability upon point mutations. Nucleic acids research. 2006;34(suppl 2):W239–W242. pmid:16845001
  40. 40. Masso M, Vaisman II. Accurate prediction of stability changes in protein mutants by combining machine learning with structure based computational mutagenesis. Bioinformatics. 2008 Sep;24(18):2002–9. pmid:18632749
  41. 41. Pires DEV, Ascher DB, Blundell TL. mCSM: predicting the effects of mutations in proteins using graph-based signatures. Bioinformatics. 2014 Feb;30(3):335–42. pmid:24281696
  42. 42. Quan L, Lv Q, Zhang Y. STRUM: structure-based prediction of protein stability changes upon single-point mutation. Bioinformatics. 2016;p. btw361. pmid:27318206
  43. 43. Potapov V, Cohen M, Schreiber G. Assessing computational methods for predicting protein stability upon mutation: good on average but not in the details. Protein Eng Des Sel. 2009 Sep;22(9):553–60. pmid:19561092
  44. 44. Khan S, Vihinen M. Performance of protein stability predictors. Hum Mutat. 2010 Jun;31(6):675–84. pmid:20232415
  45. 45. Wu NC, Olson CA, Sun R. High-throughput identification of protein mutant stability computed from a double mutant fitness landscape. Protein Sci. 2016 Feb;25(2):530–9. pmid:26540565
  46. 46. Zheng F, Zhang J, Grigoryan G. Tertiary structural propensities reveal fundamental sequence/structure relationships. Structure. 2015 May;23(5):961–71. pmid:25914055
  47. 47. Zhou J, Grigoryan G. Rapid search for tertiary fragments reveals protein sequence-structure relationships. Protein Sci. 2014 Nov; pmid:25420575
  48. 48. Echols N, Harrison P, Balasubramanian S, Luscombe NM, Bertone P, Zhang Z, et al. Comprehensive analysis of amino acid and nucleotide composition in eukaryotic genomes, comparing genes and pseudogenes. Nucleic acids research. 2002;30(11):2515–2523. pmid:12034841
  49. 49. Kumar MS, Bava KA, Gromiha MM, Prabakaran P, Kitajima K, Uedaira H, et al. ProTherm and ProNIT: thermodynamic databases for proteins and protein–nucleic acid interactions. Nucleic acids research. 2006;34(suppl 1):D204–D206. pmid:16381846
  50. 50. Thomas PD, Dill KA. Statistical potentials extracted from protein structures: how accurate are they? Journal of molecular biology. 1996;257(2):457–469. pmid:8609636
  51. 51. Mirny LA, Shakhnovich EI. How to derive a protein folding potential? A new approach to an old problem. Journal of molecular biology. 1996;264(5):1164–1179. pmid:9000638
  52. 52. Park H, Bradley P, Greisen P Jr, Liu Y, Mulligan VK, Kim DE, et al. Simultaneous Optimization of Biomolecular Energy Functions on Features from Small Molecules and Macromolecules. Journal of Chemical Theory and Computation. 2016;. pmid:27766851
  53. 53. Fowler DM, Fields S. Deep mutational scanning: a new style of protein science. Nat Methods. 2014 Aug;11(8):801–7. pmid:25075907
  54. 54. Araya CL, Fowler DM, Chen W, Muniez I, Kelly JW, Fields S. A fundamental protein property, thermodynamic stability, revealed solely from large-scale measurements of protein function. Proc Natl Acad Sci U S A. 2012 Oct;109(42):16858–63. pmid:23035249
  55. 55. Olson CA, Wu NC, Sun R. A comprehensive biophysical description of pairwise epistasis throughout an entire protein domain. Current Biology. 2014;24(22):2643–2651. pmid:25455030
  56. 56. Guerois R, Nielsen JE, Serrano L. Predicting changes in the stability of proteins and protein complexes: a study of more than 1000 mutations. J Mol Biol. 2002 Jul;320(2):369–87. pmid:12079393
  57. 57. Yin S, Ding F, Dokholyan NV. Eris: an automated estimator of protein stability. Nature methods. 2007;4(6):466–467. pmid:17538626
  58. 58. Benedix A, Becker CM, de Groot BL, Caflisch A, Böckmann RA. Predicting free energy changes using structural ensembles. Nature methods. 2009;6(1):3–4. pmid:19116609
  59. 59. Kellogg EH, Leaver-Fay A, Baker D. Role of conformational sampling in computing mutation-induced changes in protein structure and stability. Proteins. 2011 Mar;79(3):830–8. pmid:21287615
  60. 60. Shapovalov MV, Dunbrack RL Jr. A smoothed backbone-dependent rotamer library for proteins derived from adaptive kernel density estimates and regressions. Structure. 2011 Jun;19(6):844–58. pmid:21645855
  61. 61. Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ. Basic local alignment search tool. Journal of molecular biology. 1990;215(3):403–410. pmid:2231712
  62. 62. Edgar RC. Search and clustering orders of magnitude faster than BLAST. Bioinformatics. 2010 Oct;26(19):2460–1. pmid:20709691