Ligand-based virtual screening by novelty detection with self-organizing maps

被引:23
|
作者
Hristozov, Dimitar
Oprea, Tudor I.
Gasteiger, Johann
机构
[1] Univ Erlangen Nurnberg, Centrum Comp Chem, D-91052 Erlangen, Germany
[2] Univ New Mexico, Sch Med, Div Biocomp, Albuquerque, NM 87131 USA
关键词
D O I
10.1021/ci700040r
中图分类号
R914 [药物化学];
学科分类号
100701 ;
摘要
We describe a novel method for ligand-based virtual screening, based on utilizing Self-Organizing Maps (SOM) as a novelty detection device. Novelty detection (or one-class classification) refers to the attempt of identifying patterns that do not belong to the space covered by a given data set. In ligand-based virtual screening, chemical structures perceived as novel lie outside the known activity space and can therefore be discarded from further investigation. In this context, the concept of "novel structure" refers to a compound, which is unlikely to share the activity of the query structures. Compounds not perceived as "novel" are suspected to share the activity of the query structures. Nowadays, various databases contain active structures but access to compounds which have been found to be inactive in a biological assay is limited. This work addresses this problem via novelty detection, which does not require proven inactive compounds. The structures are described by spatial autocorrelation functions weighted by atomic physicochemical properties. Different methods for selecting a subset of targets from a larger set are discussed. A comparison with similarity search based on Daylight fingerprints followed by data fusion is presented. The two methods complement each other to a large extent. In a retrospective screening of the WOMBAT database novelty detection with SOM gave enrichment factors between 105 and 462-an improvement over the similarity search based on Daylight fingerprints between 25% and 100%,. when the 100 top ranked structures were considered. Novelty detection with SOM is applicable (1) to improve the retrieval of potentially active compounds also in concert with other virtual screening methods; (2) as a library design tool for discarding a large number of compounds, which are unlikely to possess a given biological activity; and (3) for selecting a small number of potentially active compounds from a large data set.
引用
收藏
页码:2044 / 2062
页数:19
相关论文
共 50 条
  • [1] Ligand Based Virtual Screening Using Self-organizing Maps
    Jayaraj, P. B.
    Sanjay, S.
    Raja, Koustub
    Gopakumar, G.
    Jaleel, U. C.
    PROTEIN JOURNAL, 2022, 41 (01): : 44 - 54
  • [2] Ligand Based Virtual Screening Using Self-organizing Maps
    P. B. Jayaraj
    S. Sanjay
    Koustub Raja
    G. Gopakumar
    U. C. Jaleel
    The Protein Journal, 2022, 41 : 44 - 54
  • [3] Novelty detection using Self-Organizing Maps
    Ypma, A
    Duin, RPW
    PROGRESS IN CONNECTIONIST-BASED INFORMATION SYSTEMS, VOLS 1 AND 2, 1998, : 1322 - 1325
  • [4] Understanding the effect of benchmark dataset composition on the validation and optimization of ligand based virtual screening using self-organizing maps
    Rohrer, Sebastian G.
    Baumann, Knut
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2007, 233
  • [5] Ligand-based combinatorial design of selective purinergic receptor (A2A) antagonists using self-organizing maps
    Schneider, G
    Nettekoven, M
    JOURNAL OF COMBINATORIAL CHEMISTRY, 2003, 5 (03): : 233 - 237
  • [6] Self-organizing maps for outlier detection
    Munoz, A
    Muruzabal, J
    NEUROCOMPUTING, 1998, 18 (1-3) : 33 - 60
  • [7] Ligand-based approaches in virtual screening
    Douguet, Dominique
    CURRENT COMPUTER-AIDED DRUG DESIGN, 2008, 4 (03) : 180 - 190
  • [8] Mobile Anomaly Detection Based on Improved Self-Organizing Maps
    Yin, Chunyong
    Zhang, Sun
    Kim, Kwang-jun
    MOBILE INFORMATION SYSTEMS, 2017, 2017
  • [9] Self-Organizing Maps
    Matera, F
    SUBSTANCE USE & MISUSE, 1998, 33 (02) : 365 - 381
  • [10] Self-Organizing Maps for In Silico Screening and Data Visualization
    Digles, Daniela
    Ecker, Gerhard F.
    MOLECULAR INFORMATICS, 2011, 30 (10) : 838 - 846