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 条
  • [21] The Rectangular Packing Problem: Local Optimum Search Methods Based on Block Structures
    E. A. Mukhacheva
    A. S. Mukhacheva
    Automation and Remote Control, 2004, 65 : 248 - 257
  • [22] The rectangular packing problem: Local optimum search methods based on block structures
    Mukhacheva, EA
    Mukhacheva, AS
    AUTOMATION AND REMOTE CONTROL, 2004, 65 (02) : 248 - 257
  • [23] Local Search-Based Metaheuristic Methods for the Solid Waste Collection Problem
    Algethami, Haneen
    APPLIED COMPUTATIONAL INTELLIGENCE AND SOFT COMPUTING, 2023, 2023
  • [24] Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping
    Quema-Taimbud, Nelson-Enrique
    Mendoza-Becerra, Martha-Eliana
    Bedoya-Leyva, Oscar-Fernando
    REVISTA FACULTAD DE INGENIERIA, UNIVERSIDAD PEDAGOGICA Y TECNOLOGICA DE COLOMBIA, 2023, 32 (63):
  • [25] A scalable solution to the nearest neighbor search problem through local-search methods on neighbor graphs
    Tellez, Eric S.
    Ruiz, Guillermo
    Chavez, Edgar
    Graff, Mario
    PATTERN ANALYSIS AND APPLICATIONS, 2021, 24 (02) : 763 - 777
  • [26] A scalable solution to the nearest neighbor search problem through local-search methods on neighbor graphs
    Eric S. Tellez
    Guillermo Ruiz
    Edgar Chavez
    Mario Graff
    Pattern Analysis and Applications, 2021, 24 : 763 - 777
  • [27] Transalpine transport: A local problem in search of European solutions or a European problem in search of local solutions?
    Giorgi, L
    Schmidt, M
    TRANSPORT REVIEWS, 2005, 25 (02) : 201 - 219
  • [28] Minimum Population Search, an Application to Molecular Docking
    Bolufe-Rohler, Antonio
    Coto-Santiesteban, Alex
    Rosa Soto, Marta
    Chen, Stephen
    GECONTEC-REVISTA INTERNACIONAL DE GESTION DEL CONOCIMIENTO Y LA TECNOLOGIA, 2014, 2 (03): : 1 - 16
  • [29] A comparison of heuristic search algorithms for molecular docking
    Westhead, DR
    Clark, DE
    Murray, CW
    JOURNAL OF COMPUTER-AIDED MOLECULAR DESIGN, 1997, 11 (03) : 209 - 228
  • [30] A comparison of heuristic search algorithms for molecular docking
    David R. Westhead
    David E. Clark
    Christopher W. Murray
    Journal of Computer-Aided Molecular Design, 1997, 11 : 209 - 228