I-TASSER server for protein 3D structure prediction
© Zhang; licensee BioMed Central Ltd. 2008
Received: 19 September 2007
Accepted: 23 January 2008
Published: 23 January 2008
Prediction of 3-dimensional protein structures from amino acid sequences represents one of the most important problems in computational structural biology. The community-wide Critical Assessment of Structure Prediction (CASP) experiments have been designed to obtain an objective assessment of the state-of-the-art of the field, where I-TASSER was ranked as the best method in the server section of the recent 7th CASP experiment. Our laboratory has since then received numerous requests about the public availability of the I-TASSER algorithm and the usage of the I-TASSER predictions.
An on-line version of I-TASSER is developed at the KU Center for Bioinformatics which has generated protein structure predictions for thousands of modeling requests from more than 35 countries. A scoring function (C-score) based on the relative clustering structural density and the consensus significance score of multiple threading templates is introduced to estimate the accuracy of the I-TASSER predictions. A large-scale benchmark test demonstrates a strong correlation between the C-score and the TM-score (a structural similarity measurement with values in [0, 1]) of the first models with a correlation coefficient of 0.91. Using a C-score cutoff > -1.5 for the models of correct topology, both false positive and false negative rates are below 0.1. Combining C-score and protein length, the accuracy of the I-TASSER models can be predicted with an average error of 0.08 for TM-score and 2 Å for RMSD.
The I-TASSER server has been developed to generate automated full-length 3D protein structural predictions where the benchmarked scoring system helps users to obtain quantitative assessments of the I-TASSER models. The output of the I-TASSER server for each query includes up to five full-length models, the confidence score, the estimated TM-score and RMSD, and the standard deviation of the estimations. The I-TASSER server is freely available to the academic community at http://zhang.bioinformatics.ku.edu/I-TASSER.
Protein structure prediction refers to the effort of generating 3-dimensional models from amino acid sequences using computer algorithms. However, structure modeling processes often involve human interventions because the human-expert knowledge combined with biochemical information (function, mutagenesis, catalytic residues, etc.) could help in both structural assembly and model selection [1, 2]. Nevertheless, the development of fully-automated algorithms has the advantage in the potential application on proteome-scale structure predictions [3, 4]. Especially, it allows non-experts to generate structural models for their own sequences through Internet services. In the recent community-wide blind experiment, CASP7, I-TASSER (as 'Zhang-Server') generated the best 3D structure predictions among all automated servers. The average GDT_TS  or TM-score  of all 124 targets/domains is at least 5% higher than the second best server and comparable with the best human-expert predictions .
Since the first public release in November 2006, the I-TASSER server has generated structure predictions for thousands of modeling requests from various laboratories in the world. We have been frequently asked by the users about how the quality of the I-TASSER models should be annotated because this will essentially decide how they will exploit the predictions in their research. The general idea of the modeling quality estimation of 3D models has been pursued by a number of authors [8–10], which merges as a new research topic of "model quality assessment programs" (MQAP)  and is assessed in the recent CASP7 experiment in the category of QA .
In this work, we introduce the on-line setting of the I-TASSER server and develop a confidence scoring system which can provide the users with a simple and reliable assessment of the I-TASSER models. Different from most of the MQAP programs that assess models purely based on the structure of the final models, the confidence scoring function developed here incorporates the information and parameters of the modeling simulations.
I-TASSER is a hierarchical protein structure modeling approach based on the secondary-structure enhanced Profile-Profile threading Alignment (PPA)  and the iterative implementation of the Threading ASSEmbly Refinement (TASSER) program . The detail of the I-TASSER method has been described in [15, 16]. Here we give a brief overview of the method.
The target sequences are first threaded through a representative PDB structure library (with a pair-wise sequence identity cut-off of 70%) to search for the possible folds by four simple variants of PPA methods, with different combinations of the hidden Markov model  and PSI-BLAST  profiles and the Needleman-Wunsch  and Smith-Waterman  alignment algorithms. The continuous fragments are then excised from the threading aligned regions which are used to reassemble full-length models while the threading unaligned regions (mainly loops) are built by ab initio modeling . The conformational space is searched by replica-exchange Monte Carlo simulations . The structure trajectories are clustered by SPICKER [23, 24] and the cluster centroids are obtained by the averaging the coordinates of all clustered structures. To rule out the steric clashes on the centroid structures and to refine the models further, we implement the fragment assembly simulation again, which starts from the cluster centroid of the first round simulation. Spatial restraints are extracted from the centroids and the PDB structures searched by the structure alignment program TM-align , which are used to guide the second round simulation. Finally, the structure decoys are clustered and the lowest energy structure in each cluster is selected, which has the Cα atoms and the side-chain centers of mass specified. Pulchra  is used to add backbone atoms (N, C, O) and Scwrl_3.0  to build side-chain rotamers.
If any region with >80 residues has no aligned residues in at least two strong PPA alignments of Z-score > Z0 (see below), the target will be judged as a multiple domain protein and domain boundaries are automatically assigned based on the borders of the large gaps. I-TASSER simulations will be run for the full chain as well as the separate domains. The final full-length models are generated by docking the model of domains together. The domain docking is performed by a quick Metropolis Monte Carlo simulation where the energy is defined as the RMSD of domain models to the full-chain model plus the reciprocal of the number of steric clashes between domains. The goal of the docking is to find the domain orientation that is closest to the I-TASSER full-chain model but has the minimum steric clashes. This procedure does not influence the multiple domain proteins which have all domains completely aligned by the PPAs.
where M is the multiplicity of structures in the SPICKER cluster; Mtot is the total number of the I-TASSER structure decoys used in the clustering; ⟨RMSD⟩ is the average RMSD of the decoys to the cluster centroid; Z(i) is the highest Z-score (the energy to mean in the unit of standard deviation) of the templates by the i th PPA threading program and Z0(i) is a program-specified Z-score cutoff for distinguishing between good and bad templates, i.e. Z0(1) = 7.0, Z0(2) = 8.5, Z0(3) = 8.0, Z0(4) = 10.5.
The first two factors of Equation 1 account for the degree of structure convergence in the SPICKER clustering, which correlates with the consistency of the external restraints and the inherent I-TASSER potential. The third factor accounts for the quality of threading alignments. The logarithm in Equation 1 is to adjust the C-score values in an approximately even distribution. A previously defined C-score has been shown to have a strong correlation with the quality of the predicted models . Here, the definition of C-score is slightly different. First, a normalized Z-score by Z0 is used instead of the Z-score itself which makes it easy to extend the definition to the cases when templates are generated by different threading algorithms. Second, it accounts for the consensus of alignment confidence of multiple threading programs rather than one threading program.
We also tried other alternatives for the C-score definition. For example, if we add ⟨TM-score⟩, the average TM-score of the decoys to the cluster centroid, in the numerator of the second factor in Equation 1, the correlation between the C-score and TM-score will increase by ~2%. But it does not increase the correlation of C-score with RMSD and the calculation of ⟨TM-score⟩ will increase the SPICKER running time by ~20%. So we did not include ⟨TM-score⟩ in the C-score definition. We also attempted to optimize the powers of the three factors of Equation 1 by maximizing the correlation between C-score and the quality of final models in the training proteins. Interestingly, the optimized powers of all three factors are close to 1, which indicates that the C-score in Equation 1 is close to an optimal definition if considering these 3 factors.
where d i is the distance of the i th pair of residues between two structures after an optimal superposition, , and L is the protein length. TM-score stays in [0, 1] with higher values indicating better models. Statistically, a TM-score ≤ 0.17 corresponds to a similarity between two randomly selected structures from the PDB library; a TM-score > 0.5 corresponds approximately to two structures of the similar topology. One advantage of the TM-score is that the meaning of the TM-score cutoffs is independent of the size of proteins .
The URL address of the on-line I-TASSER server is listed at the end of the paper. To use the server, what users need to provide is the amino acid sequence of the proteins to be modeled in the FASTA format. Currently, the acceptable size range of the targets is between 10–1,500 residues. Depending on the protein size, the I-TASSER modeling procedure takes a maximum of 48 hours (typically 5–10 hours for a sequence around 200 residues). After the modeling is finished, an email will be sent to the users, which include the PDB format files of up to 5 predicted models, C-score of the models, and the predicted RMSD and TM-score of the first model. A brief explanation of the RMSD, TM-score, and C-score is also provided in the email.
Once a prediction is made, a GIF visual file is made for each of the I-TASSER models so that the users can get a quick on-line view of how the topology of their models looks like. The PDB files and the visual files are kept on our server for 365 days and made publicly downloadable at , so that other users can quickly retrieve the modeling results without resubmitting the jobs when they want to model the same or similar proteins. The queue of the jobs is shown on the page as well so that the users can track their submitted jobs. Finally, an "About I-TASSER server" webpage  is designed to provide a detailed introduction of the server which is kept updated when new features are developed.
Results and Discussions
For the benchmark of the I-TASSER server, we collect 800 nonhomologous single-domain proteins directly from the PDB library , which have a pair-wise sequence identity <30% with the size ranging from 50 to 300 residues. The purpose has been made to have the selected proteins of a balanced distribution in secondary structure classes and modeling difficulty. As a result, the benchmark set includes 220/212/368 α/β/αβ-proteins. Based on the Z-scores of the PPA alignments, 236/248/316 targets are assigned as easy/medium/hard targets respectively. We randomly select 300 proteins as the training set to fit the parameters of the estimated model quality (see below); the remaining 500 proteins will be used as the test set (see ). When I-TASSER is used to generate models for the 800 proteins, homologous templates with sequence identity >30% to the target are excluded from the threading template library.
It should be mentioned that here we benchmark the I-TASSER algorithm only on the single-domain proteins. For multiple-domain proteins, a small misorientation of the domains may result in dramatic change in TM-score and RMSD values even if the topology of the individual domains is unchanged, which can result in divergent correlations of the C-score and the overall model qualities. Consequently, the confidence score and quality estimation of multiple-domain models should be understood approximately as those for the individual domain units.
Correlation of C-score and model qualities
Quantitative estimate of the quality of I-TASSER models
Based on the I-TASSER models of the 300 training proteins, we fit a two-order polynomial to the TM-score/C-score data by the least square fitting method . We obtainTm-score = 0.0006*C-score2 + 0.13*C-score + 0.71,
with a root mean squared TM-score deviation (RMSTD) of 0.08 for the training protein set. In Figure 1a, we show the curve of Equation 3 (dashed curve) which fits very well with the test proteins with a RMSTD of 0.09. If we consider Equation 3 as the estimated TM-score, the average error of the estimation is 0.08 in the test set. Here we note that the RMSTD is defined as sqrt⟨(TM-score - ⟨TM-score⟩)2⟩ and the average error of estimation is ⟨|TM-score - ⟨TM-score⟩|⟩, where ⟨TM-score⟩ is the average TM-score in the training set and the estimated TM-score in the test set. If we use RMSTD as the standard deviation of the TM-score estimation, there is a probability of 68.3% that the real TM-score will fall in the range of TM-score ± RMSTD .
Since the RMSD of the I-TASSER models correlates better with C-score-ln(L) than with C-score, we fit the 2-order polynomial with the data of RMSD/C-score-ln(L) in the 300 training proteins. We obtainRMSD = 0.09(C-score - ln L)2 - 1.14(C-score - ln L) - 3.17,
with a root mean squared RMSD deviation (RMSRD) of 3.1 Å. In Figure 4, we show the curve of Equation 5 (dashed curve) which fits well with the testing proteins with a RMSRD = 3.7 Å. The average error of the estimated RMSD using Equation 5 is 2.0 Å in the test set.
We develop the I-TASSER server for the automated full-length protein structure prediction. A series of accessorial WebPages are designed to facilitate the users in submitting, viewing and tracking the predictions. Based on the statistical significance of the PPA threading alignments and the structure convergence of the Monte Carlo simulations, a new confidence score (C-score) is introduced and benchmarked for the I-TASSER server, which demonstrates a strong correlation with the real quality of the final models. The Pearson correlation coefficients of the C-score with TM-score and RMSD are 0.91 and 0.75 respectively. The strong correlation data allows us to make quantitative estimates of the accuracy of the I-TASSER predictions. Using a 2-order polynomial equation fit from 300 training proteins, we can predict the TM-score and RMSD of the final models with an average error of 0.08 and 2.0 Å respectively in a large scale benchmark test.
For each submitted sequence, following items will be returned to the users by email after the I-TASSER modeling: (1) up to five predicted models ranked based on the structure density of the SPICKER clustering; (2) C-score of all the I-TASSER models; (3) estimated TM-score and RMSD for the first model in the form of Estimation ± Deviation where the values of Estimation and Deviation are calculated by Equations 3–6. By definition, in 68.3% of cases, the real TM-score and RMSD values will fall in this range . Despite the significant correlation between the C-score and the TM-score, they have been introduced for the different purposes. While the C-score judges how confident the server feels about the predictions based on the information from the modeling simulations, TM-score is a measure of the absolute quality of the final model in comparison with the native structure, which is estimated through the calculation of the C-score.
It should be mentioned that the estimated qualities are provided only for the first model, although for the purpose of providing more information the C-score of all 5 models are sent to the users. The correlation of C-score and modeling quality for the lower-rank models is much weaker than that for the first model. This is understandable because the conformational space covered by the I-TASSER simulations is limited. For easy targets almost all decoys are near-native and the structures are mainly clustered in the first cluster. After removing the structures in the first cluster, the size of the lower-rank clusters will be much smaller which may be comparable to that of hard targets. But the quality of the lower-rank clusters from the easy targets is still on average better than that from the hard targets because most decoys generated in the hard targets are incorrect. Nevertheless, there is a correlation between the rank and the quality of the clusters for the same target. In this set of test proteins, the average TM-score (RMSD) of the top-five models are 0.501 (9.6 Å), 0.468 (10.6 Å), 0.466 (10.7 Å), 0.461 (11.1 Å), and 0.454 (11.3 Å) respectively. Therefore, the C-score and predicted data should be considered as an upper-limit estimate for the quality of all I-TASSER models.
Availability and requirements
Project name: I-TASSER server
Project home page: http://zhang.bioinformatics.ku.edu/I-TASSER
Operating system(s): Windows, Linux, Mac
Programming language: Perl, Fortran77
Any restrictions to use by non-academics: license needed
iterative threading assembly refinement algorithm.
profile-profile alignment threading algorithm.
root mean squared deviation.
root mean squared RMSD deviation from average or estimated RMSD.
root mean squared TM-score deviation from average or estimated TM-score.
The author wants to thank Dr. Sitao Wu for help in constructing the WebPages. The project is partly supported by KU Start-up Fund 06194.
- Murzin AG, Bateman A: CASP2 knowledge-based approach to distant homology recognition and fold prediction in CASP4. Proteins 2001, Suppl 5: 76–85. 10.1002/prot.10037View ArticlePubMedGoogle Scholar
- Ginalski K, Rychlewski L: Protein structure prediction of CASP5 comparative modeling and fold recognition targets using consensus alignment approach and 3D assessment. Proteins 2003, 53 Suppl 6: 410–417. 10.1002/prot.10548View ArticlePubMedGoogle Scholar
- Baker D, Sali A: Protein structure prediction and structural genomics. Science 2001, 294(5540):93–96. 10.1126/science.1065659View ArticlePubMedGoogle Scholar
- Skolnick J, Fetrow JS, Kolinski A: Structural genomics and its importance for gene function analysis. Nat Biotechnol 2000, 18(3):283–287. 10.1038/73723View ArticlePubMedGoogle Scholar
- Zemla A, Venclovas C, Moult J, Fidelis K: Processing and analysis of CASP3 protein structure predictions. Proteins 1999, Suppl 3: 22–29. Publisher Full Text 10.1002/(SICI)1097-0134(1999)37:3+%3C22::AID-PROT5%3E3.0.CO;2-WView ArticlePubMedGoogle Scholar
- Zhang Y, Skolnick J: Scoring function for automated assessment of protein structure template quality. Proteins 2004, 57: 702–710. 10.1002/prot.20264View ArticlePubMedGoogle Scholar
- Battey JN, Kopp J, Bordoli L, Read RJ, Clarke ND, Schwede T: Automated server predictions in CASP7. Proteins 2007, 69(S8):68–82. 10.1002/prot.21761View ArticlePubMedGoogle Scholar
- Tosatto SC: The victor/FRST function for model quality estimation. J Comput Biol 2005, 12(10):1316–1327. 10.1089/cmb.2005.12.1316View ArticlePubMedGoogle Scholar
- Pettitt CS, McGuffin LJ, Jones DT: Improving sequence-based fold recognition by using 3D model quality assessment. Bioinformatics 2005, 21(17):3509–3515. 10.1093/bioinformatics/bti540View ArticlePubMedGoogle Scholar
- Wallner B, Elofsson A: Prediction of global and local model quality in CASP7 using Pcons and ProQ. Proteins 2007, 69(S8):184–193. 10.1002/prot.21774View ArticlePubMedGoogle Scholar
- Fischer D: Servers for protein structure prediction. Current opinion in structural biology 2006, 16(2):178–182. 10.1016/j.sbi.2006.03.004View ArticlePubMedGoogle Scholar
- Cozzetto D, Kryshtafovych A, Ceriani M, Tramontano A: Assessment of predictions in the model quality assessment category. Proteins 2007, 69(S8):175–183. 10.1002/prot.21669View ArticlePubMedGoogle Scholar
- Wu ST, Zhang Y: LOMETS: A local meta-threading-server for protein structure prediction. Nucl Acids Res 2007, 35: 3375–3382. 10.1093/nar/gkm251PubMed CentralView ArticlePubMedGoogle Scholar
- Zhang Y, Skolnick J: Automated structure prediction of weakly homologous proteins on a genomic scale. Proceedings of the National Academy of Sciences of the United States of America 2004, 101: 7594–7599. 10.1073/pnas.0305695101PubMed CentralView ArticlePubMedGoogle Scholar
- Wu ST, Skolnick J, Zhang Y: Ab initio modeling of small proteins by iterative TASSER simulations. BMC Biology 2007, 5: 17. 10.1186/1741-7007-5-17PubMed CentralView ArticlePubMedGoogle Scholar
- Zhang Y: Template-based modeling and free modeling by I-TASSER in CASP7. Proteins 2007, 69(S8):108–117. 10.1002/prot.21702View ArticlePubMedGoogle Scholar
- Karplus K, Barrett C, Hughey R: Hidden Markov models for detecting remote protein homologies. Bioinformatics 1998, 14: 846–856. 10.1093/bioinformatics/14.10.846View ArticlePubMedGoogle Scholar
- Altschul SF, Madden TL, Schaffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic acids research 1997, 25(17):3389–3402. 10.1093/nar/25.17.3389PubMed CentralView ArticlePubMedGoogle Scholar
- Needleman SB, Wunsch CD: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of molecular biology 1970, 48(3):443–453. 10.1016/0022-2836(70)90057-4View ArticlePubMedGoogle Scholar
- Smith TF, Waterman MS: Identification of common molecular subsequences. Journal of molecular biology 1981, 147(1):195–197. 10.1016/0022-2836(81)90087-5View ArticlePubMedGoogle Scholar
- Zhang Y, Kolinski A, Skolnick J: TOUCHSTONE II: A new approach to ab initio protein structure prediction. Biophysical journal 2003, 85: 1145–1164.PubMed CentralView ArticlePubMedGoogle Scholar
- Zhang Y, Kihara D, Skolnick J: Local energy landscape flattening: Parallel hyperbolic Monte Carlo sampling of protein folding. Proteins 2002, 48: 192–201. 10.1002/prot.10141View ArticlePubMedGoogle Scholar
- Zhang Y, Skolnick J: SPICKER: A clustering approach to identify near-native protein folds. Journal of computational chemistry 2004, 25(6):865–871. 10.1002/jcc.20011View ArticlePubMedGoogle Scholar
- SPICKER package[http://zhang.bioinformatics.ku.edu/SPICKER]
- Zhang Y, Skolnick J: TM-align: a protein structure alignment algorithm based on the TM-score. Nucleic acids research 2005, 33(7):2302–2309. 10.1093/nar/gki524PubMed CentralView ArticlePubMedGoogle Scholar
- Feig M, Rotkiewicz P, Kolinski A, Skolnick J, Brooks CL 3rd: Accurate reconstruction of all-atom protein representations from side-chain-based low-resolution models. Proteins 2000, 41(1):86–97. 10.1002/1097-0134(20001001)41:1<86::AID-PROT110>3.0.CO;2-YView ArticlePubMedGoogle Scholar
- Canutescu AA, Shelenkov AA, Dunbrack RL Jr.: A graph-theory algorithm for rapid protein side-chain prediction. Protein Sci 2003, 12(9):2001–2014. 10.1110/ps.03154503PubMed CentralView ArticlePubMedGoogle Scholar
- I-TASSER queue[http://zhang.bioinformatics.ku.edu/I-TASSER/output.html]
- About I-TASSER[http://zhang.bioinformatics.ku.edu/I-TASSER/about.html]
- Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, Shindyalov IN, Bourne PE: The Protein Data Bank. Nucleic acids research 2000, 28(1):235–242. 10.1093/nar/28.1.235PubMed CentralView ArticlePubMedGoogle Scholar
- Benchmark protein list[http://zhang.bioinformatics.ku.edu/I-TASSER/decoys/proteins]
- Kabsch W: A solution for the best rotation to relate two sets of vectors. Acta Cryst 1976, A 32: 922–923.View ArticleGoogle Scholar
- Betancourt MR, Skolnick J: Universal similarity measure for comparing protein structures. Biopolymers 2001, 59(5):305–309. 10.1002/1097-0282(20011015)59:5<305::AID-BIP1027>3.0.CO;2-6View ArticlePubMedGoogle Scholar
- Reichl LE: A Modern Course in Statistical Physics . 2nd edition. New York , Wiley-Interscience; 1998.Google Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.