arrow
返回

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
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

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.
Keyword:
Molecule isomorphism
Molecule equivalence
Molecular graph
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Journal of Cheminformatics 封面图
Journal of Cheminformatics
IF:
5.7
论文数:
1.5K
被引数:
1.1W

机构

M
Martin Luther University Halle Wittenberg
学者数:
1.1W
论文数: 9.1K
被引数: 103
引用论文

引用论文

err分享
err收藏
Small Molecule Subgraph Detector (SMSD) toolkit
err2009-08-10
err125
errOAAI
errRahman, Syed Asad; Bashton, Matthew; Holliday, Gemma L.; Schrader, Rainer; Thornton, Janet M.
err分享
err收藏
学者 查看更多内容