已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人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 被引量: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
2秒前
3秒前
Line完成签到,获得积分10
3秒前
3秒前
哈哈发布了新的文献求助10
3秒前
4秒前
5秒前
Ava应助goxiaoshuang采纳,获得20
6秒前
Line发布了新的文献求助10
7秒前
咧咧咧发布了新的文献求助10
8秒前
破碎时间完成签到 ,获得积分10
8秒前
大菜一碟完成签到 ,获得积分10
9秒前
9秒前
10秒前
crazydick发布了新的文献求助10
12秒前
科目三应助咧咧咧采纳,获得10
12秒前
丘比特应助rezeli采纳,获得10
13秒前
Hello应助无私藏鸟采纳,获得10
14秒前
16秒前
爆米花应助喂喂采纳,获得10
19秒前
20秒前
羞涩的帅哥完成签到,获得积分10
22秒前
无花果应助追寻柚子采纳,获得10
22秒前
23秒前
脑洞疼应助beyondh采纳,获得10
25秒前
25秒前
26秒前
27秒前
Moyanmisheng发布了新的文献求助10
27秒前
LULU完成签到,获得积分10
27秒前
li发布了新的文献求助10
28秒前
28秒前
舒心的菀发布了新的文献求助10
29秒前
30秒前
31秒前
yizzy发布了新的文献求助10
31秒前
彭于晏应助笑点低可乐采纳,获得10
32秒前
33秒前
33秒前
荀汐发布了新的文献求助10
33秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Health Psychology 600
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Discerning Saints: Moralization of Intrinsic Motivation and Selective Prosociality at Work 500
Handbuch Trainingswissenschaft – Trainingslehre 500
Additive Manufacturing Design and Applications (ASM Handbook, Volume 24A) 500
Variations: A More Diverse Picture of Contemporary Art 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7591077
求助须知:如何正确求助?哪些是违规求助? 9168476
关于积分的说明 19624617
捐赠科研通 7169854
什么是DOI,文献DOI怎么找? 3267424
关于科研通互助平台的介绍 2432229
邀请新用户注册赠送积分活动 2259715