On the Efficiency of Local Search Methods for the Molecular Docking Problem

被引:0
|
作者
Tavares, Jorge [1 ]
Mesmoudi, Salma [2 ]
Talbi, El-Ghazali [2 ]
机构
[1] MIT, 77 Massachusetts Ave, Cambridge, MA 02139 USA
[2] INRIA Lille, Nord Europe Res Ctr, F-59650 Villeneuve Dascq, France
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Evolutionary approaches to molecular (locking typically hybridize with local search methods, more specifically, the Solis-Wet method. However, some studies indicated that local search methods might not be very helpful in the context of molecular docking. An evolutionary algorithm with proper genetic operators can perform equally well or even outperform hybrid evolutionary approaches. We show that this is dependent on the type of local search method. We also propose an evolutionary algorithm which uses the L-BFGS method as local search. Results demonstrate that this hybrid evolutionary outperforms previous approaches and is better suited to serve as a basis for evolutionary docking methods.
引用
收藏
页码:104 / +
页数:2
相关论文
共 50 条
  • [31] General local search methods
    Pirlot, M
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 92 (03) : 493 - 511
  • [32] Molecular docking and global minimization methods
    Li, WJ
    PROGRESS IN BIOCHEMISTRY AND BIOPHYSICS, 2001, 28 (03) : 314 - 317
  • [33] Limits of Local Search: Quality and Efficiency
    Norbert Bus
    Shashwat Garg
    Nabil H. Mustafa
    Saurabh Ray
    Discrete & Computational Geometry, 2017, 57 : 607 - 624
  • [34] Limits of Local Search: Quality and Efficiency
    Bus, Norbert
    Garg, Shashwat
    Mustafa, Nabil H.
    Ray, Saurabh
    DISCRETE & COMPUTATIONAL GEOMETRY, 2017, 57 (03) : 607 - 624
  • [35] Application of NSGA-II with Local Search to Multi-dock Cross-docking Sheduling Problem
    Guo, Yu
    Chen, Zhou-Rong
    Ruan, Yong-Liu
    Zhang, Jun
    PROCEEDINGS 2012 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2012, : 779 - 784
  • [36] Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem
    Burke, EK
    Cowling, PI
    Keuthen, R
    APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2001, 2037 : 203 - 212
  • [37] Local Search Methods for a Distributed Assembly No-Idle Flow Shop Scheduling Problem
    Shao, Weishi
    Pi, Dechang
    Shao, Zhongshi
    IEEE SYSTEMS JOURNAL, 2019, 13 (02): : 1945 - 1956
  • [38] Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets
    李妍峰
    李军
    赵达
    Railway Engineering Science, 2007, (04) : 344 - 352
  • [39] Coupling local search methods and simulated annealing to the job shop scheduling problem with transportation
    Deroussi, L
    Gourgand, M
    Tchernev, N
    ETFA 2001: 8TH IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION, VOL 1, PROCEEDINGS, 2001, : 659 - 667
  • [40] LOCAL SEARCH FOR SATISFIABILITY (SAT) PROBLEM
    GU, J
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1993, 23 (04): : 1108 - 1129