Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
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 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Inbar, Y.
Right arrow Articles by Wolfson, H. J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Inbar, Y.
Right arrow Articles by Wolfson, H. J.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 Suppl. 1 2003
Pages i158-i168
© 2003 Oxford University Press

Protein structure prediction via combinatorial assembly of sub-structural units

Yuval Inbar 1,*, Hadar Benyamini 2, Ruth Nussinov 2,3 and Haim J. Wolfson 1

1 School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel
2 Sackler Institute of Molecular Medicine, Sackler Faculty of Medicine, Tel Aviv University, Tel Aviv, Israel
3 Basic Research Program, SAIC-Frederick, Inc, Laboratory of Experimental and Computational Biology, NCI - FCRDC, Bldg 469, Rm 151, Frederick, MD 21702, USA

Received on January 6, 2003 ; accepted on February 20, 2003

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{at}tau.ac.il

Keywords: structure prediction, multiple docking, hierarchical model, combinatorial assembly.

* To whom correspondence should be addressed.


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
BioinformaticsHome page
J.-C. Gelly, A. G. de Brevern, and S. Hazout
'Protein Peeling': an approach for splitting a 3D protein structure into compact fragments
Bioinformatics, January 15, 2006; 22(2): 129 - 133.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
M. Shatsky, O. Dror, D. Schneidman-Duhovny, R. Nussinov, and H. J. Wolfson
BioInfo3D: a suite of tools for structural bioinformatics
Nucleic Acids Res., July 1, 2004; 32(suppl_2): W503 - W507.
[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.