Skip Navigation



Nucleic Acids Research Advance Access published online on November 7, 2008
Nucleic Acids Research, doi:10.1093/nar/gkn877
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (2961K) Freely available
Right arrow Screen PDF (373K) Freely available
Right arrowOA All Versions of this Article:
37/suppl_1/D310    most recent
gkn877v1
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 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 Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Cuff, A. L.
Right arrow Articles by Orengo, C. A.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Cuff, A. L.
Right arrow Articles by Orengo, C. A.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Database Issue

The CATH classification revisited—architectures reviewed and new ways to characterize structural divergence in superfamilies

Alison L. Cuff1,*, Ian Sillitoe1, Tony Lewis1, Oliver C. Redfern1, Richard Garratt2, Janet Thornton3 and Christine A. Orengo1

1Institute of Structural and Molecular Biology, University College London, London, WC1E 6BT, UK, 2Institute de Fisica de Sao Carlos, Universidade de Sao Paulo, Caixa Postal 369, Sao, Carlos, SP, Brazil and 3European Bioinformatics Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge, CB10 1SD, UK

*To whom correspondence should be addressed. Tel+44 20 7679 3890; Fax: +44 20 7679 7193; Email: cuff{at}biochem.ucl.ac.uk, alisoncuff{at}yahoo.co.uk

Received September 15, 2008. Revised October 16, 2008. Accepted October 17, 2008.

The latest version of CATH (class, architecture, topology, homology) (version 3.2), released in July 2008 (http://www.cathdb.info), contains 1 14 215 domains, 2178 Homologous superfamilies and 1110 fold groups. We have assigned 20 330 new domains, 87 new homologous superfamilies and 26 new folds since CATH release version 3.1. A total of 28 064 new domains have been assigned since our NAR 2007 database publication (CATH version 3.0). The CATH website has been completely redesigned and includes more comprehensive documentation. We have revisited the CATH architecture level as part of the development of a ‘Protein Chart’ and present information on the population of each architecture. The CATHEDRAL structure comparison algorithm has been improved and used to characterize structural diversity in CATH superfamilies and structural overlaps between superfamilies. Although the majority of superfamilies in CATH are not structurally diverse and do not overlap significantly with other superfamilies, ~4% of superfamilies are very diverse and these are the superfamilies that are most highly populated in both the PDB and in the genomes. Information on the degree of structural diversity in each superfamily and structural overlaps between superfamilies can now be downloaded from the CATH website.


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
D. A. Lee, R. Rentzsch, and C. Orengo
GeMMA: functional subfamily classification within superfamilies of predicted protein structural domains
Nucleic Acids Res., November 18, 2009; (2009) gkp1049v1.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
A. Marsico, K. Scheubert, A. Tuukkanen, A. Henschel, C. Winter, R. Winnenburg, and M. Schroeder
MeMotif: a database of linear motifs in {alpha}-helical transmembrane proteins
Nucleic Acids Res., November 12, 2009; (2009) gkp1042v1.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
P. May, A. Kreuchwig, T. Steinke, and I. Koch
PTGL: a database for secondary structure-based protein topologies
Nucleic Acids Res., November 11, 2009; (2009) gkp980v1.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
J. Lees, C. Yeats, O. Redfern, A. Clegg, and C. Orengo
Gene3D: merging structure and function for a Thousand genomes
Nucleic Acids Res., November 11, 2009; (2009) gkp987v1.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
P. Vanhee, J. Reumers, F. Stricher, L. Baeten, L. Serrano, J. Schymkowitz, and F. Rousseau
PepX: a structural database of non-redundant protein-peptide complexes
Nucleic Acids Res., October 30, 2009; (2009) gkp893v1.
[Abstract] [Full Text] [PDF]

Home page
 Proc. Natl. Acad. Sci. USAHome page
D. Petrey, M. Fischer, and B. Honig
Structural relationships among proteins with different global topologies and their implications for function annotation strategies
PNAS, October 13, 2009; 106(41): 17377 - 17382.
[Abstract] [Full Text] [PDF]

Home page
 DNA ResHome page
T. Abe, S. Kanaya, H. Uehara, and T. Ikemura
A Novel Bioinformatics Strategy for Function Prediction of Poorly-Characterized Protein Genes Obtained from Metagenome Analyses
DNA Res, October 3, 2009; (2009) dsp018v1.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
B. W. Brandt and J. Heringa
webPRC: the Profile Comparer for alignment-based searching of public domain databases
Nucleic Acids Res., July 1, 2009; 37(suppl_2): W48 - W52.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
T. Margraf, G. Schenk, and A. E. Torda
The SALAMI protein structure search server
Nucleic Acids Res., July 1, 2009; 37(suppl_2): W480 - W484.
[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.