Local search heuristic for rigid protein docking

Published

Journal Article

We give an algorithm that locally improves the fit between two proteins modeled as space-filling diagrams. The algorithm defines the fit in purely geometric terms and improves by applying a rigid motion to one of the two proteins. Our implementation of the algorithm takes between three and ten seconds and converges with high likelihood to the correct docked configuration, provided it starts at a position away from the correct one by at most 18 degrees of rotation and at most 3.0Å of translation. The speed and convergence radius make this an attractive algorithm to use in combination with a coarse sampling of the six-dimensional space of rigid motions. © Springer-Verlag 2004.

Duke Authors

Cited Authors

  • Choi, V; Agarwal, PK; Edelsbrunner, H; Rudolph, J

Published Date

  • December 1, 2004

Published In

Volume / Issue

  • 3240 /

Start / End Page

  • 218 - 229

Electronic International Standard Serial Number (EISSN)

  • 1611-3349

International Standard Serial Number (ISSN)

  • 0302-9743

Citation Source

  • Scopus