The atom assignment problem in automated de novo drug design. 3. Algorithms for optimization of fragment placement onto 3D molecular graphs |
| |
Authors: | M. T. Barakat P. M. Dean |
| |
Affiliation: | (1) Drug Design Group, Department of Pharmacology, University of Cambridge, Tennis Court Road, CB2 1QJ Cambridge, U.K. |
| |
Abstract: | Summary Atom assignment onto 3D molecular graphs is a combinatoric problem in discrete space. If atoms are to be placed efficiently on molecular graphs produced in drug binding sites, the assignment must be optimized. An algorithm, based on simulated annealing, is presented for efficient optimization of fragment placement. Extensive tests of the method have been performed on five ligands taken from the Protein Data Bank. The algorithm is presented with the ligand graph and the electrostatic potential as input. Self placement of molecular fragments was monitored as an objective test. A hydrogen-bond option was also included, to enable the user to highlight specific needs. The algorithm performed well in the optimization, with successful replications. In some cases, a modification was necessary to reduce the tendency to give multiple halogenated structures. This optimization procedure should prove useful for automated de novo drug design. |
| |
Keywords: | De novo drug design Simulated annealing Molecular graphs Molecular electrostatic potential Molecular complementarity Molecular similarity |
本文献已被 SpringerLink 等数据库收录! |
|