Abstract
An automated protein structure prediction algorithm, pro-sp3-Threading/ASSEmbly/Refinement (TASSER), is described and benchmarked. Structural templates are identified using five different scoring functions derived from the previously developed threading methods PROSPECTOR_3 and SP3. Top templates identified by each scoring function are combined to derive contact and distant restraints for subsequent model refinement by short TASSER simulations. For Medium/Hard targets (those with moderate to poor quality templates and/or alignments), alternative template alignments are also generated by parametric alignment and the top models selected by TASSER-QA are included in the contact and distance restraint derivation. Then, multiple short TASSER simulations are used to generate an ensemble of full-length models. Subsequently, the top models are selected from the ensemble by TASSER-QA and used to derive TASSER contacts and distant restraints for another round of full TASSER refinement. The final models are selected from both rounds of TASSER simulations by TASSER-QA. We compare pro-sp3-TASSER with our previously developed MetaTASSER method (enhanced with chunk-TASSER for Medium/Hard targets) on a representative test data set of 723 proteins <250 residues in length. For the 348 proteins classified as easy targets (those templates with good alignments and global structure similarity to the target), the cumulative TM-score of the best of top five models by pro-sp3-TASSER shows a 2.1% improvement over MetaTASSER. For the 155/220 medium/hard targets, the improvements in TM-score are 2.8% and 2.2%, respectively. All improvements are statistically significant. More importantly, the number of foldable targets (those having models whose TM-score to native >0.4 in the top five clusters) increases from 472 to 497 for all targets, and the relative increases for medium and hard targets are 10% and 15%, respectively. A server that implements the above algorithm is available at http://cssb.biology.gatech.edu/skolnick/webservice/pro-sp3-TASSER/. The source code is also available upon request.
Introduction
Although the past few years have seen slow and continuous progress, the protein structure prediction problem remains a long-standing unsolved problem in structural biology (1,2). In general, protein structure prediction approaches can be classified into template-based and template-free. To date, template-based approaches are still the only reliable method for protein structure prediction (1,2). Template-based methods generally involve template identification, alignment of the target sequence to the template, and model refinement from this initial alignment. Advances can be seen in better template identification and sequence-to-structure alignment by going from single sequence alignments to profile alignments (3–11), by inclusion of multiple structural properties such as predicted secondary structures (12–14), solvent accessibility (15,16), and structure profiles (17–24); by coupling alignment with quality assessment (25); machine learning (26,27), and meta-servers (28–30). Better model refinement can be achieved by using multiple templates and multiple template alignments (31–33), iterative refinement (34–36), as well as physics and evolution-based potentials (33,37,38).
Although not as reliable as template-based approaches, template-free or ab initio approaches have had significant advances (36,37,39–45). These methods can occasionally provide very good models for targets where no related proteins in the template library can be identified. There are studies which show that the current solved structural library Protein Data Bank (PDB) (46) could provide reasonable quality templates for all compact single domain proteins (47–49). Despite the progress made by many efforts, there are still ∼1/3 of proteins that are weakly homologous to proteins in the PDB for which appropriate templates cannot be identified (1,2). Therefore, in practice, there are two ways to solve the protein structure prediction problem: improving the reliability of ab initio predictions and/or the sensitivity of template identification. The protein structure prediction method TASSER (Threading/ASSEmbly/Refinement) (50) and its updated version chunk-TASSER (44) for medium/hard targets have achieved a reasonable level of success in both template-based and template-free modeling for targets that are weakly homologous to template proteins (50,51). Their performance depends strongly on the energy functions that are partly derived from the input structures. The input structures can be models built directly from target-template alignments, or models generated by other methods, and ab initio folded chunk structures in the case of chunk-TASSER. One way to improve the energy functions is to improve the predicted contact potentials as in iterative TASSER (35) and TASSER 2.0(52). The other way to improve the accuracy of TASSER model is to use more accurate input structures as in MetaTASSER (51) which uses the 3D-jury algorithm (28) to select input models from three state-of-the-art threading methods.
In this study, our goal is to improve protein structure prediction accuracy by improving the accuracy of the models that are inputted into TASSER or chunk-TASSER. The accuracy of the input models depends on the quality of the identified templates and the associated target-template alignments as generated by threading methods. In this spirit, we have developed what to our knowledge is a new in-house metathreading method that consists of five individual threading algorithms and alternative alignment procedures that employ a parametric alignment approach. We then use short TASSER or chunk-TASSER to build models from threading templates and subsequently select possibly better models by a model quality assessment method. This procedure can be considered as iterative metathreading with the first round selecting models from five individual threading methods and the second round selecting models from short TASSER or chunk-TASSER predicted models. The selected models are then refined by full TASSER or chunk-TASSER simulations. On a benchmark set of 723 targets, we show that the method developed here shows considerable improvement over our previously developed MetaTASSER algorithm (51) in terms of the number of foldable targets and on average a 2–3% improvement in TM-score (53).
Methods
Employing the TASSER and chunk-TASSER (33,44,50,51), the model quality assessment method TASSER-QA (54), and the threading methods, PROSPECTOR_3 (55) and SP3(24), we have developed the pro-sp3-TASSER algorithm that combines some of the above-mentioned successful approaches such as meta-servers, coupling alignment with quality assessment, and iterative refinement. The overall pro-sp3-TASSER procedure is described by the flowchart shown in Fig. 1 A and has three main steps: a), threading and alignment by PRO-SP3 (described below); b), generation of an ensemble of models by short TASSER simulations; and c), selection of models by TASSER-QA, followed by full TASSER refinement and final model selection. In addition to the SP3 threading method, we derived four other threading methods by modifying and combining some of the score components in SP3 and PROSPECTOR_3. Combination of these threading methods provides consensus information from individual threading/fold-recognition approaches to improve the quality of template identification and alignment accuracy, especially for medium/hard targets (those with poor quality template identification/alignments). Additional alternative target sequence to template alignments are generated by a parametric alignment method where top quality alignments are selected by TASSER-QA for medium/hard targets. Subsequently, limited short time TASSER refinement is applied to generate an ensemble of full-length models. For medium/hard targets, chunk-TASSER (44) refinement, which uses ab initio folded supersecondary structure chunks of a given target, was also used instead of the original TASSER algorithm. The structure ensemble consists of up to 155 models and provides a diverse quality of models. We then select top 20 models from the ensemble using TASSER-QA. A second round of full TASSER refinement was applied on the selected full-length models and final models were selected from both rounds of TASSER or chunk-TASSER refinements.
Figure 1.

(A) Flowchart of pro-sp3-TASSER. (B) Detailed flowchart of model ensemble generation.
Target difficulty is classified by the Z-score of the top template in SP3 threading (part of PRO-SP3). Targets whose top template has a Z-score ≥6.0 are classified as easy, those with a Z-score ≤ 4.5 as hard, and those having a 4.5 < Z-score < 6.0 as medium targets, respectively. Special attention is paid to possible multiple domain targets. This is done by first checking the coverage of the top template identified by SP3. If more than 50 continuous residues are unaligned in the top scoring template, in additional to modeling the full-length target sequence, the unaligned and aligned regions are modeled separately. The separately modeled possible domains are then superimposed onto the full-length models in the second round of TASSER refinement. Another special case is that when a single template ranked top by SP3 score has a Z-score more than 2.0 units larger than the rank two template or if it has sequence identity to the target of more than 50% (single template dominates), then we only use the single, top scoring template in the subsequent modeling procedure.
PRO-SP3 threading for template identification and sequence-to-structure alignment
The PRO-SP3 threading algorithm consists of five threading scores that align the target sequence to templates and then ranks the templates independently. These scores are taken directly or modified from SP3 (24) and PROSPECTOR_3 (55). The first score is taken directly from SP3 (24) and combines sequence profiles from sequence and structural alignments:
| (1) |
where is the sequence-derived frequency profile of the target sequence, is the sequence-based log odds profile (position-specific substitution matrix as in PSIPRED (56)) of the template, is the structure-derived probability profile of the template (24), is the sequence-derived, log odds profile of the target sequence, Sshift is a constant shift factor, wstruc and w2ndary are weight parameters for the structure-derived sequence profiles and secondary structure profiles respectively, and is a simple function of the secondary structure element si of the target at sequence position i and sj of the template at sequence position j:
| (2) |
Notice that the secondary structure of the target sequence is predicted by PSIPRED (56) using the same position-specific substitution matrix (PSSM), . In the latest version of SP3, is replaced by the average of two profiles with PSIBLAST e-value cutoffs 0.001 and 1.0, and is the average of the original and the PSIBLAST profile with e-value cutoff 0.001; i.e., , and .
These modifications are designed to increase the alignment accuracy of medium/hard targets. With the gap opening and extension parameters (w0, w1), there are total of five parameters which were determined by optimizing alignment accuracy against the ProSup data set (57). The parameters were reoptimized after the profile replacements mentioned above and the new solution (w0, w1, w2ndary, wstruc, Sshift) is (3.5, 0.1, −1.50, 0.5, 0.7). The new optimized set of weights gave a one-to-one match alignment accuracy of 66.1% against the ProSup structure alignment benchmark (57) compared to the original accuracy of 65.3%.
Scores 2–5 are modified from PROSPECTOR_3 by incorporating the structure-derived profiles from SP3 into PROSPECTOR_3. This is done because structure-derived profiles help increase the template identification sensitivity (16,24). The scoring functions given below are different combinations of sequence profiles and structure-derived profiles beyond the SP3 approach. At the same time, they take into account the well characterized PROSPECTOR_3 (55) pair potentials.
| (3) |
| (4) |
| (5) |
| (6) |
Here, is the position-specific substitution matrix transformed from the original structure-derived probability profile by PSIBLAST utility programs (5). , , , are secondary structure profile weights and constant shift factors. , are pair potential terms that are constructed at stage m = 2 and m = 4 of PROSPECTOR_3 (55), respectively. All the weight and shift factors and gap penalties for dynamic alignment (58) are taken directly from PROSPECTOR_3 without further optimization because Eqs. 3–6 are similar to the corresponding ones in PROSPECTOR_3. Even so, our results show that PRO-SP3 threading is already better than the consensus from the three state-of-the–art method PROSPECTOR_3, SP3 and SPARKS for medium/hard targets (see Table 2).
Table 2.
Comparison between MetaTASSER and pro-sp3-TASSER of the cumulative TM-scores of the best of top five templates or models that are inputs into TASSER
| Target set (No. of targets) | MetaTASSER Threading | PRO-SP3 Threading | TASSER-QA selected |
|---|---|---|---|
| Easy (348) | 238.1 | 238.1 | 247.4 |
| Medium (155) | 52.4 | 55.5 | 62.1 |
| Hard (220) | 67.7 | 70.8 | 84.7 |
| All (723) | 358.2 | 364.4 | 394.2 |
Given a target sequence and a template structure, the threading approaches developed here may not be good enough to provide the best sequence-to-structure alignment for medium/hard targets. To remedy this shortcoming, we apply a parametric alignment method (25,59) to generate an ensemble of alignments and use TASSER-QA to select the “best” alignments. We perform this procedure by gridding the parameter space (w0, w1, w2ndary, wstruct, Sshift) of the score S1(i, j) in Eq.1, where (w0, w1) are gap penalties. Each parameter is sampled with 0.0, 0.5, 1.0, 1.5, and 2.0 times the original values except for the gap opening penalty, w0, which is sampled with 0.5, 1.0, 1.5, 2.0, and 2.5 times the original value. Distinct alignments are ranked according to their coverage and the top 1000 alignments kept. We then apply the TASSER-QA algorithm to select the top alignment model from these 1000 alignments. We call this selected top alignment the alternative alignment of the corresponding template.
Generation of the structure ensemble by multiple short TASSER simulations
A detailed flowchart of the model ensemble generation procedure is shown in Fig. 1 B. To generate an ensemble of diverse quality models, we apply a short TASSER refinement procedure on various sets of templates identified independently by the five PRO-SP3 scores. Since the TASSER structure prediction method is described in detail in the literature (33,41,43,44,50,51,60), we merely present a brief overview of its essential components. Essential components of the TASSER force field are the set of side chain contact and the distance restraints derived from a set of input models. TASSER also requires a set of initial structures. Generally, the structures that provide the restraints and the starting conformations are the same. However, they can be different. For example, in chunk-TASSER (44), the set of structures used for deriving contact and distance restraints contains ab initio folded chunks in addition to threading templates, whereas the set for initial starting structures consists entirely of threading templates.
Since full TASSER modeling takes too long with large proteins, we use the same strategy that was employed in TASSER-lite (60) to limit the modeling procedure to short times (typically 10 hs) for all target sizes. The sets of template alignments used by TASSER or chunk-TASSER are:
a. Sets 1–5, each set consists of the top 10 template alignments from each of the five distinct threading approaches.
b. Set 6, the top two templates from each threading score, total of 10 templates.
c. Set 7, for medium/hard targets only, alternative alignments of the top two templates from each threading score, for total of 10 templates.
d. Set 8, the top four templates from each threading score, for a total of 20 templates.
e. Set 9, the top six templates from each threading score, for a total of thirty templates.
f. Set 10, the top 10 templates from each threading score, for a total of fifty templates.
g. Set 11, combined Set 6 and Set 7, for medium/hard targets only, for a total of 20 templates.
The differences between set d, e, and f are the number of templates from each threading score that are included. This can be used to explore the effects of different combinations and diversity of templates identified by the individual scoring functions.
We put the top five models from each short TASSER simulation into the structure ensemble. Each set provides from several to more than one hundred models depending on the scenario of TASSER simulation. TASSER uses modified replica-exchange Monte Carlo for sampling (61). Each replica needs an initial structure. There are two kinds of scenarios in the TASSER simulations based on how the initial structures are assigned to the replicas. For a scenario A simulation, each template in the input set is taken as the initial structure of one replica. For a scenario B simulation, only one template in the input set is used as initial structure for all replicas. Therefore, for an input set of N templates, by shifting the template for the initial structure, one can apply N different scenario B simulations and one scenario A simulation. The models from a scenario A simulation are usually close to the average structure of all the inputs, whereas those from scenario B are close to the particular template assigned to the replicas. Here, for medium/hard targets, we apply scenario A simulations on Sets 1–10, and scenario A and B simulations on Set 11. For easy targets, only scenario A and B simulations on Set 8 are applied. The procedure generates up to 155 models (cluster centroids) for medium/hard targets and 105 models for easy targets. For medium/hard targets, the above procedure generates an ensemble that have models close to the top 10 template alignments and the top two alternative template alignments of each threading scoring function. For easy targets, the ensemble contains models close to the top four template alignments from each threading scoring function. Therefore, the ensemble has more diverse models than a single threading method can provide.
Full TASSER refinement on selected models and final model selection
After the generation of the ensemble of full-length structures that consists of top five cluster centroids provided by SPICKER (62) from all short TASSER simulations, we select the top 20 possible best quality models from the ensemble by the TASSER-QA (54) quality assessment method. These are then used to derive TASSER contact and distance restraints and also serve as the starting structures for full TASSER or chunk-TASSER refinement. One single scenario A simulation is applied to each target, and SPICKER is used again to obtain the top five cluster centroid structures for subsequent final model selection. To increase the chance of getting good final models, we select final models from both ensembles generated by short TASSER refinement and by full TASSER refinement. For target of ∼100 residues, a full TASSER simulation takes ∼20 h, but the simulation time increases rapidly with the increase of target size (roughly proportional to the square of size). A full simulation for a 300 residue target will take ∼200 h.
Results
To test our algorithm, we compiled a set of 723 benchmark proteins (whole chains or domain) structures that are all <250 residues in length. The threading library is built from structures all released before the testing benchmark structures. The testing dataset is classified by their SP3 Z-score into 348 easy, 155 medium and 220 hard targets. The maximum sequence identity between target and library is 55%, and the average per target largest sequence identities between target and library for easy, medium and hard targets are 27%, 19%, and 18%, respectively. As mentioned in Wu et al. (16), comparison of methods is hard because of differences in the members of the template library. For example, if the library contains a close homolog, the results will be very different from the case where there is not even an analogous structure in the template library. Therefore, we compare pro-sp3-TASSER with our previous MetaTASSER algorithm that performed well in the CASP7 experiment (51). In CASP7 predictions by humans, the TASSER group results were based on the MetaTASSER server (51). Furthermore, the threading algorithms SP3, SPARKS2 and PROSPECTOR_3 that provide inputs into MetaTASSER are among the best nonmeta threading methods (50,55,63). Therefore, MetaTASSER represents one of the best automated structure prediction methods in the literature. Since chunk-TASSER (44) shows a significant improvement over original TASSER for medium/hard targets, for fair comparison, we update MetaTASSER with chunk-TASSER for medium/hard targets. The target's TM-score to the native structure is used as structure quality measure in our comparison (53).
Table 1 compares the performance of pro-sp3-TASSER and MetaTASSER in terms of the number of targets having models with TM-score to their native structures of >0.4 and cumulative TM-scores, along with two-sided p-values of Student's t-test that show the statistical significance of the differences (64). Pro-sp3-TASSER has ≥10% more foldable targets than MetaTASSER for medium/hard target categories. For the first models, pro-sp3-TASSER shows on average a 1.4% TM-score improvement (p-value = 0.04) over MetaTASSER on the easy target set. In contrast, the improvements of TM-scores on medium/hard sets are not statistically significant (p-value = 0.55,0.15). For the best of top five models, pro-sp3-TASSER shows on average 2–3% improvements over MetaTASSER for all targets, with the improvements are statistically significant.
Table 1.
Comparison of pro-sp3-TASSER and MetaTASSER on the 723 protein benchmark set
| First model |
Best of top five |
|||||||
|---|---|---|---|---|---|---|---|---|
| Target set (No. of targets) | MetaTASSER | Pro-sp3-TASSER | MetaTASSER | pro-sp3-TASSER | ||||
| Easy (348) | 323 | 243.5 | 325 | 246.8(0.04) | 326 | 248.8 | 332 | 254.2(6.9×10−6) |
| Medium (155) | 60 | 58.7 | 62 | 59.2(0.55) | 68 | 62.7 | 75 | 64.6(0.04) |
| Hard (220) | 53 | 76.6 | 62 | 78.6(0.15) | 78 | 85.5 | 90 | 88.0(0.01) |
| All (723) | 436 | 378.8 | 449 | 384.6(0.01) | 472 | 397.0 | 497 | 406.8(6.3×10−8) |
Numbers in the first columns under each method are numbers of targets having first/best of top five models with TM-score to native >0.4. TM-score of 0.4 is a statistically significant threshold for structural similarity. The numbers in second columns are TM-scores. Numbers in parenthesis are two-sided p-values (64,65) between the two methods. A p-value of <0.05 is considered significant.
Although the percentage TM-score improvement is relatively small, it is a nontrivial achievement due to the fact that MetaTASSER plus chunk-TASSER is already a state-of-the-art method that performed well in CASP7 (51) and there are only a few methods that surpass it. The latest version of MetaTASSER has implemented some components of the methodology developed in this work, e.g., the special treatment for easy targets, selection of models from multiple TASSER simulations by TASSER-QA. However, it still does not match pro-sp3-TASSER's performance on medium/hard targets in the benchmark set. That indicates pro-sp3-TASSER is superior to MetaTASSER, particularly for medium/hard targets.
In Fig. 2, we show the target-to-target comparison of the two methods. Although, pro-sp3-TASSER does worse than MetaTASSER for certain targets, overall, pro-sp3-TASSER does better. The cases when pro-sp3-TASSER does worse are partly due to the failure to identify good templates. For example, for target 2ehp_A, although it is classified as easy target, only the SP3 score component of PRO-SP3 threading identifies the good template 1wqa_A, whereas in MetaTASSER, all three threading methods identify it. Another source of the poorer performance of pro-sp3-TASSER is that TASSER-QA fails to select good models. One such example is 2qwt_A. There are several models with TM-scores to native ∼0.75–0.80 in the ensemble after the first round of TASSER modeling, but the TM-scores of the selected models are ∼0.5–0.6. Therefore, the final best model by pro-sp3-TASSER only has a TM-score to native of 0.62, whereas the MetaTASSER model has a TM-score of 0.82. Fig. 3 shows the comparison of targets as a function of TM-score that demonstrate that pro-sp3-TASSER is better for all TM-score threshold cutoff values.
Figure 2.

Scatter plot comparison between PRO-SP3-TASSER and MetaTASSER on the 723 benchmark set. TM-scores are from the best of top five models.
Figure 3.

Histogram comparison between PRO-SP3-TASSER and MetaTASSER on the 723 benchmark set. TM-scores are from the best of top five models.
We next analyze the source of the improvement. In Table 2, the best of the top five templates or models that are inputs into TASSER are compared between MetaTASSER and pro-sp3-TASSER. Templates in MetaTASSER are ranked by the 3D-jury approach (28), whereas in the first round involving short TASSER simulations in pro-sp3-TASSER, the top five templates consist of the top one template from each threading score and in the second round involving the full TASSER simulation, they are ranked by TASSER-QA. For easy targets, PRO-SP3 threading and MetaTASSER threading results are comparable. However, after TASSER-QA selection, the input model quality is significantly better. This is partly due to the fact that the selected models are full-length, whereas template models have unaligned regions. It is also reflects the refinement in the short TASSER simulations and the ability of TASSER-QA to select the best quality models. For medium/hard targets, templates from PRO-SP3 threading are better overall than those from MetaTASSER threading. For a few targets, the TM-score of the best of top five model to native by MetaTASSER are ∼0.3 whereas they are >0.5 from pro-sp3-TASSER (see Fig. 2). For these targets, only a single good template is identified and because MetaTASSER includes an overwhelming number of poor templates even though there is a single good template in the ensemble, the resulting good quality structures are not in the selected final top five models. Pro-sp3-TASSER is able to retain the template model by the special treatment mentioned earlier. For example, target 2yyv_A, the first template identified by all three of the MetaTASSER's threading algorithms is 1vr0_A, with a TM-score to native target of 0.89. However, because of the fact that the overwhelming majority of templates are of poor quality, the TM-score of the final best of top five models by MetaTASSER is only 0.31, whereas by pro-sp3-TASSER, the TM-score is 0.93.
Another source of improvement is the better template identification by PRO-SP3 threading. One such example is 2uvp_A. In MetaTASSER, only the sixth template as ranked by SP3 threading has a TM-score of 0.49 to the native structure, whereas all other templates have TM-scores ∼0.2 to native. The preponderance of poor quality templates results in a TM-score of the final best model of 0.24. In pro-sp3-TASSER, there are five templates having TM-scores to native ranging from 0.44 to 0.64 and the final best TM-score is 0.62. An example that shows improvement by the TASSER-QA procedure in pro-sp3-TASSER is 2hz8_A, which is a 115 residue, four-helix bundle protein. The single best template from threading is 2b0h_A, which has a TM-score of 0.66 to native, is not ranked first by SP3; therefore there is no special treatment in pro-sp3-TASSER. The alternative alignment model of template 2b0h_A has a better quality TM-score of 0.70 to native. After the first round of short TASSER modeling, TASSER-QA selects models with TM-scores ranging from 0.77 to 0.86 in the top 10 models. The final best of top five models given by pro-sp3-TASSER has a TM-score to native of 0.84, whereas the best model by MetaTASSER has 0.51. Thus, the initial models are refined by TASSER, and are then improved on in a subsequent TASSER iteration.
By limiting the total modeling time to 72 h for the entire pro-sp3-TASSER procedure, we implemented an automated server at http://cssb.biology.gatech.edu/skolnick/webservice/pro-sp3-TASSER/ for public use. The source code for stand-alone installation is also available upon request. For target sizes of ∼100 residues, ∼30 h are needed for modeling. However, for a target size of 300 residues, pro-sp3-TASSER will take ∼200 h. Thus, the server is best suited for proteins <150 residues. For larger proteins, the limited time in the second round TASSER simulations may slightly degrade the final model quality.
Discussion
We have shown that pro-sp3-TASSER shows considerable improvement of foldability (number of foldable targets) for medium/hard targets and on average, a statistically significant, 2–3% TM-score improvement over our previous MetaTASSER approach enhanced by chunk-TASSER. Improvements come from better template identification as well as better alignments and enrichment of better initial models by TASSER-QA selection from the large structure ensemble generated by short TASSER modeling. However, there is still much room for further improvements in the current approach. Fig. 4 shows the comparison of the TM-scores of the best models in the ensemble of structures (that contains up to 155 individual structures) generated by first round of short TASSER modeling and those of the best of top five models selected from the ensemble by TASSER-QA before full TASSER simulations. For many targets, especially for targets with models having TM-scores <0.7, the TM-score gap between the best possible model and the best of top five selected models is quite large. For all targets, the cumulative TM-score of best models in the ensemble is 426.9 compared to 394.2 for the selected best of top five models. The cumulative TM-scores of best models for subsets of easy, medium and hard targets are 254.4, 72.7, and 99.9, respectively. The corresponding values of selected models are 247.4, 62.1, and 84.7, respectively. The percentages of differences are 2.8%, 17.1% and 17.9% for easy, medium, and hard targets, respectively. Therefore, by developing a better model selection algorithm, one can considerably increase prediction accuracy, especially for medium/hard targets. For example, the PRO-SP3-TASSER predicted best model for 2ip6_A has a TM-score to native of 0.68, although there are, in fact, two models in the ensemble generated by short TASSER simulations that have TM-scores of 0.89 and 0.88. These models are ranked around 60th by TASSER-QA and originated from an alternative alignment to template 2bl7_A (sequence identity 12%) with TM-score 0.73 (the SP3 alignment has a TM-score of 0.59). Like the template identification problem for medium/hard targets, model quality assessment and selection is nontrivial. One direction for better model assessment/selection method is to use an all-atom physics-based force field, an approach that is currently under investigation in our laboratory.
Figure 4.

Comparison of TM-scores of best models in the ensemble of structures (up to 155) generated by first round of short TASSER modeling and those of the best of top five models selected from the ensemble by TASSER-QA before full TASSER simulations.
Acknowledgments
This research was supported in part by grant Nos. GM-37408 and GM-48835 of the Division of General Medical Sciences of the National Institutes of Health.
References
- 1.Baker D., Sali A. Protein structure prediction and structural genomics. Science. 2001;294:93–96. doi: 10.1126/science.1065659. [DOI] [PubMed] [Google Scholar]
- 2.Skolnick J., Fetrow J., Kolinski A. Structural genomics and its importance for gene function analysis. Nat. Biotechnol. 2000;18:283–287. doi: 10.1038/73723. [DOI] [PubMed] [Google Scholar]
- 3.Karplus K., Barrett C., Hughey R. Hidden markov models for detecting remote protein homologies. Bioinformatics. 1998;14:846–856. doi: 10.1093/bioinformatics/14.10.846. [DOI] [PubMed] [Google Scholar]
- 4.Jones D.T., Taylor W.R., Thornton J.M. A new approach to protein fold recognition. Nature. 1992;358:86–89. doi: 10.1038/358086a0. [DOI] [PubMed] [Google Scholar]
- 5.Altschul S.F., Madden T.L., Schäffer A.A., Zhang J., Zhang Z. Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res. 1997;25:3389–3402. doi: 10.1093/nar/25.17.3389. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 6.Gribskov M., McLachlan A.D., Eisenberg D. Profile analysis: detection of distantly related proteins. Proc. Natl. Acad. Sci. USA. 1987;84:4355–4358. doi: 10.1073/pnas.84.13.4355. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 7.Jaroszewski L., Rychlewski L., Li W., Godzik A. Comparison of sequence profiles. Strategies for structural predictions using sequence information. Protein Sci. 2000;9:232–241. doi: 10.1110/ps.9.2.232. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 8.Jaroszewski L., Rychlewski L., Godzik A. Improving the quality of twilight-zone alignment. Protein Sci. 2000;9:1487–1496. doi: 10.1110/ps.9.8.1487. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 9.Yona G., Levitt M. Within the twilight zone: a sensitive profile-profile comparison tool based on information theory. J. Mol. Biol. 2002;315:1257–1275. doi: 10.1006/jmbi.2001.5293. [DOI] [PubMed] [Google Scholar]
- 10.Marti-Renom M.A., Madhusudhan M.S., Sali A. Alignment of protein sequences by their profiles. Protein Sci. 2004;13:1071–1087. doi: 10.1110/ps.03379804. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 11.Mittelman D., Sadreyev R., Grishin N. Probabilistic scoring measures for profile-profile comparison yield more accurate short seed alignments. Bioinformatics. 2003;19:1531–1539. doi: 10.1093/bioinformatics/btg185. [DOI] [PubMed] [Google Scholar]
- 12.Fischer D. Hybrid fold recognition: combining sequence derived properties with evolutionary information. In: Altman R.B., Dunker A.K., Hunter L., Lauderdale K., Klein T.E., editors. Pacific Symp. Biocomp. World Scientific; Hawaii: 2000. pp. 119–130. [PubMed] [Google Scholar]
- 13.Ginalski K., Pas J., Wyrwicz L.S., von Grotthuss M., Bujnicki J.M. ORFeus: Dectection of distant homology using sequence profiles and predicted secondary structure. Nucleic Acids Res. 2003;31:3804–3807. doi: 10.1093/nar/gkg504. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 14.Fischer D., Eisenberg D. Protein fold recognition using sequence-derived predictions. Protein Sci. 1992;5:947–955. doi: 10.1002/pro.5560050516. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 15.Liu S., Zhang C., Liang S., Zhou Y. Fold recognition by concurrent use of solvent accessibility and residue depth. Proteins. 2007;68:636–645. doi: 10.1002/prot.21459. [DOI] [PubMed] [Google Scholar]
- 16.Wu S., Zhang Y. MUSTER: Improving protein sequence profile-profile alignments by using multiple sources of structure information. Proteins. 2008;72:547–556. doi: 10.1002/prot.21945. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 17.Shi J., Blundell T.L., Mizuguchi K. Sequence-structure homology recognition using environment-specific substitution tables and structure-dependent gap penalties. J. Mol. Biol. 2001;310:243–257. doi: 10.1006/jmbi.2001.4762. [DOI] [PubMed] [Google Scholar]
- 18.Zhou H., Zhou Y. Single-body residue-level knowledge-based energy score combined with sequence-profile and secondary structure information for fold recognition. Proteins. 2004;55:1005–1013. doi: 10.1002/prot.20007. [DOI] [PubMed] [Google Scholar]
- 19.Meller J., Elber R. Protein recognition by sequence-to-structure fitness: Bridging efficiency and capacity of threading models. Adv. Chem. Phys. 2002;120:77–130. [Google Scholar]
- 20.Teodorescu O., Galor T., Pillardy J., Elber R. Enriching the sequence substitution matrix by structural information. Proteins. 2004;54:41–48. doi: 10.1002/prot.10474. [DOI] [PubMed] [Google Scholar]
- 21.Al-Lazikani B., Sheinerman F.B., Honig B. Combining multiple structure and sequence alignments to improve sequence detection and alignment: Application to the SH2 domains of Janus kinases. Proc. Natl. Acad. Sci. USA. 2001;98:14796–14801. doi: 10.1073/pnas.011577898. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 22.Kelley L.A., MacCallum R.M., Sternberg M.J.E. Protein fold recognition using 1D and 3D sequence profiles coupled with secondary structure and solvation potential information. J. Mol. Biol. 2000;299:501–522. [Google Scholar]
- 23.Kelley L.A., MacCallum R.M., Sternberg M.J.E. Enhanced genome annotation using structural profiles in the program 3D-PSSM. J. Mol. Biol. 2000;299:499–520. doi: 10.1006/jmbi.2000.3741. [DOI] [PubMed] [Google Scholar]
- 24.Zhou H., Zhou Y. Fold recognition by combining sequence profiles derived from evolution and from depth-dependent structural alignment of fragments. Proteins. 2005;58:321–328. doi: 10.1002/prot.20308. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 25.Chivian D., Baker D. Homology modeling using parametric alignment ensemble generation with consensus and energy-based model selection. Nucleic Acids Res. 2006;34:e112. doi: 10.1093/nar/gkl480. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 26.Jones D.T. GenTHREADER: an efficient and reliable protein fold recognition method for genomic sequences. J. Mol. Biol. 1999;287:797–815. doi: 10.1006/jmbi.1999.2583. [DOI] [PubMed] [Google Scholar]
- 27.Cheng J., Baldi P. A Machining learning information retrieval approach to protein fold recognition. Bioinformatics. 2006;22:1456–1463. doi: 10.1093/bioinformatics/btl102. [DOI] [PubMed] [Google Scholar]
- 28.Ginalski K., Elofsson A., Fischer D., Rychlewski L. 3D-jury: a simple approach to improve protein structure predictions. Bioinformatics. 2003;19:1015–1018. doi: 10.1093/bioinformatics/btg124. [DOI] [PubMed] [Google Scholar]
- 29.Fischer D. 3D-SHOTGUN: a novel, cooperative, fold-recognition meta-predictor. Proteins. 2003;51:434–441. doi: 10.1002/prot.10357. [DOI] [PubMed] [Google Scholar]
- 30.Wu S., Zhang Y. LOMETS: A local meta-threading-server for protein structure prediction. Nucleic Acids Res. 2007;35:3375–3382. doi: 10.1093/nar/gkm251. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 31.Cheng J. A multi-template combination algorithm for protein comparative modeling. BMC Struct. Biol. 2008;8:18–30. doi: 10.1186/1472-6807-8-18. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 32.Söding J. Protein homology detection by HMM-HMM comparison. Bioinformatics. 2005;21:951–960. doi: 10.1093/bioinformatics/bti125. [DOI] [PubMed] [Google Scholar]
- 33.Zhang Y., Skolnick J. Automated structure prediction of weakly homologous proteins on genomic scale. Proc. Natl. Acad. Sci. USA. 2004;101:7594–7599. doi: 10.1073/pnas.0305695101. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 34.John B., Sali A. Comparative protein structure modeling by iterative alignment, model building and model assessment. Nucl. Aci. Res. 2003;31:3982–3992. doi: 10.1093/nar/gkg460. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 35.Lee S., Skolnick J. Development and benchmarking of TASSERiter for the iterative improvement of protein structure predictions. Proteins. 2007;68:39–47. doi: 10.1002/prot.21440. [DOI] [PubMed] [Google Scholar]
- 36.Wu S., Skolnick J., Zhang Y. Ab initio modeling of small proteins by iterative TASSER simulations. BMC Biol. 2007;5:17–26. doi: 10.1186/1741-7007-5-17. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 37.Pillardy J., Czaplewski C., Liwo A., Lee J., Ripoll D.R. Recent improvements in prediction of protein structure by global optimization of a potential energy function. Proc. Natl. Acad. Sci. USA. 2001;98:2329–2333. doi: 10.1073/pnas.041609598. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 38.Misura K.M., Chivian D., Rohl C.A., Kim D.E., Baker D. Physically realistic homology models built with ROSETTA can be more accurate than their templates. Proc. Natl. Acad. Sci. USA. 2004;103:5361–5366. doi: 10.1073/pnas.0509355103. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 39.Simons K.T., Strauss C., Baker D. Prospects for ab initio protein structural genomics. J. Mol. Biol. 2001;306:1191–1199. doi: 10.1006/jmbi.2000.4459. [DOI] [PubMed] [Google Scholar]
- 40.Bradley P., Misura K., Baker D. Toward high-resolution de novo structure prediction for small proteins. Science. 2005;309:1868–1871. doi: 10.1126/science.1113801. [DOI] [PubMed] [Google Scholar]
- 41.Zhang Y. Template-based modeling and free modeling by I-TASSER in CASP7. Proteins. 2007;69(Suppl 8):108–117. doi: 10.1002/prot.21702. [DOI] [PubMed] [Google Scholar]
- 42.Borreguero J., Skolnick J. Benchmarking of TASSER in the ab initio limit. Proteins. 2007 doi: 10.1002/prot.21392. In press. [DOI] [PubMed] [Google Scholar]
- 43.Zhang Y., Kolinski A., Skolnick J. TOUCHSTONE II: A new approach to ab initio protein structure prediction. Biophys. J. 2003;85:1145–1164. doi: 10.1016/S0006-3495(03)74551-2. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 44.Zhou H., Skolnick J. Ab initio protein structure prediction using chunk-TASSER. Biophys. J. 2007;93:1510–1518. doi: 10.1529/biophysj.107.109959. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 45.Odziej S., Czaplewski C., Liwo A., Chinchio M., Nanias M. Physics-based protein-structure prediction using a hierarchical protocol based on the UNRES force field: Assessment in two blind tests. Proc. Natl. Acad. Sci. USA. 2005;102:7547–7552. doi: 10.1073/pnas.0502655102. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 46.Bernstein F.C., Koetzle T.F., Williams G.J.B., Meyer E.F., B M.D., Jr. The Protein Data Bank: A Computer-based Archival File for Macromolecular Structures. J. Mol. Biol. 1977;112:535–542. doi: 10.1016/s0022-2836(77)80200-3. [DOI] [PubMed] [Google Scholar]
- 47.Kihara D., Skolnick J. The PDB is a covering set of small protein structures. J. Mol. Biol. 2003;334:793–802. doi: 10.1016/j.jmb.2003.10.027. [DOI] [PubMed] [Google Scholar]
- 48.Zhang Y., Hubner I., Arakaki A., Shakhnovich E., Skolnick J. On the origin and highly likely completeness of single-domain protein structures. Proc. Natl. Acad. Sci. USA. 2006;103:2605–2610. doi: 10.1073/pnas.0509379103. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 49.Zhang Y., Skolnick J. The protein structure prediction problem could be solved using current PDB library. Proc. Natl. Acad. Sci. USA. 2004;102:1029–1034. doi: 10.1073/pnas.0407152101. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 50.Zhang Y., Arakaki A., Skolnick J. TASSER: An automated method for the prediction of protein tertiary structures in CASP6. Proteins. 2005;61(S7):91–98. doi: 10.1002/prot.20724. [DOI] [PubMed] [Google Scholar]
- 51.Zhou, H., S.B. Pandit, S. Lee, J. Borreguerro, H. Chen, et al. 2007. Analysis of TASSER based CASP7 protein structure prediction results. Proteins. 69(Suppl. 8):90–97. [DOI] [PubMed]
- 52.Lee S., Skolnick J. Benchmarking of TASSER_2.0: An improved protein structure prediction algorithm with more accurate predicted contact restraints. Biophys. J. 2008;95:1956–1964. doi: 10.1529/biophysj.108.129759. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 53.Zhang Y., Skolnick J. A scoring function for the automated assessment of protein structure template quality. Proteins. 2004;57:702–710. doi: 10.1002/prot.20264. [DOI] [PubMed] [Google Scholar]
- 54.Zhou H., Skolnick J. Protein model quality assessment prediction by combining fragment comparisons and a consensus Cα contact potential. Proteins. 2007;71:1211–1218. doi: 10.1002/prot.21813. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 55.Skolnick J., Kihara D., Zhang Y. Development and large scale benchmark testing of the PROSPECTOR 3.0 threading algorithm. Proteins. 2004;56:502–518. doi: 10.1002/prot.20106. [DOI] [PubMed] [Google Scholar]
- 56.Jones T.D. Protein secondary structure prediction based on position-specific scoring matrices. J. Mol. Biol. 1999;292:195–202. doi: 10.1006/jmbi.1999.3091. [DOI] [PubMed] [Google Scholar]
- 57.Domingues F.S., Lackner P., Andreeva A., Sippl M.J. Structure-based evaluation of sequence comparison and fold recognition alignment accuracy. J. Mol. Biol. 2000;297:1003–1013. doi: 10.1006/jmbi.2000.3615. [DOI] [PubMed] [Google Scholar]
- 58.Vingron M., Waterman M.S. Sequence alignment and penalty choice. Review of concepts, case studies and implications. J. Mol. Biol. 1994;235:1–12. doi: 10.1016/s0022-2836(05)80006-3. [DOI] [PubMed] [Google Scholar]
- 59.Waterman M.S., Eggert M., Lander E. Parametric sequence comparisons. Proc. Natl. Acad. Sci. USA. 1992;89:6090–6093. doi: 10.1073/pnas.89.13.6090. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 60.Pandit S.B., Zhang Y., Skolnick J. TASSER-Lite: An automated tool for protein comparative modeling. Biophys. J. 2006;91:4180–4190. doi: 10.1529/biophysj.106.084293. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 61.Zhang Y., Kihara D., Skolnick J. Local energy landscape flattening: parallel hyperbolic Monte Carlo sampling of protein folding. Proteins. 2002;48:192–201. doi: 10.1002/prot.10141. [DOI] [PubMed] [Google Scholar]
- 62.Zhang Y., Skolnick J. SPICKER: a clustering approach to identify near-native protein fold. J. Comput. Chem. 2004;25:865–871. doi: 10.1002/jcc.20011. [DOI] [PubMed] [Google Scholar]
- 63.Zhou H., Zhou Y. SPARKS 2 and SP3 servers in CASP 6. Proteins. 2005;7(Suppl.):152–156. doi: 10.1002/prot.20732. (Supplement CASP issue) [DOI] [PubMed] [Google Scholar]
- 64.Marti-Renom M.A., Madhusudhan M.S., Fiser A., Rost B., Sali A. Reliability of assessment of protein structure prediction methods. Structure. 2002;10:435–440. doi: 10.1016/s0969-2126(02)00731-1. [DOI] [PubMed] [Google Scholar]
- 65.Press W.H., Flannery B.P., Teukolsky S.A., Vetterling W.T. Cambridge University Press; 1989. Numerical Recipes: The Art of Scientific Computing. [Google Scholar]
