Unknown

Dataset Information

0

Implementation of the Hungarian algorithm to account for ligand symmetry and similarity in structure-based design.


ABSTRACT: False negative docking outcomes for highly symmetric molecules are a barrier to the accurate evaluation of docking programs, scoring functions, and protocols. This work describes an implementation of a symmetry-corrected root-mean-square deviation (RMSD) method into the program DOCK based on the Hungarian algorithm for solving the minimum assignment problem, which dynamically assigns atom correspondence in molecules with symmetry. The algorithm adds only a trivial amount of computation time to the RMSD calculations and is shown to increase the reported overall docking success rate by approximately 5% when tested over 1043 receptor-ligand systems. For some families of protein systems the results are even more dramatic, with success rate increases up to 16.7%. Several additional applications of the method are also presented including as a pairwise similarity metric to compare molecules during de novo design, as a scoring function to rank-order virtual screening results, and for the analysis of trajectories from molecular dynamics simulation. The new method, including source code, is available to registered users of DOCK6 ( http://dock.compbio.ucsf.edu ).

SUBMITTER: Allen WJ 

PROVIDER: S-EPMC3958141 | biostudies-literature | 2014 Feb

REPOSITORIES: biostudies-literature

altmetric image

Publications

Implementation of the Hungarian algorithm to account for ligand symmetry and similarity in structure-based design.

Allen William J WJ   Rizzo Robert C RC  

Journal of chemical information and modeling 20140129 2


False negative docking outcomes for highly symmetric molecules are a barrier to the accurate evaluation of docking programs, scoring functions, and protocols. This work describes an implementation of a symmetry-corrected root-mean-square deviation (RMSD) method into the program DOCK based on the Hungarian algorithm for solving the minimum assignment problem, which dynamically assigns atom correspondence in molecules with symmetry. The algorithm adds only a trivial amount of computation time to t  ...[more]

Similar Datasets

| S-EPMC3289081 | biostudies-literature
| S-EPMC10755842 | biostudies-literature
| S-EPMC514697 | biostudies-literature
| S-EPMC6179193 | biostudies-literature
2014-06-20 | E-GEOD-56027 | biostudies-arrayexpress
2014-06-20 | GSE56027 | GEO
| S-EPMC4017976 | biostudies-literature
| S-EPMC3478504 | biostudies-literature
| S-EPMC6422301 | biostudies-literature
| S-EPMC9623574 | biostudies-literature