Reoptimization of MDL Keys for Use in Drug Discovery

修剪 基础(线性代数) 集合(抽象数据类型) 最小描述长度 还原(数学) 相似性(几何) 计算机科学 选择(遗传算法) 模式识别(心理学) 数学 人工智能 聚类分析 算法 程序设计语言 几何学 图像(数学) 生物 农学
作者
Joseph L. Durant,Burton A. Leland,Douglas R. Henry,James G. Nourse
出处
期刊:Journal of Chemical Information and Computer Sciences [American Chemical Society]
卷期号:42 (6): 1273-1280 被引量:1866
标识
DOI:10.1021/ci010132r
摘要

For a number of years MDL products have exposed both 166 bit and 960 bit keysets based on 2D descriptors. These keysets were originally constructed and optimized for substructure searching. We report on improvements in the performance of MDL keysets which are reoptimized for use in molecular similarity. Classification performance for a test data set of 957 compounds was increased from 0.65 for the 166 bit keyset and 0.67 for the 960 bit keyset to 0.71 for a surprisal S/N pruned keyset containing 208 bits and 0.71 for a genetic algorithm optimized keyset containing 548 bits. We present an overview of the underlying technology supporting the definition of descriptors and the encoding of these descriptors into keysets. This technology allows definition of descriptors as combinations of atom properties, bond properties, and atomic neighborhoods at various topological separations as well as supporting a number of custom descriptors. These descriptors can then be used to set one or more bits in a keyset. We constructed various keysets and optimized their performance in clustering bioactive substances. Performance was measured using methodology developed by Briem and Lessel. "Directed pruning" was carried out by eliminating bits from the keysets on the basis of random selection, values of the surprisal of the bit, or values of the surprisal S/N ratio of the bit. The random pruning experiment highlighted the insensitivity of keyset performance for keyset lengths of more than 1000 bits. Contrary to initial expectations, pruning on the basis of the surprisal values of the various bits resulted in keysets which underperformed those resulting from random pruning. In contrast, pruning on the basis of the surprisal S/N ratio was found to yield keysets which performed better than those resulting from random pruning. We also explored the use of genetic algorithms in the selection of optimal keysets. Once more the performance was only a weak function of keyset size, and the optimizations failed to identify a single globally optimal keyset. Instead multiple, equally optimal keysets could be produced which had relatively low overlap of the descriptors they encoded.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
细心帽子完成签到 ,获得积分10
刚刚
斯文的紫槐完成签到,获得积分10
刚刚
刚刚
ZYX发布了新的文献求助10
刚刚
Supreme发布了新的文献求助10
1秒前
李健应助殷正磊采纳,获得10
1秒前
李专务完成签到,获得积分10
2秒前
2秒前
宋炜完成签到,获得积分10
2秒前
Lucien发布了新的文献求助10
3秒前
3秒前
高兴南琴完成签到,获得积分10
3秒前
3秒前
4秒前
lalala发布了新的文献求助10
4秒前
刘刚松发布了新的文献求助10
5秒前
Orange应助李子采纳,获得10
6秒前
ZeKaWa应助踏实的雨南采纳,获得10
7秒前
GRJ关闭了GRJ文献求助
7秒前
ruochenzu发布了新的文献求助30
7秒前
Carmen发布了新的文献求助10
8秒前
JOJO完成签到,获得积分10
10秒前
科研通AI6.4应助摸鱼仙人采纳,获得30
10秒前
积极凌旋发布了新的文献求助30
10秒前
Li完成签到,获得积分20
10秒前
10秒前
chenyun发布了新的文献求助10
10秒前
哈哈完成签到,获得积分10
10秒前
ZeKaWa应助luluhuhu采纳,获得10
11秒前
每文完成签到,获得积分10
11秒前
木亢完成签到,获得积分10
12秒前
科研通AI6.3应助蓝色牛马采纳,获得10
12秒前
Ethan应助从容的子轩采纳,获得10
12秒前
Owen应助古凊采纳,获得10
13秒前
幸福雨发布了新的文献求助10
13秒前
13秒前
哈哈发布了新的文献求助10
13秒前
13秒前
13秒前
纯真毛豆发布了新的文献求助10
14秒前
高分求助中
Overcoming Stigma and Bias in Obesity Management 1200
Signals, Systems, and Signal Processing 610
Software that combines deep learning,3D reconstruction and CFD to analyze the state of carotid arteries from ultrasound imaging 500
Bounds for Statistical Estimation in Semiparametric Models 500
Forced degradation and stability indicating LC method for Letrozole: A stress testing guide 500
Ideology and Meaning-Making under the Putin Regime 450
Adhesion Science: Principles & Practice 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6490880
求助须知:如何正确求助?哪些是违规求助? 8289002
关于积分的说明 17686518
捐赠科研通 5581931
什么是DOI,文献DOI怎么找? 2914885
邀请新用户注册赠送积分活动 1891993
关于科研通互助平台的介绍 1749720