Evidence map›Paper›PMID 40264225›Full record

ArticleJournal of cheminformatics2025

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

Hiroaki Shiokawa, Shoichi Ishida, Kei Terayama

Abstract read
In one paragraph

Article in Journal of cheminformatics, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Hiroaki Shiokawa *Center for Computational Sciences, University of Tsukuba, Tennodai 1-1-1, Tsukuba, Ibaraki, 305-8577, Japan. shiokawa@cs.tsukuba.ac.jp.
Shoichi Ishida *MolNavi LLC, #402 Wizard building 1-4-3 Sengen-cho Nishi-ku, Yokohama, Kanagawa, 220-0072, Japan. ishida.sho.nm@yokohama-cu.ac.jp.
Kei TerayamaMolNavi LLC, #402 Wizard building 1-4-3 Sengen-cho Nishi-ku, Yokohama, Kanagawa, 220-0072, Japan. terayama@yokohama-cu.ac.jp.

Funding

Japan Agency for Medical Research and Development JP23nk0101111, JP22ama121023Japan Science and Technology Agency JPMJCR23U2, JPMJPR2033, JPMJFR232P, JPMJFR232UJapan Society for the Promotion of Science 22K17894Ministry of Education, Culture, Sports, Science and Technology JPMXP1020230120
6 · The paper itself

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 .

Identifiers

PMID40264225
PMCPMC12013028

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.