✦ LIBER ✦

Assessing search strategies for flexible docking

✍ Scribed by Vieth, Michal; Hirst, Jonathan D.; Dominy, Brian N.; Daigler, Heidi; Brooks, Charles L.

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 288 KB
Volume: 19
Category: Article
ISSN: 0192-8651
DOI: 10.1002/(sici)1096-987x(19981115)19:14<1623::aid-jcc8>3.0.co;2-l

No coin nor oath required. For personal study only.

✦ Synopsis

We assess the efficiency of molecular dynamics MD , Monte Ž . Ž . Carlo MC , and genetic algorithms GA for docking five representative ligand᎐receptor complexes. All three algorithms employ a modified CHARMM-based energy function. The algorithms are also compared with an established docking algorithm, AutoDock. The receptors are kept rigid while flexibility of ligands is permitted. To test the efficiency of the algorithms, two ˚search spaces are used: an 11-A-radius sphere and a 2.5-A-radius sphere, both centered on the active site. We find MD is most efficient in the case of the large search space, and GA outperforms the other methods in the small search space. We also find that MD provides structures that are, on average, lower in energy and closer to the crystallographic conformation. The GA obtains good solutions over the course of the fewest energy evaluations. However, due to the nature of the nonbonded interaction calculations, the GA requires the longest time for a single energy evaluation, which results in a decreased efficiency. The GA and MC search algorithms are implemented in the CHARMM macromolecular package.

📜 SIMILAR VOLUMES

Assessing energy functions for flexible

Assessing energy functions for flexible docking

✍ Vieth, Michal; Hirst, Jonathan D.; Kolinski, Andrzej; Brooks, Charles L. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 302 KB

A good docking algorithm requires an energy function that is selective, in that it clearly differentiates correctly docked structures from misdocked ones, and that is efficient, meaning that a correctly docked structure can be identified quickly. We assess the selectivity and efficiency of a broad s

Flexible ligand docking: A multistep str

Flexible ligand docking: A multistep strategy approach

✍ Jian Wang; Peter A. Kollman; Irwin D. Kuntz 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 414 KB

A flexible ligand docking protocol based on a divide-and-conquer strategy is investigated. This approach first separates total search space into conformation and orientation space. It uses a grid-based method to sample the conformation of an unbound ligand and to select the lowenergy conformers. Rig

Automated flexible ligand docking method

Automated flexible ligand docking method and its application for database search

✍ Makino, Shingo; Kuntz, Irwin D. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB 👁 2 views

We have developed a new docking program that explores ligand flexibility. This program can be applied to database searches. The program is similar in concept to earlier efforts, but it has been automated and improved. The algorithm begins by selecting an anchor fragment of a ligand. This fragment is

ELECT++: Faster conformational search me

ELECT++: Faster conformational search method for docking flexible molecules using molecular similarity

✍ Makino, Shingo; Kuntz, Irwin D. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 575 KB

We have developed a program, ELECTqq Effective LEssening . of Conformations by Template molecules in Cqq , to speed up the conformational search for small flexible molecules using the similar property principle. We apply this principle to molecular shape and, importantly, to molecular flexibility. A

Flexible protein-protein docking based o

Flexible protein-protein docking based on Best-First search algorithm

✍ Efrat Noy; Amiram Goldblum 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 480 KB

## Abstract We developed a new high resolution protein‐protein docking method based on Best‐First search algorithm that loosely imitates protein‐protein associations. The method operates in two stages: first, we perform a rigid search on the unbound proteins. Second, we search alternately on rigid

Flexible docking using tabu search and a

Flexible docking using tabu search and an empirical estimate of binding affinity

✍ Carol A. Baxter; Christopher W. Murray; David E. Clark; David R. Westhead; Matth 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB

This article describes the implementation of a new docking approach. The method uses a Tabu search methodology to dock flexibly ligand molecules into rigid receptor structures. It uses an empirical objective function with a small number of physically based terms derived from fitting experimental bin