The atom assignment problem in automated de novo drug design. 3. Algorithms for optimization of fragment placement onto 3D molecular graphs.
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.
Department of Pharmacology, University of Cambridge, U.K.
M T
MT
Barakat
P M
PM
Dean
D000249:Adenosine Monophosphate / Q000737:chemistry; D000465:Algorithms; D001665:Binding Sites; D003196:Computer Graphics; D017076:Computer-Aided Design; D000242:Cyclic AMP / Q000737:chemistry; D015195:Drug Design; D004563:Electrochemistry; D005492:Folic Acid / Q000737:chemistry; D062385:Hydroxybenzoates / Q000737:chemistry; D008024:Ligands; D015394:Molecular Structure; D014801:Vitamin A / Q000737:chemistry
D062385:Hydroxybenzoates; D008024:Ligands; D014801:Vitamin A; D000249:Adenosine Monophosphate; D005492:Folic Acid; D000242:Cyclic AMP