𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparison of heuristic search algorithms for molecular docking

✍ Scribed by David R. Westhead; David E. Clark; Christopher W. Murray

Book ID
110256440
Publisher
Springer Netherlands
Year
1997
Tongue
English
Weight
300 KB
Volume
11
Category
Article
ISSN
0920-654X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Critical evaluation of search algorithms
Critical evaluation of search algorithms for automated molecular docking and database screening
✍ Ewing, Todd J. A.; Kuntz, Irwin D. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 263 KB πŸ‘ 2 views

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 per

Grid-search molecular accessible surface
Grid-search molecular accessible surface algorithm for solving the protein docking problem
✍ Huajun Wang πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 557 KB

An algorithm for solving the protein docking problem is presented. Many tentative dockings are fist generated by requiring a hole on the surface of one protein to match a knob on the surface of the other. All the tentative dockings are then applied. The initial configurations thus generated are furt

Comparison of meta-heuristic algorithms
Comparison of meta-heuristic algorithms for clustering rectangles
✍ Edmund Burke; Graham Kendall πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 258 KB

In this paper we consider a simplified version of the stock cutting (two-dimensional bin packing) problem. We compare three meta-heuristic algorithms (genetic algorithm (GA), tabu search (TS) and simulated annealing (SA)) when applied to this problem. The results show that tabu search and simulated