Shape-Based Descriptors for Efficient Structure-Based Fragment Growing

被引:7
|
作者
Penner, Patrick [1 ]
Martiny, Virginie [2 ]
Gohier, Arnaud [2 ]
Gastreich, Marcus [3 ]
Ducrot, Pierre [2 ]
Brown, David [2 ]
Rarey, Matthias [1 ]
机构
[1] Univ Hamburg, ZBH Ctr Bioinformat, D-20146 Hamburg, Germany
[2] Inst Rech Servier, F-78290 Croissy Sur Seine, France
[3] BioSolveIT GmbH, D-53757 Sanktaugustin, Germany
关键词
DRUG DESIGN; LIGAND; DOCKING;
D O I
10.1021/acs.jcim.0c00920
中图分类号
R914 [药物化学];
学科分类号
100701 ;
摘要
Structure-based fragment growing is one of the key techniques in fragment-based drug design. Fragment growing is commonly practiced based on structural and biophysical data. Computational workflows are employed to predict which fragment elaborations could lead to high-affinity binders. Several such workflows exist but many are designed to be long running noninteractive systems. Shape-based descriptors have been proven to be fast and perform well at virtual-screening tasks. They could, therefore, be applied to the fragment-growing problem to enable an interactive fragment-growing workflow. In this work, we describe and analyze the use of specific shape-based directional descriptors for the task of fragment growing. The performance of these descriptors that we call ray volume matrices (RVMs) is evaluated on two data sets containing protein-ligand complexes. While the first set focuses on self-growing, the second measures practical performance in a cross-growing scenario. The runtime of screenings using RVMs as well as their robustness to three dimensional perturbations is also investigated. Overall, it can be shown that RVMs are useful to prefilter fragment candidates. For up to 84% of the 3299 generated self-growing cases and for up to 66% of the 326 generated cross-growing cases, RVMs could create poses with less than 2 A root-mean-square deviation to the crystal structure with average query speeds of around 30,000 conformations per second. This opens the door for fast explorative screenings of fragment libraries.
引用
收藏
页码:6269 / 6281
页数:13
相关论文
共 50 条
  • [1] A comparison of structure-based and shape-based tools for virtual screening
    Hawkins, Paul C. D.
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2006, 231
  • [2] Evaluation of shape descriptors for shape-based image retrieval
    Amanatiadis, A.
    Kaburlasos, V. G.
    Gasteratos, A.
    Papadakis, S. E.
    IET IMAGE PROCESSING, 2011, 5 (05) : 493 - 499
  • [3] Pollen classification using brightness-based and shape-based descriptors
    Rodríguez-Damián, M
    Cernadas, E
    Formella, A
    Sá-Otero, P
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 2, 2004, : 212 - 215
  • [4] NAOMInext - Synthetically feasible fragment growing in a structure-based design context
    Sommer, Kai
    Flachsenberg, Florian
    Rarey, Matthias
    EUROPEAN JOURNAL OF MEDICINAL CHEMISTRY, 2019, 163 : 747 - 762
  • [5] Image database query using shape-based boundary descriptors
    Sirakov, NA
    Swift, JW
    Mlsna, PA
    INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, 2003, : 373 - 382
  • [6] Vascular shape segmentation and structure extraction using a shape-based region-growing model
    Masutani, Y
    Schiemann, T
    Höhne, KH
    MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI'98, 1998, 1496 : 1242 - 1249
  • [7] SPARCL: Efficient and Effective Shape-based Clustering
    Chaoji, Vineet
    Al Hasan, Mohammad
    Salem, Saeed
    Zaki, Mohammed J.
    ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2008, : 93 - 102
  • [8] An efficient shape-based approach to image retrieval
    Fudos, I
    Palios, L
    DISCRETE GEOMETRY FOR COMPUTER IMAGERY, PROCEEDINGS, 2000, 1953 : 505 - 517
  • [9] Efficient multiscale shape-based representation and retrieval
    El Rube, I
    Alajlan, N
    Kamel, M
    Ahmed, M
    Freeman, G
    IMAGE ANALYSIS AND RECOGNITION, 2005, 3656 : 415 - 422
  • [10] An efficient shape-based approach to image retrieval
    Fudos, I
    Palios, L
    PATTERN RECOGNITION LETTERS, 2002, 23 (06) : 731 - 741