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 被引量:1912
标识
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
刚刚
zqt发布了新的文献求助10
1秒前
2秒前
orixero应助nightmare采纳,获得10
2秒前
2秒前
2秒前
自觉思萱完成签到,获得积分10
3秒前
内向蜜蜂完成签到,获得积分10
4秒前
温暖霸完成签到,获得积分20
5秒前
5秒前
boat完成签到,获得积分10
5秒前
5秒前
DW应助超帅的若采纳,获得10
6秒前
6秒前
molihuakai应助不扯先生采纳,获得10
6秒前
7秒前
7秒前
水煮电吹风应助罗罗罗采纳,获得10
7秒前
自觉思萱发布了新的文献求助10
8秒前
6542发布了新的文献求助10
8秒前
9秒前
Daniel发布了新的文献求助10
9秒前
9秒前
10秒前
10秒前
科目三应助薛薛薛采纳,获得10
10秒前
10秒前
10秒前
11秒前
11秒前
nightmare发布了新的文献求助10
11秒前
苏堤韩完成签到,获得积分10
11秒前
DW应助超帅的若采纳,获得10
12秒前
12秒前
114514发布了新的文献求助10
12秒前
xxx发布了新的文献求助10
12秒前
可爱的函函应助WWTWM采纳,获得10
13秒前
M8OUT完成签到,获得积分10
13秒前
14秒前
所所应助天气冷采纳,获得10
14秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
The anomeric effect 1314
Principles of town planning: translating concepts to applications 1000
1 Peter and Christ's Descent to the Dead in Its Early Christian Reception 700
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7736004
求助须知:如何正确求助?哪些是违规求助? 9286121
关于积分的说明 20175395
捐赠科研通 7314189
什么是DOI,文献DOI怎么找? 3305181
关于科研通互助平台的介绍 2457596
邀请新用户注册赠送积分活动 2314627