2017 36th International Conference of the Chilean Computer Science Society (SCCC) 2017
DOI: 10.1109/sccc.2017.8405141
|View full text |Cite
|
Sign up to set email alerts
|

Evaluating the use of local search strategies for a memetic algorithm for the protein-ligand docking problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…To predict the correct conformation of ligands, search algorithms adopt various techniques, such as checking the chemistry and geometry of the atoms involved [DOCK 6 (Allen et al, 2015), FLEXX (Rarey et al, 1996)], genetic algorithm [GOLD (Verdonk et al, 2003)] and incremental construction (Friesner et al, 2004). Algorithms that consider ligand flexibility can be divided into three types: systematic, stochastic and deterministic (Ruiz-Tagle et al, 2018). Some software uses more than one of these approaches to obtain better results.…”
Section: Search Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…To predict the correct conformation of ligands, search algorithms adopt various techniques, such as checking the chemistry and geometry of the atoms involved [DOCK 6 (Allen et al, 2015), FLEXX (Rarey et al, 1996)], genetic algorithm [GOLD (Verdonk et al, 2003)] and incremental construction (Friesner et al, 2004). Algorithms that consider ligand flexibility can be divided into three types: systematic, stochastic and deterministic (Ruiz-Tagle et al, 2018). Some software uses more than one of these approaches to obtain better results.…”
Section: Search Algorithmsmentioning
confidence: 99%
“…Stochastic search algorithms perform random changes in the spatial conformation of the ligand, usually changing one system degree of freedom at a time, which leads to the exploration of several possible conformations (Ruiz-Tagle et al, 2018). The main problem of stochastic algorithms is the uncertainty of converging to a good solution.…”
Section: Search Algorithmsmentioning
confidence: 99%
“…To predict the correct conformation of ligands, search algorithms adopt various techniques, such as checking the chemistry and geometry of the atoms involved [DOCK 6 (Allen et al, 2015), FLEXX (Rarey et al, 1996)], genetic algorithm [GOLD ] and incremental construction . Algorithms that consider ligand flexibility can be divided into three types: systematic, stochastic and deterministic (Ruiz-Tagle et al, 2018). Some software uses more than one of these approaches to obtain better results.…”
Section: Search Algorithmsmentioning
confidence: 99%