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 被引量:1719
标识
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
1秒前
丘比特应助cc采纳,获得30
1秒前
小二郎应助jjj采纳,获得10
1秒前
1秒前
钮水香完成签到,获得积分10
2秒前
2秒前
2秒前
2秒前
咖啡豆完成签到,获得积分10
2秒前
王艺霖发布了新的文献求助10
2秒前
欣喜代秋完成签到,获得积分10
3秒前
3秒前
3秒前
小青椒应助果汁采纳,获得50
3秒前
3秒前
4秒前
4秒前
量子星尘发布了新的文献求助10
4秒前
4秒前
niudayun给niudayun的求助进行了留言
4秒前
王括完成签到,获得积分20
4秒前
SIC发布了新的文献求助10
4秒前
怂怂发布了新的文献求助10
5秒前
共享精神应助gyq采纳,获得10
5秒前
5秒前
adeno发布了新的文献求助10
5秒前
5秒前
粗暴的达发布了新的文献求助10
5秒前
6秒前
6秒前
6秒前
清爽映之完成签到,获得积分10
6秒前
发财牛女发布了新的文献求助10
6秒前
墨与笙完成签到,获得积分10
7秒前
7秒前
121314wld发布了新的文献求助10
7秒前
JamesPei应助高高千万采纳,获得20
8秒前
早期早睡发布了新的文献求助10
8秒前
66发布了新的文献求助30
8秒前
小迷糊完成签到 ,获得积分10
8秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Encyclopedia of Reproduction Third Edition 3000
《药学类医疗服务价格项目立项指南(征求意见稿)》 880
花の香りの秘密―遺伝子情報から機能性まで 800
3rd Edition Group Dynamics in Exercise and Sport Psychology New Perspectives Edited By Mark R. Beauchamp, Mark Eys Copyright 2025 600
1st Edition Sports Rehabilitation and Training Multidisciplinary Perspectives By Richard Moss, Adam Gledhill 600
nephSAP® Nephrology Self-Assessment Program - Hypertension The American Society of Nephrology 500
热门求助领域 (近24小时)
化学 材料科学 生物 医学 工程类 计算机科学 有机化学 物理 生物化学 纳米技术 复合材料 内科学 化学工程 人工智能 催化作用 遗传学 数学 基因 量子力学 物理化学
热门帖子
关注 科研通微信公众号,转发送积分 5624997
求助须知:如何正确求助?哪些是违规求助? 4710900
关于积分的说明 14952616
捐赠科研通 4778944
什么是DOI,文献DOI怎么找? 2553493
邀请新用户注册赠送积分活动 1515444
关于科研通互助平台的介绍 1475731