A probabilistic molecular fingerprint for big data settings

被引:95
作者
Probst, Daniel [1 ]
Reymond, Jean-Louis [1 ]
机构
[1] Univ Bern, Natl Ctr Competence Res NCCR TransCure, Dept Chem & Biochem, Freiestr 3, CH-3012 Bern, Switzerland
来源
JOURNAL OF CHEMINFORMATICS | 2018年 / 10卷
基金
瑞士国家科学基金会;
关键词
Virtual screening; Similarity search; Fingerprints; Locality sensitive hashing; Approximate k-nearest neighbor search; CHEMICAL SPACE; SIMILARITY; SETS; VISUALIZATION; SEARCHES; PUBCHEM; CHEMBL; ZINC;
D O I
10.1186/s13321-018-0321-8
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
BackgroundAmong the various molecular fingerprints available to describe small organic molecules, extended connectivity fingerprint, up to four bonds (ECFP4) performs best in benchmarking drug analog recovery studies as it encodes substructures with a high level of detail. Unfortunately, ECFP4 requires high dimensional representations (1024D) to perform well, resulting in ECFP4 nearest neighbor searches in very large databases such as GDB, PubChem or ZINC to perform very slowly due to the curse of dimensionality.ResultsHerein we report a new fingerprint, called MinHash fingerprint, up to six bonds (MHFP6), which encodes detailed substructures using the extended connectivity principle of ECFP in a fundamentally different manner, increasing the performance of exact nearest neighbor searches in benchmarking studies and enabling the application of locality sensitive hashing (LSH) approximate nearest neighbor search algorithms. To describe a molecule, MHFP6 extracts the SMILES of all circular substructures around each atom up to a diameter of six bonds and applies the MinHash method to the resulting set. MHFP6 outperforms ECFP4 in benchmarking analog recovery studies. By leveraging locality sensitive hashing, LSH approximate nearest neighbor search methods perform as well on unfolded MHFP6 as comparable methods do on folded ECFP4 fingerprints in terms of speed and relative recovery rate, while operating in very sparse and high-dimensional binary chemical space.ConclusionMHFP6 is a new molecular fingerprint, encoding circular substructures, which outperforms ECFP4 for analog searches while allowing the direct application of locality sensitive hashing algorithms. It should be well suited for the analysis of large databases. The source code for MHFP6 is available on GitHub (https://github.com/reymond-group/mhfp).
引用
收藏
页数:12
相关论文
共 46 条
  • [1] Andoni A, 2017, PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P67
  • [2] [Anonymous], 1998, P 13 ANN ACM S THEOR
  • [3] [Anonymous], ELECT NOTES DISCRETE
  • [4] ATKINSON MP, 1999, P 25 INT C VER LARG
  • [5] Atom Pair 2D-Fingerprints Perceive 3D-Molecular Shape and Pharmacophores for Very Fast Virtual Screening of ZINC and GDB-17
    Awale, Mahendra
    Reymond, Jean-Louis
    [J]. JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2014, 54 (07) : 1892 - 1907
  • [6] MQN-Mapplet: Visualization of Chemical Space with Interactive Maps of Drug Bank, ChEMBL, Pub Chem, GDB-11, and GDB-13
    Awale, Mahendra
    van Deursen, Ruud
    Reymond, Jean-Louis
    [J]. JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2013, 53 (02) : 509 - 518
  • [7] Why is Tanimoto index an appropriate choice for fingerprint-based similarity calculations?
    Bajusz, David
    Racz, Anita
    Heberger, Kroly
    [J]. JOURNAL OF CHEMINFORMATICS, 2015, 7
  • [8] Speeding up chemical database searches using a proximity filter based on the logical exclusive OR
    Baldi, Pierre
    Hirschberg, Daniel S.
    Nasr, Ramzi J.
    [J]. JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2008, 48 (07) : 1367 - 1378
  • [9] Bawa M, 2005, WWW 05, DOI [DOI 10.1145/1060745.1060840, 10.1145/1060745.1060840]
  • [10] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING
    BENTLEY, JL
    [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (09) : 509 - 517