University of Cambridge > Talks.cam > Artificial Intelligence Research Group Talks (Computer Laboratory) > Structure-aware generation of molecules in protein pockets

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Structure-aware generation of molecules in protein pockets

Download to your calendar using vCal

If you have a question about this talk, please contact Mateja Jamnik .

Join us on Zoom

Searching the vast chemical space for potential drugs is intractable even for computational screening approaches, though deep generative methods have shown promise in proposing novel molecules from scratch (de-novo design). However, most models fail to incorporate 3D protein structures that are salient in designing drugs that bind to protein targets. I present a novel supervised approach that combines insights from graph-generative and 3D models and constructs drugs inside protein pockets, atom-by-atom, guided by structural information from crystallographic drug datasets. I find that the model improves binding affinities on average by 8% and druglikeness scores by 10% over the non-guided baseline, and proposes some molecules that exceed the binding scores of known ligands.

This talk is part of the Artificial Intelligence Research Group Talks (Computer Laboratory) series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Yusuf Hamied Department of Chemistry, Wolfson Lecture Theatre Cambridge Science Festival - Big Data: The missing link Postdoc Centre, 16 Mill Lane, Cambridge CB2 1SB (https://www.opda.cam.ac.uk/)

Other talks

TBC The physics of decision: how competitive systems compute, route, and remember Washing machines and their rare components: lessons from kidney patients Title to be confirmed Fairy Tales Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity