亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整的填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

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 被引量:1385
标识
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
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
6秒前
26秒前
ZHOU完成签到,获得积分10
32秒前
科研通AI2S应助科研通管家采纳,获得10
1分钟前
科研通AI2S应助科研通管家采纳,获得10
1分钟前
1分钟前
2分钟前
在水一方应助kaka采纳,获得10
2分钟前
充电宝应助云青采纳,获得10
2分钟前
2分钟前
kaka发布了新的文献求助10
2分钟前
2分钟前
汉堡包应助爱学习的慕采纳,获得10
2分钟前
kaka完成签到,获得积分10
2分钟前
重翠完成签到,获得积分10
2分钟前
情怀应助ting采纳,获得10
3分钟前
3分钟前
田様应助捏个小雪团采纳,获得10
3分钟前
3分钟前
3分钟前
迷人的绿茶完成签到,获得积分10
3分钟前
3分钟前
pigpara发布了新的文献求助10
3分钟前
3分钟前
3分钟前
3分钟前
科研通AI2S应助科研通管家采纳,获得10
3分钟前
阔落完成签到,获得积分10
3分钟前
科研通AI2S应助捏个小雪团采纳,获得10
3分钟前
葶ting完成签到 ,获得积分10
3分钟前
闹闹完成签到 ,获得积分10
4分钟前
bkagyin应助小叶不吃香菜采纳,获得10
4分钟前
kyfbrahha完成签到 ,获得积分10
4分钟前
4分钟前
4分钟前
4分钟前
受伤雁荷发布了新的文献求助10
4分钟前
Enchanted完成签到 ,获得积分10
4分钟前
华仔应助受伤雁荷采纳,获得10
4分钟前
5分钟前
高分求助中
The late Devonian Standard Conodont Zonation 2000
Nickel superalloy market size, share, growth, trends, and forecast 2023-2030 2000
The Lali Section: An Excellent Reference Section for Upper - Devonian in South China 1500
Very-high-order BVD Schemes Using β-variable THINC Method 910
Mantiden: Faszinierende Lauerjäger Faszinierende Lauerjäger 800
PraxisRatgeber: Mantiden: Faszinierende Lauerjäger 800
Saponins and sapogenins. IX. Saponins and sapogenins of Luffa aegyptica mill seeds (black variety) 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3261513
求助须知:如何正确求助?哪些是违规求助? 2902300
关于积分的说明 8319589
捐赠科研通 2572232
什么是DOI,文献DOI怎么找? 1397469
科研通“疑难数据库(出版商)”最低求助积分说明 653733
邀请新用户注册赠送积分活动 632232