Abstract
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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
