Name
Abstract | ||
|---|---|---|
Protein-ligand docking is to predict the location and orientation of a ligand with respect to a protein within its binding site, and has been known to be essential for the development of new drugs. The protein-ligand docking problem is usually formulated as an energy minimization problem to identify the docked conformation of the ligand. A ligand usually docks around a depressed region, called a pocket, on the surface of a protein. Presented in this paper is a docking method, called BetaDock, based on the newly developed geometric construct called the β-shape and the β-complex. To cope with the computational intractability, the global minimum of the potential energy function is searched using the genetic algorithm. The proposed algorithm first locates initial chromosomes at some locations within the pocket recognized according to the local shape of the β-shape. Then, the algorithm proceeds generations by taking advantage of powerful properties of the β-shape to achieve an extremely fast and good solution. We claim that the proposed method is much faster than other popular docking softwares including AutoDock. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-16007-3_6 | Transactions on Computational Science |
Keywords | DocType | Volume |
beta-shape,docking,genetic algorithm,potential energy function,quasi-triangulation,voronoi diagram of spheres,docking method,energy minimization problem,betadock,local shape,optimization.,assignment problem,beta-complex,popular docking software,algorithm proceeds generation,protein-ligand docking,protein-ligand docking problem | Journal | 9 |
ISSN | ISBN | Citations |
0302-9743 | 3-642-16006-9 | 2 |
PageRank | References | Authors |
0.40 | 19 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chong-Min Kim | 1 | 20 | 1.91 |
| Chung-In Won | 2 | 22 | 2.78 |
| Jaekwan Kim | 3 | 55 | 5.70 |
| Joonghyun Ryu | 4 | 148 | 14.39 |
| Jong Bhak | 5 | 223 | 9.74 |
| Deok-Soo Kim | 6 | 633 | 59.12 |