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 条
  • [41] Local search for the maximum parsimony problem
    Goëffon, A
    Richer, JM
    Hao, JK
    ADVANCES IN NATURAL COMPUTATION, PT 3, PROCEEDINGS, 2005, 3612 : 678 - 683
  • [42] A Local Search for a Graph Clustering Problem
    Navrotskaya, Anna
    Il'ev, Victor
    NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA-2016), 2016, 1776
  • [43] TRAVELING SALESMAN PROBLEM AND LOCAL SEARCH
    CODENOTTI, B
    MARGARA, L
    APPLIED MATHEMATICS LETTERS, 1992, 5 (04) : 69 - 71
  • [44] A Parallel Evolutionary Approach to the Molecular Docking Problem
    Espinosa-Galindo, Daniel
    Fernandez-Flores, Jesus A.
    Almanza-Roman, Ines A.
    Palma-Orozco, Rosaura
    Rosas-Trigueros, Jorge L.
    HIGH PERFORMANCE COMPUTING CARLA 2016, 2017, 697 : 257 - 268
  • [45] Molecular docking: A problem with thousands of degrees of freedom
    Teodoro, ML
    Phillips, GN
    Kavraki, LE
    2001 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS I-IV, PROCEEDINGS, 2001, : 960 - 965
  • [46] Benchmarking of different molecular docking methods for protein-peptide docking
    Piyush Agrawal
    Harinder Singh
    Hemant Kumar Srivastava
    Sandeep Singh
    Gaurav Kishore
    Gajendra P. S. Raghava
    BMC Bioinformatics, 19
  • [47] Benchmarking of different molecular docking methods for protein-peptide docking
    Agrawal, Piyush
    Singh, Harinder
    Srivastava, Hemant Kumar
    Singh, Sandeep
    Kishore, Gaurav
    Raghava, Gajendra P. S.
    BMC BIOINFORMATICS, 2019, 19 (Suppl 13)
  • [48] Memetic Algorithm for Intense Local Search Methods Using Local Search Chains
    Molina, Daniel
    Lozano, Manuel
    Garcia-Martinez, C.
    Herrera, Francisco
    HYBRID METAHEURISTICS, PROCEEDINGS, 2008, 5296 : 58 - +
  • [49] Probabilistic Tabu Search for the Cross-Docking Assignment Problem
    Guemri, Oualid
    Nduwayo, Placide
    Todosijevic, Raca
    Hanafi, Said
    Glover, Fred
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 277 (03) : 875 - 885
  • [50] Intensification neighborhoods for local search methods
    Mautor, T
    ESSAYS AND SURVEYS IN METAHEURISTICS, 2002, 15 : 493 - 508