> Merkliste Sie können Bookmarks mittels Listen verwalten, loggen Sie sich dafür bitte in Ihr SLUB Benutzerkonto ein.
Medientyp: E-Artikel Titel: A new method for the gradient‐based optimization of molecular complexes Beteiligte: Fuhrmann, Jan; Rurainski, Alexander; Lenhof, Hans‐Peter; Neumann, Dirk Erschienen: Wiley, 2009 Erschienen in: Journal of Computational Chemistry Sprache: Englisch DOI: 10.1002/jcc.21159 ISSN: 0192-8651; 1096-987X Schlagwörter: Computational Mathematics ; General Chemistry Entstehung: Anmerkungen: Beschreibung: <jats:title>Abstract</jats:title><jats:p>We present a novel method for the local optimization of molecular complexes. This new approach is especially suited for usage in molecular docking. In molecular modeling, molecules are often described employing a compact representation to reduce the number of degrees of freedom. This compact representation is realized by fixing bond lengths and angles while permitting changes in translation, orientation, and selected dihedral angles. Gradient‐based energy minimization of molecular complexes using this representation suffers from well‐known singularities arising during the optimization process. We suggest an approach new in the field of structure optimization that allows to employ gradient‐based optimization algorithms for such a compact representation. We propose to use exponential mapping to define the molecular orientation which facilitates calculating the orientational gradient. To avoid singularities of this parametrization, the local minimization algorithm is modified to change efficiently the orientational parameters while preserving the molecular orientation, i.e. we perform well‐defined jumps on the objective function. Our approach is applicable to continuous, but not necessarily differentiable objective functions. We evaluated our new method by optimizing several ligands with an increasing number of internal degrees of freedom in the presence of large receptors. In comparison to the method of Solis and Wets in the challenging case of a non‐differentiable scoring function, our proposed method leads to substantially improved results in all test cases, i.e. we obtain better scores in fewer steps for all complexes. © 2008 Wiley Periodicals, Inc. J Comput Chem, 2009</jats:p>