GESim: Ultrafast Graph-Based Molecular Similarity Calculation via von Neumann Graph Entropy

08 January 2025, Version 1
This content is a preprint and has not undergone peer review at the time of posting.

Abstract

Representing molecules as graphs is a natural approach for capturing their structural information, with atoms depicted as nodes and bonds as edges. Although graph-based similarity calculation approaches, such as the graph edit distance, have been proposed for calculating molecular similarity, these approaches are nondeterministic polynomial (NP)-hard and thus computationally infeasible for routine use, unlike fingerprint-based methods. To address this limitation, we developed GESim, an ultrafast graph-based method for calculating molecular similarity on the basis of von Neumann graph entropy. GESim enables molecular similarity calculations by considering entire molecular graphs, and evaluations using two benchmarks for molecular similarity suggest that GESim has characteristics intermediate between those of atom-pair fingerprints and extended-connectivity fingerprints. GESim is provided as an open-source package on GitHub at https://github.com/LazyShion/GESim.

Keywords

Graph-Based Molecular Similarity
von Neumann Graph Entropy

Supplementary materials

Title
Description
Actions
Title
Supporting Information
Description
Average performance of six molecular similarity measures with (a) BEDROC(α=20), (b) BEDROC(α=100), and (c) AUC on the ligand-based virtual screening benchmark (Fig. S1). Statistical analysis of the ligand-based virtual screening benchmark: (a) highest BEDROC(α=20) count, (b) highest BEDROC(α=100) count, (c) highest EF(5%) count, (d) highest EF(1%) count, and (e) highest AUC count across 118 targets, shown as bar plots (Fig. S2).
Actions

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.