---
res:
  bibo_abstract:
  - 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.0Angstrom 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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Vicky
      foaf_name: Choi, Vicky
      foaf_surname: Choi
  - foaf_Person:
      foaf_givenName: Pankaj
      foaf_name: Agarwal, Pankaj K
      foaf_surname: Agarwal
  - foaf_Person:
      foaf_givenName: Herbert
      foaf_name: Herbert Edelsbrunner
      foaf_surname: Edelsbrunner
      foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-9823-6833
  - foaf_Person:
      foaf_givenName: Johannes
      foaf_name: Rudolph, Johannes
      foaf_surname: Rudolph
  bibo_doi: 10.1007/978-3-540-30219-3_19
  bibo_volume: 3240
  dct_date: 2004^xs_gYear
  dct_publisher: Springer@
  dct_title: Local search heuristic for rigid protein docking@
...