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

@article{citeulike:2036373, 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\&\#8211;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\&\#37; of cases, with \&\#60;1\&\#37; false positives. For nearly 80\&\#37; 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\&\#37; of domains, with 33\&\#37; of the subsequent boundaries assigned within ten residues. Since, on average, 50\&\#37; of newly determined protein structures contain more than one domain unit, and typically 90\&\#37; or more of these domains are already classified in CATH, CATHEDRAL will considerably facilitate the automation of protein structure classification.}, author = {Redfern, Oliver C. and Harrison, Andrew and Dallman, Tim and Pearl, Frances M. and Orengo, Christine A. }, citeulike-article-id = {2036373}, doi = {10.1371/journal.pcbi.0030232}, journal = {PLoS Computational Biology}, keywords = {domain-parsing, protein\_structure}, month = {November}, number = {11}, pages = {e232+}, posted-at = {2008-07-07 21:43:07}, priority = {4}, title = {CATHEDRAL: A Fast and Effective Algorithm to Predict Folds and Domain Boundaries from Multidomain Protein Structures}, url = {http://dx.doi.org/10.1371/journal.pcbi.0030232}, volume = {3}, year = {2007} }

TY - JOUR ID - citeulike:2036373 L3 - citeulike-article-id:2036373 TI - CATHEDRAL: A Fast and Effective Algorithm to Predict Folds and Domain Boundaries from Multidomain Protein Structures JF - PLoS Computational Biology VL - 3 IS - 11 SP - e232 N2 - 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. KW - domain-parsing KW - protein_structure AU - Redfern, Oliver AU - Harrison, Andrew AU - Dallman, Tim AU - Pearl, Frances AU - Orengo, Christine PY - 2007/11/01/ UR - http://dx.doi.org/10.1371/journal.pcbi.0030232 ER -