arrow
Return

MET: a Java package for fast molecule equivalence testing

delete2020-12-17
delete0
delete
OA
AI
J
Jördis‐Ann Schüler *
S
Steffen Rechner
M
Matthias Müller‐Hannemann
DOI:10.1186/s13321-020-00480-1delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
An important task in cheminformatics is to test whether two molecules are equivalent with respect to their 2D structure. Mathematically, this amounts to solving the graph isomorphism problem for labelled graphs. In this paper, we present an approach which exploits chemical properties and the local neighbourhood of atoms to define highly distinctive node labels. These characteristic labels are the key for clever partitioning molecules into molecule equivalence classes and an effective equivalence test. Based on extensive computational experiments, we show that our algorithm is significantly faster than existing implementations within SMSD, CDK and RDKit. We provide our Java implementation as an easy-to-use, open-source package (via GitHub) which is compatible with CDK. It fully supports the distinction of different isotopes and molecules with radicals.
Keywords:
Molecule isomorphism
Molecule equivalence
Molecular graph
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Journal of Cheminformatics cover
Journal of Cheminformatics
IF:
5.7
Papers:
1.5K
Citations:
1.1W

Organization

M
Martin Luther University Halle Wittenberg
Scholars:
1.1W
Papers: 9.1K
Citations: 103
Cited Papers

Cited Papers

errShare
errSave
Small Molecule Subgraph Detector (SMSD) toolkit
err2009-08-10
err125
errOAAI
errRahman, Syed Asad; Bashton, Matthew; Holliday, Gemma L.; Schrader, Rainer; Thornton, Janet M.
errShare
errSave
researcher View more