Learn More
In this paper we describe the search strategies developed for docking flexible molecules to macomolecular sites that are incorporated into the widely distributed DOCK software, version 4.0. The search strategies include incremental construction and random conformation search and utilize the existing Coulombic and Lennard-Jones grid-based scoring function.(More)
The DOCK program explores possible orientations of a molecule within a macromolecular active site by superimposing atoms onto precomputed site points. Here we compare a number of different search methods, including an exhaustive matching algorithm based on a single docking graph. We evaluate the performance of each method by screening a small database of(More)
We report on the development and validation of a new version of DOCK. The algorithm has been rewritten in a modular format, which allows for easy implementation of new scoring functions, sampling methods and analysis tools. We validated the sampling algorithm with a test set of 114 protein-ligand complexes. Using an optimized parameter set, we are able to(More)
Strategies for computational association of molecular components entail a compromise between configurational exploration and accurate evaluation. Following the work of Meng et al. [Proteins, 17 (1993) 266], we investigate issues related to sampling and optimization in molecular docking within the context of the DOCK program. An extensive analysis of diverse(More)
AMPA (alpha-amino-3-hydroxy-5-methyl-4-isooxazole) receptors, a major subtype of ionotropic glutamate receptors (iGluRs), mediate the majority of the fast communication between neurons, and the activity-dependent trafficking of AMPA receptors at synapses plays a role in mammalian learning and memory. Here we describe the design, synthesis, and evaluation of(More)
With an increasing interest in RNA therapeutics and for targeting RNA to treat disease, there is a need for the tools used in protein-based drug design, particularly DOCKing algorithms, to be extended or adapted for nucleic acids. Here, we have compiled a test set of RNA-ligand complexes to validate the ability of the DOCK suite of programs to successfully(More)
Two computational techniques have been developed to explore the orientational and conformational space of a flexible ligand within an enzyme. Both methods use the Genetic Algorithm (GA) to generate conformationally flexible ligands in conjunction with algorithms from the DOCK suite of programs to characterize the receptor site. The methods are applied to(More)
Genetic algorithms have properties which make them attractive in de novo drug design. Like other de novo design programs, genetic algorithms require a method to reduce the enormous search space of possible compounds. Most often this is done using information from known ligands. We have developed the ADAPT program, a genetic algorithm which uses molecular(More)
Distances between key functional groups have been used for some time as molecular descriptors in 3D database screening and clustering calculations. More recently, a number of groups have explored triplets of molecular centers to describe key ligand features in terms of the properties of triangles. Three-body distances are attractive, since they retain more(More)
A new formalism for molecular shape description is described. The formalism, based on considering each molecule as a collection of its 3-atom submolecules, is applied to both the graph theory and geometrical coordinate representations of molecules. The timing results for shape description of several databases indicate that this new method is applicable to(More)