English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A Combinatorial Approach to Protein Docking with Flexible Side-Chains

Althaus, E., Kohlbacher, O., Lenhof, H.-P., & Müller, P. (2000). A Combinatorial Approach to Protein Docking with Flexible Side-Chains. In R. Shamir, S. Miyano, S. Istrail, P. Pevzner, & M. Waterman (Eds.), Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00) (pp. 15-24). New York, USA: ACM Press.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3367-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3368-3
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Althaus, Ernst1, Author           
Kohlbacher, Oliver1, Author           
Lenhof, Hans-Peter1, Author           
Müller, Peter1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: \begin{abstract} Rigid body docking approaches are not sufficient to predict the structure of a protein complex from the unbound (native) structures of the two proteins. Accounting for side--chain flexibility is an important step towards fully flexible protein docking. This work describes an approach that allows conformational flexibility for the side--chains while keeping the protein backbone rigid. Starting from candidates created by a rigid docking algorithm, we demangle the side--chains of the docking site, thus creating reasonable approximations of the true complex structure. These structures are ranked with respect to the binding free energy. We present two new techniques for side--chain demangling. Both approaches are based on a discrete representation of the side--chain conformational space by the use of a rotamer library. This leads to a combinatorial optimization problem. For the solution of this problem we propose a fast heuristic approach and an exact, albeit slower method using branch--\&--cut techniques. As a test set we use the unbound structures of three proteases and the corresponding protein inhibitors. For each of the examples the highest--ranking conformation produced was a good approximation of the true complex structure. \end{abstract}

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-022000
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM Press
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 518088
Other: Local-ID: C1256428004B93B8-DE51DBE5613893BDC12568C40036D525-AKL+2000
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Tokyo, Japan
Start-/End Date: -

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00)
Source Genre: Proceedings
 Creator(s):
Shamir, Ron, Editor
Miyano, Satoru, Editor
Istrail, Sorin, Editor
Pevzner, Pavel, Editor
Waterman, Michael, Editor
Affiliations:
-
Publ. Info: New York, USA : ACM Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 15 - 24 Identifier: ISBN: 1-58113-186-0