Chemoinformatic approaches for navigating large chemical spaces.

IF 6 2区 医学 Q1 PHARMACOLOGY & PHARMACY Expert Opinion on Drug Discovery Pub Date : 2024-04-01 Epub Date: 2024-02-05 DOI:10.1080/17460441.2024.2313475
Martin Vogt
{"title":"Chemoinformatic approaches for navigating large chemical spaces.","authors":"Martin Vogt","doi":"10.1080/17460441.2024.2313475","DOIUrl":null,"url":null,"abstract":"<p><strong>Introduction: </strong>Large chemical spaces (CSs) include traditional large compound collections, combinatorial libraries covering billions to trillions of molecules, DNA-encoded chemical libraries comprising complete combinatorial CSs in a single mixture, and virtual CSs explored by generative models. The diverse nature of these types of CSs require different chemoinformatic approaches for navigation.</p><p><strong>Areas covered: </strong>An overview of different types of large CSs is provided. Molecular representations and similarity metrics suitable for large CS exploration are discussed. A summary of navigation of CSs in generative models is provided. Methods for characterizing and comparing CSs are discussed.</p><p><strong>Expert opinion: </strong>The size of large CSs might restrict navigation to specialized algorithms and limit it to considering neighborhoods of structurally similar molecules. Efficient navigation of large CSs not only requires methods that scale with size but also requires smart approaches that focus on better but not necessarily larger molecule selections. Deep generative models aim to provide such approaches by implicitly learning features relevant for targeted biological properties. It is unclear whether these models can fulfill this ideal as validation is difficult as long as the covered CSs remain mainly virtual without experimental verification.</p>","PeriodicalId":12267,"journal":{"name":"Expert Opinion on Drug Discovery","volume":" ","pages":"403-414"},"PeriodicalIF":6.0000,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Expert Opinion on Drug Discovery","FirstCategoryId":"3","ListUrlMain":"https://doi.org/10.1080/17460441.2024.2313475","RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/2/5 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"PHARMACOLOGY & PHARMACY","Score":null,"Total":0}
引用次数: 0

Abstract

Introduction: Large chemical spaces (CSs) include traditional large compound collections, combinatorial libraries covering billions to trillions of molecules, DNA-encoded chemical libraries comprising complete combinatorial CSs in a single mixture, and virtual CSs explored by generative models. The diverse nature of these types of CSs require different chemoinformatic approaches for navigation.

Areas covered: An overview of different types of large CSs is provided. Molecular representations and similarity metrics suitable for large CS exploration are discussed. A summary of navigation of CSs in generative models is provided. Methods for characterizing and comparing CSs are discussed.

Expert opinion: The size of large CSs might restrict navigation to specialized algorithms and limit it to considering neighborhoods of structurally similar molecules. Efficient navigation of large CSs not only requires methods that scale with size but also requires smart approaches that focus on better but not necessarily larger molecule selections. Deep generative models aim to provide such approaches by implicitly learning features relevant for targeted biological properties. It is unclear whether these models can fulfill this ideal as validation is difficult as long as the covered CSs remain mainly virtual without experimental verification.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
浏览大型化学空间的化学信息学方法。
导言:大型化学空间(CS)包括传统的大型化合物集合、涵盖数十亿至数万亿分子的组合库、由单一混合物中的完整组合 CS 组成的 DNA 编码化学库,以及通过生成模型探索的虚拟 CS。这些类型的 CS 性质各异,需要采用不同的化学信息学方法进行导航:概述了不同类型的大型 CS。讨论了适合大型 CS 探索的分子表征和相似性度量。总结了生成模型中的 CS 导航。讨论了表征和比较 CS 的方法:大型 CS 的大小可能会限制专门算法的导航,并且仅限于考虑结构相似的分子邻域。高效浏览大型 CS 不仅需要能随规模扩展的方法,还需要能专注于更好但不一定更大的分子选择的智能方法。深度生成模型旨在通过隐式学习目标生物特性的相关特征来提供这种方法。目前还不清楚这些模型能否实现这一理想,因为只要所覆盖的 CS 仍主要是虚拟的,没有实验验证,就很难进行验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
10.20
自引率
1.60%
发文量
78
审稿时长
6-12 weeks
期刊介绍: Expert Opinion on Drug Discovery (ISSN 1746-0441 [print], 1746-045X [electronic]) is a MEDLINE-indexed, peer-reviewed, international journal publishing review articles on novel technologies involved in the drug discovery process, leading to new leads and reduced attrition rates. Each article is structured to incorporate the author’s own expert opinion on the scope for future development. The Editors welcome: Reviews covering chemoinformatics; bioinformatics; assay development; novel screening technologies; in vitro/in vivo models; structure-based drug design; systems biology Drug Case Histories examining the steps involved in the preclinical and clinical development of a particular drug The audience consists of scientists and managers in the healthcare and pharmaceutical industry, academic pharmaceutical scientists and other closely related professionals looking to enhance the success of their drug candidates through optimisation at the preclinical level.
期刊最新文献
Validation guidelines for drug-target prediction methods. Correction. Data-centric challenges with the application and adoption of artificial intelligence for drug discovery. Innovative strategies for the discovery of new drugs against alopecia areata: taking aim at the immune system. Scaffold hopping approaches for dual-target antitumor drug discovery: opportunities and challenges.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1