Skip Navigation

Nucleic Acids Research 2005 33(7):2302-2309; doi:10.1093/nar/gki524
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (4161K) Freely available
Right arrow Screen PDF (647K) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (34)
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Zhang, Y.
Right arrow Articles by Skolnick, J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Zhang, Y.
Right arrow Articles by Skolnick, J.
Related Collections
Right arrow Computational methods
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Published online 22 April 2005

© The Author 2005. Published by Oxford University Press. All rights reserved
The online version of this article has been published under an open access model. Users are entitled to use, reproduce, disseminate, or display the open access version of this article for non-commercial purposes provided that: the original authorship is properly and fully attributed; the Journal and Oxford University Press are attributed as the original place of publication with the correct citation details given; if an article is subsequently reproduced or disseminated not in its entirety but only in part or as a derivative work this must be clearly indicated. For commercial re-use, please contact journals.permissions{at}oupjournals.org


Article

TM-align: a protein structure alignment algorithm based on the TM-score

Yang Zhang and Jeffrey Skolnick*

Center of Excellence in Bioinformatics, University at Buffalo 901 Washington Street, Buffalo, NY 14203, USA

*To whom correspondence should be addressed. Tel: +1 716 849 6712; Fax: +1 716 849 6747; Email: skolnick{at}buffalo.edu

Received March 5, 2005. Revised April 1, 2005. Accepted April 1, 2005.

We have developed TM-align, a new algorithm to identify the best structural alignment between protein pairs that combines the TM-score rotation matrix and Dynamic Programming (DP). The algorithm is ~4 times faster than CE and 20 times faster than DALI and SAL. On average, the resulting structure alignments have higher accuracy and coverage than those provided by these most often-used methods. TM-align is applied to an all-against-all structure comparison of 10 515 representative protein chains from the Protein Data Bank (PDB) with a sequence identity cutoff <95%: 1996 distinct folds are found when a TM-score threshold of 0.5 is used. We also use TM-align to match the models predicted by TASSER for solved non-homologous proteins in PDB. For both folded and misfolded models, TM-align can almost always find close structural analogs, with an average root mean square deviation, RMSD, of 3 Å and 87% alignment coverage. Nevertheless, there exists a significant correlation between the correctness of the predicted structure and the structural similarity of the model to the other proteins in the PDB. This correlation could be used to assist in model selection in blind protein structure predictions. The TM-align program is freely downloadable at http://bioinformatics.buffalo.edu/TM-align.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Nucleic Acids ResHome page
J. Pei, B.-H. Kim, and N. V. Grishin
PROMALS3D: a tool for multiple protein sequence and structure alignments
Nucleic Acids Res., April 1, 2008; 36(7): 2295 - 2300.
[Abstract] [Full Text] [PDF]


Home page
Biophys. JHome page
H. Chen and J. Skolnick
M-TASSER: An Algorithm for Protein Quaternary Structure Prediction
Biophys. J., February 1, 2008; 94(3): 918 - 928.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
H. Cheng, B.-H. Kim, and N. V. Grishin
MALISAM: a database of structurally analogous motifs in proteins
Nucleic Acids Res., January 11, 2008; 36(suppl_1): D211 - D217.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
M. Brylinski and J. Skolnick
A threading-based method (FINDSITE) for ligand-binding site prediction and functional annotation
PNAS, January 8, 2008; 105(1): 129 - 134.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
F. S. Domingues, J. Rahnenfuhrer, and T. Lengauer
Conformational analysis of alternative protein structures
Bioinformatics, December 1, 2007; 23(23): 3131 - 3138.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
L. Meyerguz, J. Kleinberg, and R. Elber
From the Cover: The network of sequence flow between protein structures
PNAS, July 10, 2007; 104(28): 11627 - 11632.
[Abstract] [Full Text] [PDF]


Home page
Biophys. JHome page
S. B. Pandit, Y. Zhang, and J. Skolnick
TASSER-Lite: An Automated Tool for Protein Comparative Modeling
Biophys. J., December 1, 2006; 91(11): 4180 - 4190.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
J. Maupetit, R. Gautier, and P. Tuffery
SABBAC: online Structural Alphabet-based protein BackBone reconstruction from Alpha-Carbon trace.
Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W147 - W151.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
Y. Zhang, I. A. Hubner, A. K. Arakaki, E. Shakhnovich, and J. Skolnick
On the origin and highly likely completeness of single-domain protein structures
PNAS, February 21, 2006; 103(8): 2605 - 2610.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.