A comparison of heuristic search algorithms for molecular docking
摘要：
This paper describes the implementation and comparison of four heuristic search algorithms (genetic algorithm, evolutionary programming, simulated annealing and tabu search) and a random search procedure for flexible molecular docking. To our knowledge, this is the first application of the tabu search algorithm in this area. The algorithms are compared using a recently described fast molecular recognition potential function and a diverse set of five protein–ligand systems. Statistical analysis of the results indicates that overall the genetic algorithm performs best in terms of the median energy of the solutions located. However, tabu search shows a better performance in terms of locating solutions close to the crystallographic ligand conformation. These results suggest that a hybrid search algorithm may give superior results to any of the algorithms alone.
展开
关键词：
Ligand– protein docking Molecular recognition Evolutionary algorithms Simulated annealing Tabu search
DOI：
10.1023/A:1007934310264
被引量：
年份：
1997
相似文献
参考文献
引证文献
引用走势
辅助模式
引用
文献可以批量引用啦~
欢迎点我试用！
