GESim: ultrafast graph-based molecular similarity calculation via von Neumann graph entropy

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 the ability to differentiate between highly similar molecules, even in cases where other methods fail to effectively distinguish their similarity. GESim is provided as an open-source package on GitHub at https://github.com/LazyShion/GESim .

Authors

Institutions

Publication Details

Journal
Journal of Cheminformatics
Published
2025-04-22
DOI
https://doi.org/10.1186/s13321-025-01003-6
Citations
2
Primary Topic
Computational Drug Discovery Methods
Type
article
Field-Weighted Citation Impact
3.01

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GESim: ultrafast graph-based molecular similarity calculation via von Neumann graph entropy

Shoichi Ishida, Hiroaki Shiokawa, Kei Terayama
2 citations
Journal of Cheminformatics
Computational Drug Discovery Methods
3.01
article

GESim: ultrafast graph-based molecular similarity calculation via von Neumann graph entropy

Shoichi Ishida, Hiroaki Shiokawa, Kei Terayama
article en
2 citations

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 the ability to differentiate between highly similar molecules, even in cases where other methods fail to effectively distinguish their similarity. GESim is provided as an open-source package on GitHub at https://github.com/LazyShion/GESim .

Journal of CheminformaticsVol. 17(1)
University of Tsukuba (JP), Yokohama University of Pharmacy (JP), Yokohama City University Medical Center (JP), Kanagawa University (JP), JGC (Japan) (JP), Yokohama City University (JP)
Japan Agency for Medical Research and Development, Ministry of Education, Culture, Sports, Science and Technology, Japan Society for the Promotion of Science, Japan Science and Technology Agency, Precursory Research for Embryonic Science and Technology
Openalex Percentile: Top 9%
Computational Drug Discovery Methods
3.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.