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 条
  • [21] Grohe M., 2018, PROC 43 INT S MATH F
  • [22] Hu S, 2005, P ICASSP 05 IEEE INT, V2
  • [23] Hu Y., 2014, F1000RESEARCH, V3, P36, DOI DOI 10.12688/F1000RESEARCH.3-36.V2
  • [24] Benchmarking sets for molecular docking
    Huang, Niu
    Shoichet, Brian K.
    Irwin, John J.
    [J]. JOURNAL OF MEDICINAL CHEMISTRY, 2006, 49 (23) : 6789 - 6801
  • [25] Indyk P., 1998, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, P604, DOI 10.1145/276698.276876
  • [26] ZINC - A free database of commercially available compounds for virtual screening
    Irwin, JJ
    Shoichet, BK
    [J]. JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2005, 45 (01) : 177 - 182
  • [27] Kosub S, 2016, ARXIV161202696CSSTAT
  • [28] MANBER U, 1994, PROCEEDINGS OF THE WINTER 1994 USENIX CONFERENCE, P1
  • [29] GENERALIZED BIRTHDAY PROBLEM
    MCKINNEY, EH
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1966, 73 (4P1) : 385 - &
  • [30] GENERATION OF A UNIQUE MACHINE DESCRIPTION FOR CHEMICAL STRUCTURES-A TECHNIQUE DEVELOPED AT CHEMICAL ABSTRACTS SERVICE
    MORGAN, HL
    [J]. JOURNAL OF CHEMICAL DOCUMENTATION, 1965, 5 (02): : 107 - &