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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Peony完成签到,获得积分10
1秒前
2秒前
3秒前
4秒前
6秒前
科研小白发布了新的文献求助10
8秒前
xiaolizi发布了新的文献求助10
9秒前
风清扬发布了新的文献求助10
10秒前
ggfygggg发布了新的文献求助10
10秒前
15秒前
幽默的龙猫完成签到 ,获得积分10
16秒前
gege完成签到 ,获得积分10
16秒前
17秒前
我耶布吉岛完成签到,获得积分10
17秒前
林一漠发布了新的文献求助10
18秒前
科研通AI6.1应助墨菲特采纳,获得10
19秒前
852应助月光采纳,获得10
21秒前
21秒前
22秒前
chiyudawang完成签到,获得积分10
23秒前
Ava应助Hu13505333208采纳,获得10
23秒前
fengsheng发布了新的文献求助10
24秒前
LXL发布了新的文献求助10
25秒前
zouzou完成签到,获得积分10
25秒前
酷波er应助ggfygggg采纳,获得10
25秒前
25秒前
Akim应助chiyudawang采纳,获得10
26秒前
27秒前
zouzou发布了新的文献求助30
29秒前
不饿发布了新的文献求助10
29秒前
经冰夏完成签到,获得积分10
32秒前
爆米花应助太阳花采纳,获得10
32秒前
月光发布了新的文献求助10
32秒前
fabian完成签到,获得积分10
37秒前
开放的冷雁完成签到,获得积分10
38秒前
微笑完成签到,获得积分10
40秒前
40秒前
40秒前
CC发布了新的文献求助20
41秒前
41秒前
高分求助中
Signals, Systems, and Signal Processing 610
Annie Ernaux: De la perte au corps glorieux 600
Petrology and Plate Tectonics,2025 500
Cardiopulmonary Bypass and Mechanical Support: Principles and Practice, Fifth Edition 400
Circular Polar Constellations Providing Continuous Single or Multiple Coverage Above a Specified Latitude 400
Burger's Medicinal Chemistry and Drug Discovery 400
Probability and Stochastic Processes 333
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6750323
求助须知:如何正确求助?哪些是违规求助? 8479628
关于积分的说明 18083413
捐赠科研通 6026148
什么是DOI,文献DOI怎么找? 3006457
邀请新用户注册赠送积分活动 1983346
关于科研通互助平台的介绍 1951728