Efficient generation, storage, and manipulation of fully flexible pharmacophore multiplets and their use in 3-D similarity searching

被引:46
|
作者
Abrahamian, E
Fox, PC
Nærum, L
Christensen, IT
Thogersen, H
Clark, RD
机构
[1] Tripos Inc, St Louis, MO 63144 USA
[2] Novo Nordisk AS, Med Chem Res, DK-2760 Malov, Denmark
关键词
D O I
10.1021/ci025595r
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Pharmacophore triplets and quartets have been used by many groups in recent years, primarily as a tool for molecular diversity analysis. In most cases, slow processing speeds and the very large size of the bitsets generated have forced researchers to compromise in terms of how such multiplets were stored, manipulated, and compared, e.g., by using simple unions to represent multiplets for sets of molecules. Here we report using bitmaps in place of bitsets to reduce storage demands and to improve processing speed. Here, a bitset is taken to mean a fully enumerated string of zeros and ones, from which a compressed bitmap is obtained by replacing uniform blocks ("runs") of digits in the bitset with a pair of values identifying the content and length of the block (run-length encoding compression). High-resolution multiplets involving four features are enabled by using 64 bit executables to create and manipulate bitmaps, which "connect" to the 32 bit executables used for database access and feature identification via an extensible mark-up language (XML) data stream. The encoding system used supports simple pairs, triplets, and quartets; multiplets in which a privileged substructure is used as an anchor point; and augmented multiplets in which an additional vertex is added to represent a contingent feature such as a hydrogen bond extension point linked to a complementary feature (e.g., a donor or an acceptor atom) in a base pair or triplet. It can readily be extended to larger, more complex multiplets as well. Database searching is one particular potential application for this technology. Consensus bitmaps built up from active ligands identified in preliminary screening can be used to generate hypothesis bitmaps, a process which includes allowance for differential weighting to allow greater emphasis to be placed on bits arising from multiplets expected to be particularly discriminating. Such hypothesis bitmaps are shown to be useful queries for database searching, successfully retrieving active compounds across a range of structural classes from a corporate database. The current implementation allows multiconformer bitmaps to be obtained from pregenerated conformations or by random perturbation on-the-fly. The latter application involves random sampling of the full range of conformations not precluded by steric clashes, which limits the usefulness of classical fingerprint similarity measures. A new measure of similarity, The Stochastic Cosine, is introduced here to address this need. This new similarity measure uses the average number of bits common to independently drawn conformer sets to normalize the cosine coefficient. Its use frees the user from having to ensure strict comparability of starting conformations and having to use fixed torsional increments, thereby allowing fully flexible characterization of pharmacophoric patterns.
引用
收藏
页码:458 / 468
页数:11
相关论文
共 50 条
  • [11] Ligand-based 3-D pharmacophore generation and molecular docking of mTOR kinase inhibitors
    Karunakar Tanneeru
    Lalitha Guruprasad
    Journal of Molecular Modeling, 2012, 18 : 1611 - 1624
  • [12] Combined octree/Delaunay method for fully automatic 3-D mesh generation
    Schroeder, W.J.
    Shephard, M.S.
    International Journal for Numerical Methods in Engineering, 1990, 29 (01): : 37 - 55
  • [13] Similarity searching in databases of flexible 3D structures using smoothed bounded distance matrices
    Raymond, JW
    Willett, P
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 2003, 43 (03): : 908 - 916
  • [14] GENERATION AND USE OF MEASUREMENT-BASED 3-D DOSE DISTRIBUTIONS FOR 3-D DOSE CALCULATION VERIFICATION
    STERN, RL
    FRAASS, BA
    GERHARDSSON, A
    MCSHAN, DL
    LAM, KL
    MEDICAL PHYSICS, 1992, 19 (01) : 165 - 173
  • [15] A COMBINED OCTREE DELAUNAY METHOD FOR FULLY-AUTOMATIC 3-D MESH GENERATION
    SCHROEDER, WJ
    SHEPHARD, MS
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1990, 29 (01) : 37 - 55
  • [16] A complete and efficient algorithm for searching 3-D form-closure grasps in the discrete domain
    Liu, YF
    Lam, ML
    Ding, D
    IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2004, 20 (05): : 805 - 816
  • [17] A flexible algorithm for construction of 3-D vessel networks for use in thermal modeling
    Van Leeuwen, GMJ
    Kotte, ANTJ
    Lagendijk, JJW
    IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, 1998, 45 (05) : 596 - 604
  • [18] 3DFS: A new 3D flexible searching system for use in drug design
    Wang, T
    Zhou, JJ
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1998, 38 (01): : 71 - 77
  • [19] Depth Boundary Reconstruction based on Similarity of Adjacent Pixels for Efficient 3-D Video Coding
    Kim, Donghyun
    Ryu, Seungchul
    Sohn, Kwanghoon
    IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, 2013, 59 (02) : 400 - 406
  • [20] Efficient Body Motion Quantification and Similarity Evaluation Using 3-D Joints Skeleton Coordinates
    Aouaidjia, Kamel
    Sheng, Bin
    Li, Ping
    Kim, Jinman
    Feng, David Dagan
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2021, 51 (05): : 2774 - 2788