Joshua Meyers
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Joshua Meyers has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Nathan Brown
Cancer Research UK Cancer Therapeutics Unit, Division of Cancer Therapeutics, The Institute of Cancer Research, London SM2 5NG, United Kingdom
3 shared publications - Julian Blagg
Cancer Research UK Cancer Therapeutics Unit, The Institute of Cancer Research, London, UK
2 shared publications Michael Carter
The Institute of Cancer Research
2 shared publicationsNathan Brown
BenevolentAI, 4-8 Maple Street, London W1T 5HD, UK
2 shared publications- Ngai Yi Mok
The Institute of Cancer Research
2 shared publications A. Elisa Pasqua
The Institute of Cancer Research
1 shared publication
Latest Publications
- Open Access
- 19 February 2024
- Published by American Chemical Society (ACS) in ChemRxiv
FragGT: Fragment-based evolutionary molecule generation with gene types
De novo molecular design is effective for optimizing compounds with desirable properties in drug discovery. In the realm of chemoinformatics, population-based evolutionary approaches have been known for over a decade including those that use retrosynthetically inspired fragment-based workflows to to balance the generation of synthesizable molecules with a sufficiently expressive molecular generator. We describe FragGT, a fragment-based de novo molecular design approach that uses an evolutionary algorithm to optimize molecules towards an objective function. We rely on the concept of gene types to hop between related molecular fragments where a fragment's gene type is defined by the nature of its connections to adjacent groups. We show that this simple approach achieves competitive performance on the GuacaMol benchmark suite with a low computational cost and the additional benefits of transparency and practicality.
- 19 February 2024
- Published by American Chemical Society (ACS) in ChemRxiv
Open AccessFragGT: Fragment-based evolutionary molecule generation with gene types
De novo molecular design is effective for optimizing compounds with desirable properties in drug discovery. In the realm of chemoinformatics, population-based evolutionary approaches have been known for over a decade including those that use retrosynthetically inspired fragment-based workflows to to balance the generation of synthesizable molecules with a sufficiently expressive molecular generator. We describe FragGT, a fragment-based de novo molecular design approach that uses an evolutionary algorithm to optimize molecules towards an objective function. We rely on the concept of gene types to hop between related molecular fragments where a fragment's gene type is defined by the nature of its connections to adjacent groups. We show that this simple approach achieves competitive performance on the GuacaMol benchmark suite with a low computational cost and the additional benefits of transparency and practicality.
- Top Cited PapersOpen Access
- 1 November 2021
- Published by Elsevier in Drug Discovery Today
- Vol. 26 (11) , 2707-2715
De novo molecular design and generative models
- 1 November 2021
- Published by Elsevier in Drug Discovery Today
- Vol. 26 (11) , 2707-2715
Top Cited PapersOpen AccessDe novo molecular design and generative models
- Open Access
- 5 February 2020
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 60 (4) , 2356-2366
DeeplyTough: Learning Structural Comparison of Protein Binding Sites
Protein pocket matching, or binding site comparison, is of importance in drug discovery. Identification of similar binding pockets can help guide efforts for hit finding, understanding polypharmacology and characterization of protein function. The design of pocket matching methods has traditionally involved much intuition, and has employed a broad variety of algorithms and representations of the input protein structures. We regard the high heterogeneity of past work and the recent availability of large-scale benchmarks as an indicator that a data-driven approach may provide a new perspective. We propose DeeplyTough, a convolutional neural network that encodes a three-dimensional representation of protein pockets into descriptor vectors that may be compared efficiently in an alignment-free manner by computing pairwise Euclidean distances. The network is trained with supervision: (i) to provide similar pockets with similar descriptors, (ii) to separate the descriptors of dissimilar pockets by a minimum margin, and (iii) to achieve robustness to nuisance variations. We evaluate our method using three large-scale benchmark datasets, on which it demonstrates excellent performance for held-out data coming from the training distribution and competitive performance when the trained network is required to generalize to datasets constructed independently. DeeplyTough is available at https://github.com/BenevolentAI/DeeplyTough.
- 5 February 2020
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 60 (4) , 2356-2366
Open AccessDeeplyTough: Learning Structural Comparison of Protein Binding Sites
Protein pocket matching, or binding site comparison, is of importance in drug discovery. Identification of similar binding pockets can help guide efforts for hit finding, understanding polypharmacology and characterization of protein function. The design of pocket matching methods has traditionally involved much intuition, and has employed a broad variety of algorithms and representations of the input protein structures. We regard the high heterogeneity of past work and the recent availability of large-scale benchmarks as an indicator that a data-driven approach may provide a new perspective. We propose DeeplyTough, a convolutional neural network that encodes a three-dimensional representation of protein pockets into descriptor vectors that may be compared efficiently in an alignment-free manner by computing pairwise Euclidean distances. The network is trained with supervision: (i) to provide similar pockets with similar descriptors, (ii) to separate the descriptors of dissimilar pockets by a minimum margin, and (iii) to achieve robustness to nuisance variations. We evaluate our method using three large-scale benchmark datasets, on which it demonstrates excellent performance for held-out data coming from the training distribution and competitive performance when the trained network is required to generalize to datasets constructed independently. DeeplyTough is available at https://github.com/BenevolentAI/DeeplyTough.
- Open Access
DeeplyTough: Learning Structural Comparison of Protein Binding Sites
Motivation: Protein binding site comparison (pocket matching) is of importance in drug discovery. Identification of similar binding sites can help guide efforts for hit finding, understanding polypharmacology and characterization of protein function. The design of pocket matching methods has traditionally involved much intuition, and has employed a broad variety of algorithms and representations of the input protein structures. We regard the high heterogeneity of past work and the recent availability of large-scale benchmarks as an indicator that a data-driven approach may provide a new perspective. Results: We propose DeeplyTough, a convolutional neural network that encodes a three-dimensional representation of protein binding sites into descriptor vectors that may be compared efficiently in an alignment-free manner by computing pairwise Euclidean distances. The network is trained with supervision: (i) to provide similar pockets with similar descriptors, (ii) to separate the descriptors of dissimilar pockets by a minimum margin, and (iii) to achieve robustness to nuisance variations. We evaluate our method using three large-scale benchmark datasets, on which it demonstrates excellent performance for held-out data coming from the training distribution and competitive performance when the trained network is required to generalize to datasets constructed independently. Availability: https://github.com/BenevolentAI/DeeplyTough Contact: martin.simonovsky@enpc.fr , joshua.meyers@benevolent.ai
Open AccessDeeplyTough: Learning Structural Comparison of Protein Binding Sites
Motivation: Protein binding site comparison (pocket matching) is of importance in drug discovery. Identification of similar binding sites can help guide efforts for hit finding, understanding polypharmacology and characterization of protein function. The design of pocket matching methods has traditionally involved much intuition, and has employed a broad variety of algorithms and representations of the input protein structures. We regard the high heterogeneity of past work and the recent availability of large-scale benchmarks as an indicator that a data-driven approach may provide a new perspective. Results: We propose DeeplyTough, a convolutional neural network that encodes a three-dimensional representation of protein binding sites into descriptor vectors that may be compared efficiently in an alignment-free manner by computing pairwise Euclidean distances. The network is trained with supervision: (i) to provide similar pockets with similar descriptors, (ii) to separate the descriptors of dissimilar pockets by a minimum margin, and (iii) to achieve robustness to nuisance variations. We evaluate our method using three large-scale benchmark datasets, on which it demonstrates excellent performance for held-out data coming from the training distribution and competitive performance when the trained network is required to generalize to datasets constructed independently. Availability: https://github.com/BenevolentAI/DeeplyTough Contact: martin.simonovsky@enpc.fr , joshua.meyers@benevolent.ai
- Open Access
- 16 November 2018
- Published by American Chemical Society (ACS) in ACS Medicinal Chemistry Letters
- Vol. 9 (12) , 1199-1204
Privileged Structures and Polypharmacology within and between Protein Families
Polypharmacology is often a key contributor to the efficacy of a drug, but is also a potential risk. We investigated two hits discovered via a cell-based phenotypic screen, the CDK9 inhibitor CCT250006 (1) and the pirin ligand CCT245232 (2), to establish methodology to elucidate their secondary protein targets. Using computational pocket-based analysis, we discovered intrafamily polypharmacology for our kinase inhibitor, despite little overall sequence identity. The interfamily polypharmacology of 2 with B-Raf was used to discover a novel pirin ligand from a very small but privileged compound library despite no apparent ligand or binding site similarity. Our data demonstrates that in areas of drug discovery where intrafamily polypharmacology is often an issue, ligand dissimilarity cannot necessarily be used to assume different off-target profiles and that understanding interfamily polypharmacology will be important in the future to reduce the risk of idiopathic toxicity and in the design of screening libraries.
- 16 November 2018
- Published by American Chemical Society (ACS) in ACS Medicinal Chemistry Letters
- Vol. 9 (12) , 1199-1204
Open AccessPrivileged Structures and Polypharmacology within and between Protein Families
Polypharmacology is often a key contributor to the efficacy of a drug, but is also a potential risk. We investigated two hits discovered via a cell-based phenotypic screen, the CDK9 inhibitor CCT250006 (1) and the pirin ligand CCT245232 (2), to establish methodology to elucidate their secondary protein targets. Using computational pocket-based analysis, we discovered intrafamily polypharmacology for our kinase inhibitor, despite little overall sequence identity. The interfamily polypharmacology of 2 with B-Raf was used to discover a novel pirin ligand from a very small but privileged compound library despite no apparent ligand or binding site similarity. Our data demonstrates that in areas of drug discovery where intrafamily polypharmacology is often an issue, ligand dissimilarity cannot necessarily be used to assume different off-target profiles and that understanding interfamily polypharmacology will be important in the future to reduce the risk of idiopathic toxicity and in the design of screening libraries.
- Open Access
- 12 July 2017
- Published by Royal Society of Chemistry (RSC) in Chemical Communications
- Vol. 53 (61) , 8529-8532
Evaluation of DFO-HOPO as an octadentate chelator for zirconium-89
The future of 89Zr-based immuno-PET is reliant upon the development of new chelators with improved stability compared to the currently used deferoxamine (DFO).
- 12 July 2017
- Published by Royal Society of Chemistry (RSC) in Chemical Communications
- Vol. 53 (61) , 8529-8532
Open AccessEvaluation of DFO-HOPO as an octadentate chelator for zirconium-89
The future of 89Zr-based immuno-PET is reliant upon the development of new chelators with improved stability compared to the currently used deferoxamine (DFO).
- Open Access
- 6 December 2016
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 8 (1) , 1-13
Mapping the 3D structures of small molecule binding sites
Analysis of the 3D structures of protein–ligand binding sites can provide valuable insights for drug discovery. Binding site comparison (BSC) studies can be employed to elucidate the function of orphan proteins or to predict the potential for polypharmacology. Many previous binding site analyses only consider binding sites surrounding an experimentally observed bound ligand. To encompass potential protein–ligand binding sites that do not have ligands known to bind, we have incorporated fpocket cavity detection software and assessed the impact of this inclusion on BSC performance. Using fpocket, we generated a database of ligand-independent potential binding sites and applied the BSC tool, SiteHopper, to analyze similarity relationships between protein binding sites. We developed a method for clustering potential binding sites using a curated dataset of structures for six therapeutically relevant proteins from diverse protein classes in the protein data bank. Two clustering methods were explored; hierarchical clustering and a density-based method adept at excluding noise and outliers from a dataset. We introduce circular plots to visualize binding site structure space. From the datasets analyzed in this study, we highlight a structural relationship between binding sites of cationic trypsin and prothrombin, protein targets known to bind structurally similar small molecules, exemplifying the potential utility of objectively and holistically mapping binding site space from the structural proteome. We present a workflow for the objective mapping of potential protein–ligand binding sites derived from the currently available structural proteome. We show that ligand-independent binding site detection tools can be introduced without excessive penalty on BSC performance. Clustering combined with intuitive visualization tools can be applied to map relationships between the 3D structures of protein binding sites.
- 6 December 2016
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 8 (1) , 1-13
Open AccessMapping the 3D structures of small molecule binding sites
Analysis of the 3D structures of protein–ligand binding sites can provide valuable insights for drug discovery. Binding site comparison (BSC) studies can be employed to elucidate the function of orphan proteins or to predict the potential for polypharmacology. Many previous binding site analyses only consider binding sites surrounding an experimentally observed bound ligand. To encompass potential protein–ligand binding sites that do not have ligands known to bind, we have incorporated fpocket cavity detection software and assessed the impact of this inclusion on BSC performance. Using fpocket, we generated a database of ligand-independent potential binding sites and applied the BSC tool, SiteHopper, to analyze similarity relationships between protein binding sites. We developed a method for clustering potential binding sites using a curated dataset of structures for six therapeutically relevant proteins from diverse protein classes in the protein data bank. Two clustering methods were explored; hierarchical clustering and a density-based method adept at excluding noise and outliers from a dataset. We introduce circular plots to visualize binding site structure space. From the datasets analyzed in this study, we highlight a structural relationship between binding sites of cationic trypsin and prothrombin, protein targets known to bind structurally similar small molecules, exemplifying the potential utility of objectively and holistically mapping binding site space from the structural proteome. We present a workflow for the objective mapping of potential protein–ligand binding sites derived from the currently available structural proteome. We show that ligand-independent binding site detection tools can be introduced without excessive penalty on BSC performance. Clustering combined with intuitive visualization tools can be applied to map relationships between the 3D structures of protein binding sites.
- Open Access
- 30 August 2016
- Published by Taylor & Francis in Future Medicinal Chemistry
- Vol. 8 (14) , 1753-1767
On the Origins of Three-Dimensionality in Drug-Like Molecules
Aim: Many medicinal chemistry-relevant structures and core scaffolds tend toward geometric planarity, which hampers the optimization of physicochemical properties desirable in drug-like molecules. ...
- 30 August 2016
- Published by Taylor & Francis in Future Medicinal Chemistry
- Vol. 8 (14) , 1753-1767
Open AccessOn the Origins of Three-Dimensionality in Drug-Like Molecules
Aim: Many medicinal chemistry-relevant structures and core scaffolds tend toward geometric planarity, which hampers the optimization of physicochemical properties desirable in drug-like molecules. ...