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.

Keywords

Computer scienceAlgorithmFalse positive paradoxBenchmark (surveying)Domain (mathematical analysis)Context (archaeology)Protein structure predictionStructural alignmentFidelityProtocol (science)Protein structureSequence alignmentPattern recognition (psychology)Artificial intelligenceMathematicsBiologyPeptide sequence

MeSH Terms

AlgorithmsAmino Acid SequenceComputer SimulationModelsChemicalModelsMolecularMolecular Sequence DataProtein ConformationProtein FoldingProtein StructureTertiaryProteinsSequence AlignmentSequence AnalysisProteinSoftware

Affiliated Institutions

Related Publications

Touring protein fold space with Dali/FSSP

The FSSP database and its new supplement, the Dali Domain Dictionary, present a continuously updated classification of all known 3D protein structures. The classification is der...

1998 Nucleic Acids Research 667 citations

Publication Info

Year
2007
Type
article
Volume
3
Issue
11
Pages
e232-e232
Citations
114
Access
Closed

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

114
OpenAlex
5
Influential
94
CrossRef

Cite This

Oliver Redfern, Andrew Harrison, Tim Dallman et al. (2007). CATHEDRAL: A Fast and Effective Algorithm to Predict Folds and Domain Boundaries from Multidomain Protein Structures. PLoS Computational Biology , 3 (11) , e232-e232. https://doi.org/10.1371/journal.pcbi.0030232

Identifiers

DOI
10.1371/journal.pcbi.0030232
PMID
18052539
PMCID
PMC2098860

Data Quality

Data completeness: 86%