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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
Wolfe完成签到,获得积分10
1秒前
欧欧欧导完成签到,获得积分10
3秒前
南风完成签到 ,获得积分10
3秒前
长孙归尘完成签到 ,获得积分10
5秒前
米饭儿完成签到 ,获得积分10
14秒前
小猪完成签到,获得积分10
15秒前
七安完成签到,获得积分10
15秒前
Accpt_yq完成签到,获得积分10
18秒前
你才是小哭包完成签到 ,获得积分10
21秒前
CC完成签到,获得积分10
22秒前
可可应助糟糕的道罡采纳,获得50
24秒前
荣幸完成签到 ,获得积分10
24秒前
务实的胡萝卜完成签到 ,获得积分10
26秒前
zzw完成签到,获得积分10
27秒前
程志强完成签到 ,获得积分10
27秒前
刻苦青烟完成签到 ,获得积分10
28秒前
乌特拉完成签到 ,获得积分10
33秒前
nicky完成签到 ,获得积分10
39秒前
幸福妙柏完成签到 ,获得积分10
52秒前
舒服的月饼完成签到 ,获得积分10
57秒前
59秒前
CipherSage应助dwj采纳,获得10
59秒前
感性的俊驰完成签到 ,获得积分10
1分钟前
hi_traffic完成签到,获得积分10
1分钟前
亮亮发布了新的文献求助10
1分钟前
Hello应助正直听白采纳,获得10
1分钟前
DianaLee完成签到 ,获得积分10
1分钟前
1分钟前
鹿阿布完成签到,获得积分10
1分钟前
沙洲发布了新的文献求助10
1分钟前
饱满芷卉完成签到,获得积分10
1分钟前
1分钟前
小杨完成签到,获得积分10
1分钟前
勤恳的语蝶完成签到 ,获得积分10
1分钟前
1分钟前
chun完成签到 ,获得积分10
1分钟前
痕墨笙完成签到 ,获得积分10
1分钟前
科研强完成签到,获得积分10
1分钟前
洛城l完成签到,获得积分10
1分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Introduction to Helicopter and Tiltrotor Flight Simulation, Second Edition 2500
Developing Genetic Editing Tools for Lysobacter 2000
卤化钙钛矿人工突触的研究 2000
Моделирование процессов самоорганизации в кристаллообразующих системах 1000
History of U.S. Space Surveillance and Satellite Cataloging 1000
Malcolm Fraser : a biography 700
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6512380
求助须知:如何正确求助?哪些是违规求助? 8305916
关于积分的说明 17742483
捐赠科研通 5614063
什么是DOI,文献DOI怎么找? 2923772
邀请新用户注册赠送积分活动 1901035
关于科研通互助平台的介绍 1762725