已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
fsznc完成签到 ,获得积分0
2秒前
qcy完成签到 ,获得积分20
3秒前
lll完成签到 ,获得积分10
3秒前
3秒前
7秒前
萨瓦迪卡发布了新的文献求助10
7秒前
嘛呱完成签到,获得积分10
7秒前
石宇奇举报Capricorn求助涉嫌违规
8秒前
Hello应助Wayne采纳,获得10
9秒前
yhj_0580发布了新的文献求助10
12秒前
领导范儿应助WML采纳,获得30
12秒前
小二郎应助zkygmu采纳,获得10
13秒前
14秒前
maitiandehe完成签到,获得积分10
14秒前
文献小白完成签到 ,获得积分10
15秒前
嘎嘎嘎嘎完成签到,获得积分20
16秒前
JamesPei应助111采纳,获得10
17秒前
希望天下0贩的0应助gzx采纳,获得10
17秒前
SZA完成签到,获得积分10
20秒前
21秒前
kaka完成签到,获得积分10
21秒前
欢喜的天空完成签到,获得积分10
22秒前
22秒前
大模型应助甘蓝型油菜采纳,获得10
23秒前
Tutu完成签到,获得积分10
23秒前
23秒前
白nb66完成签到 ,获得积分10
25秒前
CodeCraft应助科研通管家采纳,获得10
26秒前
丘比特应助科研通管家采纳,获得10
27秒前
27秒前
yzy发布了新的文献求助10
27秒前
27秒前
星辰大海应助科研通管家采纳,获得10
27秒前
27秒前
27秒前
lww关闭了lww文献求助
28秒前
老虎皮完成签到,获得积分10
33秒前
任润发布了新的文献求助10
33秒前
34秒前
小甑完成签到,获得积分10
34秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Advanced Weaponeering Fourth Edition, Volume 2 1000
Weaponeering: An Introduction Fourth Edition, Volume 1 1000
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
Analytical Separation Science 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7548893
求助须知:如何正确求助?哪些是违规求助? 9131864
关于积分的说明 19511834
捐赠科研通 7142048
什么是DOI,文献DOI怎么找? 3259886
关于科研通互助平台的介绍 2426583
邀请新用户注册赠送积分活动 2248590