Skip Navigation

This Article
Right arrow Full Text Freely available
Right arrow Print PDF (335K) 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 (39)
Right arrowRequest Permissions
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Pearl, F. M. G.
Right arrow Articles by Orengo, C. A.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Pearl, F. M. G.
Right arrow Articles by Orengo, C. A.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2001, Vol. 29, No. 1 223-227
© 2001 Oxford University Press

A rapid classification protocol for the CATH Domain Database to support structural genomics

Frances M. G. Pearl1,*, Nigel Martin2, James E. Bray1, Daniel W. A. Buchan1, Andrew P. Harrison1, David Lee1,3, Gabrielle A. Reeves1, Adrian J. Shepherd1, Ian Sillitoe1, Annabel E. Todd1, Janet M. Thornton1,3 and Christine A. Orengo1

1Department of Biochemistry and Molecular Biology, University College London, Gower Street, London WC1E 6BT, UK, 2Department of Computer Science and 3Department of Crystallography, Birkbeck College, Malet Street, London WC1E 7HX, UK

In order to support the structural genomic initiatives, both by rapidly classifying newly determined structures and by suggesting suitable targets for structure determination, we have recently developed several new protocols for classifying structures in the CATH domain database (http://www.biochem.ucl.ac.uk/bsm/cath). These aim to increase the speed of classification of new structures using fast algorithms for structure comparison (GRATH) and to improve the sensitivity in recognising distant structural relatives by incorporating sequence information from relatives in the genomes (DomainFinder). In order to ensure the integrity of the database given the expected increase in data, the CATH Protein Family Database (CATH-PFDB), which currently includes 25 320 structural domains and a further 160 000 sequence relatives has now been installed in a relational ORACLE database. This was essential for developing more rigorous validation procedures and for allowing efficient querying of the database, particularly for genome analysis. The associated Dictionary of Homologous Superfamilies [Bray,J.E., Todd,A.E., Pearl,F.M.G., Thornton,J.M. and Orengo,C.A. (2000) Protein Eng., 13, 153–165], which provides multiple structural alignments and functional information to assist in assigning new relatives, has also been expanded recently and now includes information for 903 homo­logous superfamilies. In order to improve coverage of known structures, preliminary classification levels are now provided for new structures at interim stages in the classification protocol. Since a large proportion of new structures can be rapidly classified using profile-based sequence analysis [e.g. PSI-BLAST: Altschul,S.F., Madden,T.L., Schaffer,A.A., Zhang,J., Zhang,Z., Miller,W. and Lipman,D.J. (1997) Nucleic Acids Res., 25, 3389–3402], this provides preliminary classification for easily recognisable homologues, which in the latest release of CATH (version 1.7) represented nearly three-quarters of the non-identical structures.

* To whom correspondence should be addressed. Tel: +44 207 419 3890; Fax: +44 207 380 7193; Email: frances{at}biochem.ucl.ac.uk


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
 Phil Trans R Soc BHome page
R. L Marsden, J. A.G Ranea, A. Sillero, O. Redfern, C. Yeats, M. Maibaum, D. Lee, S. Addou, G. A Reeves, T. J Dallman, et al.
Exploiting protein structure data to explore the evolution of protein function and biological complexity
Phil Trans R Soc B, March 29, 2006; 361(1467): 425 - 440.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
D. Frishman, M. Mokrejs, D. Kosykh, G. Kastenmuller, G. Kolesov, I. Zubrzycki, C. Gruber, B. Geier, A. Kaps, K. Albermann, et al.
The PEDANT genome database
Nucleic Acids Res., January 1, 2003; 31(1): 207 - 211.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
F. M. G. Pearl, C. F. Bennett, J. E. Bray, A. P. Harrison, N. Martin, A. Shepherd, I. Sillitoe, J. Thornton, and C. A. Orengo
The CATH database: an extended protein family resource for structural and functional genomics
Nucleic Acids Res., January 1, 2003; 31(1): 452 - 455.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
D. W. A. Buchan, S. C. G. Rison, J. E. Bray, D. Lee, F. Pearl, J. M. Thornton, and C. A. Orengo
Gene3D: structural assignments for the biologist and bioinformaticist alike
Nucleic Acids Res., January 1, 2003; 31(1): 469 - 473.
[Abstract] [Full Text] [PDF]

Home page
 J. Biol. Chem.Home page
C. M. Nunn, S. Djordjevic, P. J. Hillas, C. R. Nishida, and P. R. Ortiz de Montellano
The Crystal Structure of Mycobacterium tuberculosis Alkylhydroperoxidase AhpD, a Potential Target for Antitubercular Drug Design
J. Biol. Chem., May 24, 2002; 277(22): 20033 - 20040.
[Abstract] [Full Text] [PDF]

Home page
 Genome ResHome page
D. W.A. Buchan, A. J. Shepherd, D. Lee, F. M.G. Pearl, S. C.G. Rison, J. M. Thornton, and C. A. Orengo
Gene3D: Structural Assignment for Whole Genes and Genomes Using the CATH Domain Structure Database
Genome Res., March 1, 2002; 12(3): 503 - 514.
[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.