File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/2245276.2231996
- Scopus: eid_2-s2.0-84863597129
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Molecular docking with opposition-based differential evolution
Title | Molecular docking with opposition-based differential evolution |
---|---|
Authors | |
Keywords | scoring function opposition-based differential evolution molecular docking problem metaheuristic algorithms protein-ligand complex |
Issue Date | 2012 |
Citation | Proceedings of the ACM Symposium on Applied Computing, 2012, p. 1387-1392 How to Cite? |
Abstract | Computer simulation of binding a small molecule (ligand) to the protein receptor is one of the most important issues in present drug design research. The goal of this procedure is to find the best protein-ligand complex by in silico methods. Among different types of approaches that have been developed, metaheuristic algorithms have a major contribution to solve docking problem. In this paper, a population based iterative search algorithm is used for finding the best docking pose. This algorithm is an extension of the differential evolution (DE) algorithm called opposition-based differential evolution (ODE). Also ODE is enhanced by a local search algorithm and a pseudo-elitism operator. The scoring function which is used in this paper is the AutoDock scoring function. Six different protein-ligand complexes are used to verify the efficiency of the proposed algorithm. The experimental results show that the modified ODE (mODE) is more robust and reliable than the other algorithms such as simulated annealing and Lamarckian genetic algorithm. © 2012 ACM. |
Persistent Identifier | http://hdl.handle.net/10722/281977 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Koohi-Moghadam, Mohamad | - |
dc.contributor.author | Rahmani, Adel Torkaman | - |
dc.date.accessioned | 2020-04-19T03:24:43Z | - |
dc.date.available | 2020-04-19T03:24:43Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Proceedings of the ACM Symposium on Applied Computing, 2012, p. 1387-1392 | - |
dc.identifier.uri | http://hdl.handle.net/10722/281977 | - |
dc.description.abstract | Computer simulation of binding a small molecule (ligand) to the protein receptor is one of the most important issues in present drug design research. The goal of this procedure is to find the best protein-ligand complex by in silico methods. Among different types of approaches that have been developed, metaheuristic algorithms have a major contribution to solve docking problem. In this paper, a population based iterative search algorithm is used for finding the best docking pose. This algorithm is an extension of the differential evolution (DE) algorithm called opposition-based differential evolution (ODE). Also ODE is enhanced by a local search algorithm and a pseudo-elitism operator. The scoring function which is used in this paper is the AutoDock scoring function. Six different protein-ligand complexes are used to verify the efficiency of the proposed algorithm. The experimental results show that the modified ODE (mODE) is more robust and reliable than the other algorithms such as simulated annealing and Lamarckian genetic algorithm. © 2012 ACM. | - |
dc.language | eng | - |
dc.relation.ispartof | Proceedings of the ACM Symposium on Applied Computing | - |
dc.subject | scoring function | - |
dc.subject | opposition-based differential evolution | - |
dc.subject | molecular docking problem | - |
dc.subject | metaheuristic algorithms | - |
dc.subject | protein-ligand complex | - |
dc.title | Molecular docking with opposition-based differential evolution | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1145/2245276.2231996 | - |
dc.identifier.scopus | eid_2-s2.0-84863597129 | - |
dc.identifier.spage | 1387 | - |
dc.identifier.epage | 1392 | - |