On the String Kernel Pre-Image Problem with Applications in Drug Discovery
원문 초록
The pre-image problem has to be solved during inference by most structured output predictors. For string kernels, this problem corresponds to finding the string associated to a given input. An algorithm capable of solving or finding good approximations to this problem would have many applications in computational biology and other fields. This work uses a recent result on combinatorial optimization of linear predictors based on string kernels to develop, for the pre-image, a low complexity upper bound valid for many string kernels. This upper bound is used with success in a branch and bound searching algorithm. Applications and results in the discovery of druggable peptides are presented and discussed.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
PocketVina Enables Scalable and Highly Accurate Physically Valid Docking through Multi-Pocket Conditioning
Latent Guided Sampling for Combinatorial Optimization
Reimagining Target-Aware Molecular Generation through Retrieval-Enhanced Aligned Diffusion
Applications of Modular Co-Design for De Novo 3D Molecule Generation
A Comprehensive Benchmarking Platform for Deep Generative Models in Molecular Design
MetaMolGen: A Neural Graph Motif Generation Model for De Novo Molecular Design
토론
이 논문과 연결된 포럼 글이 아직 없습니다.