↓ Skip to main content

PLOS

CATHEDRAL: A Fast and Effective Algorithm to Predict Folds and Domain Boundaries from Multidomain Protein Structures

Overview of attention for article published in PLoS Computational Biology, November 2007
Altmetric Badge

Mentioned by

blogs
2 blogs

Citations

dimensions_citation
89 Dimensions

Readers on

mendeley
84 Mendeley
citeulike
6 CiteULike
connotea
1 Connotea
Title
CATHEDRAL: A Fast and Effective Algorithm to Predict Folds and Domain Boundaries from Multidomain Protein Structures
Published in
PLoS Computational Biology, November 2007
DOI 10.1371/journal.pcbi.0030232
Pubmed ID
Authors

Oliver C Redfern, Andrew Harrison, Tim Dallman, Frances M. G Pearl, Christine A Orengo

Abstract

We present CATHEDRAL, an iterative protocol for determining the location of previously observed protein folds in novel multidomain protein structures. CATHEDRAL builds on the features of a fast secondary-structure-based method (using graph theory) to locate known folds within a multidomain context and a residue-based, double-dynamic programming algorithm, which is used to align members of the target fold groups against the query protein structure to identify the closest relative and assign domain boundaries. To increase the fidelity of the assignments, a support vector machine is used to provide an optimal scoring scheme. Once a domain is verified, it is excised, and the search protocol is repeated in an iterative fashion until all recognisable domains have been identified. We have performed an initial benchmark of CATHEDRAL against other publicly available structure comparison methods using a consensus dataset of domains derived from the CATH and SCOP domain classifications. CATHEDRAL shows superior performance in fold recognition and alignment accuracy when compared with many equivalent methods. If a novel multidomain structure contains a known fold, CATHEDRAL will locate it in 90% of cases, with <1% false positives. For nearly 80% of assigned domains in a manually validated test set, the boundaries were correctly delineated within a tolerance of ten residues. For the remaining cases, previously classified domains were very remotely related to the query chain so that embellishments to the core of the fold caused significant differences in domain sizes and manual refinement of the boundaries was necessary. To put this performance in context, a well-established sequence method based on hidden Markov models was only able to detect 65% of domains, with 33% of the subsequent boundaries assigned within ten residues. Since, on average, 50% of newly determined protein structures contain more than one domain unit, and typically 90% or more of these domains are already classified in CATH, CATHEDRAL will considerably facilitate the automation of protein structure classification.

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 84 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United Kingdom 6 7%
Germany 1 1%
France 1 1%
Switzerland 1 1%
Spain 1 1%
United States 1 1%
Unknown 73 87%

Demographic breakdown

Readers by professional status Count As %
Researcher 27 32%
Student > Ph. D. Student 18 21%
Student > Master 11 13%
Student > Postgraduate 6 7%
Student > Bachelor 4 5%
Other 12 14%
Unknown 6 7%
Readers by discipline Count As %
Agricultural and Biological Sciences 33 39%
Biochemistry, Genetics and Molecular Biology 25 30%
Computer Science 9 11%
Chemistry 4 5%
Business, Management and Accounting 1 1%
Other 6 7%
Unknown 6 7%