## Abstract Originally, the ant system was developed for optimization in discrete search spaces such as the traveling salesman problem. We detail our adaptation of the algorithm to optimization in the continuous search space of conformational analysis. The parameters of the algorithm were tuned usi
The conformational analysis of flexible molecules within macromolecular receptor sites
โ Scribed by AndrewR. Leach; Robert Langridge; IrwinD. Kuntz
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 335 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0263-7855
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We describe in this article our solution to the global minimum problem which uses the simulated annealing algorithm of Kirkpatrick. This method is a Metropolis (e-AElkT) Monte Carlo sampling of conformation space with simultaneous constraint of the search by lowering the temperature T so that the se
A very efficient algorithm for determining the geometrically feasible binding modes of a flexible ligand molecule at the receptor site is presented. It is based on distance geometry but maintains the requirements of three dimensions. The distance geometry manipulation can superimpose two bodies with
The computer program PRODIS is used to find low energy conformations of flexible molecules by searching the potential energy surface(s) of one or more torsion angles via rigid rotation. The n-dimensional grid of energy versus torsion angles is then converted to a Boltzman probability distribution, w