In:
Bioinformatics, Oxford University Press (OUP), Vol. 19, No. suppl_1 ( 2003-07-03), p. i158-i168
Abstract:
Following the hierarchical nature of protein folding, we propose a three-stage scheme for the prediction of a protein structure from its sequence. First, the sequence is cut to fragments that are each assigned a structure. Second, the assigned structures are combinatorially assembled to form the overall 3D organization. Third, highly ranked predicted arrangements are completed and refined. This work focuses on the second stage of this scheme: the combinatorial assembly. We present CombDock, a combinatorial docking algorithm. CombDock gets an ordered set of protein sub-structures and predicts the inter-contacts that define their overall organization. We reduce the combinatorial assembly to a graph-theory problem, and give a heuristic polynomial solution to this computationally hard problem. We applied CombDock to various examples of structural units of two types: protein domains and building blocks, which are relatively stable sub-structures of domains. Moreover, we tested CombDock using increasingly distorted input, where the native structural units were replaced by similarly folded units extracted from homologous proteins and, in the more difficult cases, from globally unrelated proteins. The algorithm is robust, showing low sensitivity to input distortion. This suggests that CombDock is a useful tool in protein structure prediction that may be applied to large target proteins. Supplementary information: More tables and figures are available at www.cs.tau.ac.il/~inbaryuv/combdock/ Contact: inbaryuv@tau.ac.il Keywords: structure prediction, multiple docking, hierarchical model, combinatorial assembly. *To whom correspondence should be addressed.
Type of Medium:
Online Resource
ISSN:
1367-4811
,
1367-4803
DOI:
10.1093/bioinformatics/btg1020
Language:
English
Publisher:
Oxford University Press (OUP)
Publication Date:
2003
detail.hit.zdb_id:
1468345-3
SSG:
12
Permalink
