Search bioRxiv⌕ Search

Biology subjects

Deane, C. M.

Publications and source records attributed to Deane, C. M..

At least 55 records · Page 3Linked to original sources

The use of a graph database is a complementary approach to a classical similarity search for identifying commercially available fragment merges

AO_SCPLOWBSTRACTC_SCPLOWFragment screening using X-ray crystallography can yield rich structural data to help guide the optimization of low-molecular-weight compounds into more potent binders. Fragment merging, whereby substructural motifs from partially overlapping fragments are incorporated into a single larger compound, represents a potentially powerful and efficient approach for increasing potency. Searching commercial catalogues provides one useful way to quickly and cheaply identify follow-up compounds for purchase and further screening, and circumvents the challenge of synthetic accessibility. The Fragment Network is a graph database that provides a novel way to explore the chemical space surrounding fragment hits. We use an iteration of the database containing >120 million catalogue compounds to find fragment merges for four XChem fragment screening campaigns. Retrieved molecules were filtered using a pipeline of 2D and 3D filters and contrasted against a traditional fingerprint-based similarity search. The two search techniques were found to have complementary results, identifying merges in different regions of chemical space. Both techniques were able to identify merges that are predicted to replicate the interactions made by the parent fragments. This work demonstrates the use of the Fragment Network to increase the yield of fragment merges beyond that of a classical catalogue search, thus increasing the likelihood of finding promising follow-up compounds. We present a pipeline that is able to systematically exploit all known fragment hits by performing large-scale enumeration of all possible fragment pairs for merging.

bioinformatics↗

Challenges in antibody structure prediction

The tremendous advances in structural biology and the exponential increase of high-quality experimental structures available in the PDB motivated numerous studies to tackle the grand challenge of predicting protein structures. AlphaFold2 revolutionized the field of protein structure prediction, by combining artificial intelligence with evolutionary information. Antibodies are one of the most important classes of biotherapeutic proteins. Accurate structure models are a prerequisite to advance biophysical property predictions and consequently antibody design. Various specialized tools are available to predict antibody structures based on different principles and profiting from current advances in protein structure prediction based on artificial intelligence. Here, we want to emphasize the importance of reliable protein structure models and highlight the enormous advances in the field. At the same time, we want to raise the awareness that protein structure models--and in particular antibody models--may suffer from structural inaccuracies, namely incorrect cis-amid bonds, wrong stereochemistry or clashes. We show that these inaccuracies affect biophysical property predictions such as surface hydrophobicity. Thus, we stress the significance of carefully reviewing protein structure models before investing further computing power and setting up experiments. To facilitate the assessment of model quality, we provide a tool "TopModel" to validate structure models.

bioinformatics↗

ImmuneBuilder: Deep-Learning models for predicting the structures of immune proteins.

Immune receptor proteins play a key role in the immune system and have shown great promise as biotherapeutics. The structure of these proteins is critical for understanding their antigen binding properties. Here, we present ImmuneBuilder, a set of deep learning models trained to accurately predict the structure of antibodies (ABodyBuilder2), nanobodies (NanoBodyBuilder2) and T-Cell receptors (TCRBuilder2). We show that ImmuneBuilder generates structures with state of the art accuracy while being far faster than AlphaFold2. For example, on a benchmark of 34 recently solved antibodies, ABodyBuilder2 predicts CDR-H3 loops with an RMSD of 2.81[A], a 0.09[A] improvement over AlphaFold-Multimer, while being over a hundred times faster. Similar results are also achieved for nanobodies, (NanoBodyBuilder2 predicts CDR-H3 loops with an average RMSD of 2.89[A], a 0.55[A] improvement over AlphaFold2) and TCRs. By predicting an ensemble of structures, ImmuneBuilder also gives an error estimate for every residue in its final prediction. ImmuneBuilder is made freely available, both to download (https://github.com/oxpig/ImmuneBuilder) and to use via our webserver (http://opig.stats.ox.ac.uk/webapps/newsabdab/sabpred). We also make available structural models for ~150 thousand non-redundant paired antibody sequences (https://zenodo.org/record/7258553).

bioinformatics↗

KA-Search: Rapid and exhaustive sequence identity search of known antibodies

Antibodies with similar amino acid sequences, especially across their complementary-determining regions, often share properties. Finding that an antibody of interest has a similar sequence to naturally expressed antibodies in healthy or diseased repertoires is a powerful approach for the prediction of antibody properties, such as immunogenicity or antigen specificity. However, as the number of available antibody sequences is now in the billions and continuing to grow, repertoire mining for similar sequences has become increasingly computationally expensive. Existing approaches are limited by either being low-throughput, non-exhaustive, not antibody specific, or only searching against entire chain sequences. Therefore, there is a need for a specialized tool, optimized for a rapid and exhaustive search of any antibody region against all known antibodies, to better utilize the full breadth of available repertoire sequences. We introduce Known Antibody Search (KA-Search), a tool that allows for the rapid search of billions of antibody sequences by sequence identity across either the whole chain, the complementarity-determining regions, or a user defined antibody region. We show KA-Search in operation on the [~]2.4 billion antibody sequences available in the OAS database. KA-Search can be used to find the most similar sequences from OAS within 30 minutes using 5 CPUs. We give examples of how KA-Search can be used to obtain new insights about an antibody of interest. KA-Search is freely available at https://github.com/oxpig/kasearch.

bioinformatics↗

PointVS: A Machine Learning Scoring Function that Identifies Important Binding Interactions

Over the last few years, many machine learning-based scoring functions for predicting the binding of small molecules to proteins have been developed. Their objective is to approximate the distribution which takes two molecules as input and outputs the energy of their interaction. Only a scoring function that accounts for the interatomic interactions involved in binding can accurately predict binding affinity on unseen molecules. However, many scoring functions make predictions based on dataset biases rather than an understanding of the physics of binding. These scoring functions perform well when tested on similar targets to those in the training set, but fail to generalise to dissimilar targets. To test what a machine learning-based scoring function has learnt, input attribution--a technique for learning which features are important to a model when making a prediction on a particular data point--can be applied. If a model successfully learns something beyond dataset biases, attribution should give insight into the important binding interactions that are taking place. We built a machine learning-based scoring function that aimed to avoid the influence of bias via thorough train and test dataset filtering, and show that it achieves comparable performance on the CASF-2016 benchmark to other leading methods. We then use the CASF-2016 test set to perform attribution, and find that the bonds identified as important by PointVS, unlike those extracted from other scoring functions, have a high correlation with those found by a distance-based interaction profiler. We then show that attribution can be used to extract important binding pharmacophores from a given protein target when supplied with a number of bound structures. We use this information to perform fragment elaboration, and see improvements in docking scores compared to using structural information from a traditional, data-based approach. This not only provides definitive proof that the scoring function has learnt to identify some important binding interactions, but also constitutes the first deep learning-based method for extracting structural information from a target for molecule design.

bioinformatics↗

Why Many Molecular Simulation Research Findings Might Be False: An Analysis of Inter-Simulations Differences Based on Simulation Time and Number of Replicas

Molecular simulations are a common technique to investigate the dynamics of proteins, DNA and RNA. A typical application is the simulation of a wild-type structure and a mutant structure where the mutant has a significantly higher (or lower) potency to trigger a signalling cascade. The study would then analyse the observed differences between the wild-type and mutant simulation and link these to their differences. However differences in the simulations cannot always be reproduced by other research groups even if the same parameters as in the original simulations are used. This is caused by the rugged energy landscape of many biological structures which means that minor differences in hardware or software can cause simulation to take different paths. This would not be a problem if the simulation time would be infinitely long but in real life the simulation time is always finite. In this study we use large scale molecular simulations of four different systems (a 10-mer peptide wild-type and mutant as well as a T-cell receptor, peptide and MHC complex as wild-type and mutant) with 100 replicas each totalling 620 000 ns to quantify the magnitude of (non-) reproducibility when comparing inter-simulation differences (e.g. wild-type vs mutant). Using a bootstrapping approach we found that simulation times of at least 2 to 3 times the experimental folding time using a minimum of 3 replicas are necessary for reproducible results. However, for most complexes of interest such long simulation times are far out of reach which means that it is only possible to sample the local phase space neighbourhood of the x-ray structure. To sample this neighbourhood reliably around 10 to 20 replicas are needed. Graphical abstract O_FIG O_LINKSMALLFIG WIDTH=200 HEIGHT=122 SRC="FIGDIR/small/504950v1_ufig1.gif" ALT="Figure 1"> View larger version (19K): org.highwire.dtl.DTLVardef@530c47org.highwire.dtl.DTLVardef@4b1aeborg.highwire.dtl.DTLVardef@d47906org.highwire.dtl.DTLVardef@155a679_HPS_FORMAT_FIGEXP M_FIG C_FIG

bioinformatics↗

Testing the Limits of SMILES-based De Novo Molecular Generation with Curriculum and Deep Reinforcement Learning

1Deep reinforcement learning methods have been shown to be potentially powerful tools for de novo design. Recurrent neural network (RNN)-based techniques are the most widely used methods in this space. In this work, we examine the behaviour of RNN-based methods when there are few (or no) examples of molecules with the desired properties in the training data. We find that targeted molecular generation is often possible, but the diversity of generated molecules is often reduced, and it is not possible to control the composition of generated molecular sets. To help overcome these issues, we propose a new curriculum learning-inspired, recurrent Iterative Optimisation Procedure that enables the optimisation of generated molecules for seen and unseen molecular profiles and allows the user to control whether a molecular profile is explored or exploited. Using our method, we generate specific and diverse sets of molecules with up to 18 times more scaffolds than standard methods for the same sample size. However, our results also point to significant limitations of one-dimensional molecular representations as used in this space. We find that the success or failure of a given molecular optimisation problem depends on the choice of SMILES.

bioinformatics↗

Computationally profiling peptide:MHC recognition by T-cell receptors and T-cell receptor-mimetic antibodies

T-cell receptor-mimetic antibodies (TCRms) targeting disease-associated peptides presented by Major Histocompatibility Complexes (pMHCs) are set to become a major new drug modality. However, we lack a general understanding of how TCRms engage pMHC targets, which is crucial for predicting their specificity and safety. Several new structures of TCRm:pMHC complexes have become available in the past year, providing sufficient initial data for a holistic analysis of TCRms as a class of pMHC binding agents. Here, we profile the complete set of TCRm:pMHC complexes against representative TCR:pMHC complexes to quantify the TCR-likeness of their pMHC engagement. We find that intrinsic molecular differences between antibodies and TCRs lead to fundamentally different roles for their heavy/light chains and Complementarity-Determining Region loops during antigen recognition. The idiotypic properties of antibodies may increase the likelihood of TCRms engaging pMHCs with less peptide selectivity than TCRs. However, the pMHC recognition features of some TCRms, including the two TCRms currently in clinical trials, can be remarkably TCR-like. The insights gained from this study will aid in the rational design and optimisation of next-generation TCRms.

immunology↗

Characterisation of the immune repertoire of a humanised transgenic mouse through immunophenotyping and high-throughput sequencing

Immunoglobulin loci-transgenic animals are widely used in antibody discovery and increasingly in vaccine response modelling. In this study, we phenotypically characterised B-cell populations from the Intelliselect(R) Transgenic mouse (Kymouse) demonstrating full B-cell development competence. Comparison of the naive B-cell receptor (BCR) repertoires of Kymice BCRs naive human and murine BCR repertoires revealed key differences in germline gene usage and junctional diversification. These differences result in Kymice having CDRH3 length and diversity intermediate between mice and humans. To compare the structural space explored by CDRH3s in each species repertoire, we used computational structure prediction to show that Kymouse naive BCR repertoires are more human-like than mouse-like in their predicted distribution of CDRH3 shape. Our combined sequence and structural analysis indicates that the naive Kymouse BCR repertoire is diverse with key similarities to human repertoires, while immunophenotyping confirms that selected naive B-cells are able to go through complete development.

immunology↗

Paragraph - Antibody paratope prediction using Graph Neural Networks with minimal feature vectors

1SummaryThe development of new vaccines and antibody therapeutics typically takes several years and requires over $1bn in investment. Accurate knowledge of the paratope (antibody binding site) can speed up and reduce the cost of this process by improving our understanding of antibody-antigen binding. We present Paragraph, a structure-based paratope prediction tool that outperforms current state-of-the-art tools using simpler feature vectors and no antigen information. AvailabilitySource code is freely available at www.github.com/oxpig Contactdeane@stats.ox.ac.uk Supplementary informationSupplementary data are available at bioRxiv online.

bioinformatics↗

Fragment libraries designed to be functionally diverse recover protein binding information more efficiently than standard structurally diverse libraries

Current fragment-based drug design relies on the efficient exploration of chemical space though the use of structurally diverse libraries of small fragments. However, structurally dissimilar compounds can exploit the same interactions on a target, and thus be functionally similar. Using 3D structures of many fragments bound to multiple targets, we examined if there exists a better strategy for selecting fragments for screening libraries. We show that structurally diverse fragments can be described as functionally redundant, often making the same interactions. Ranking fragments by the number of novel interactions they made, we show that functionally diverse selections of fragments substantially increase the amount of information recovered for unseen targets compared to other methods of selection. Using these results, we design small functionally efficient libraries that are able to give significantly more information about new protein targets than similarly sized structurally diverse libraries. By covering more functional space (rather than chemical space), more diverse sets of drug leads can be generated, increasing the chances of fragment screens resulting in viable drug candidates.

bioinformatics↗

Protein-Ligand Interaction Graphs: Learning from Ligand-Shaped 3D Interaction Graphs to Improve Binding Affinity Prediction

Graph Neural Networks (GNNs) have recently gained in popularity, challenging molecular fingerprints or SMILES-based representations as the predominant way to represent molecules for binding affinity prediction. Although simple ligand-based graphs alone are already useful for affinity prediction, better performance on multi-target datasets has been achieved with models that incorporate 3D structural information. Most recent advances utilize complex GNN architectures to capture 3D protein-ligand information by incorporating ligand-interacting protein atoms as additional nodes in the graphs; or by building a second protein-based graph in parallel. This expands the graph considerably while obfuscating the shape of the underlying ligand, diminishing the advantage that GNNs have when encoding molecular structures. There is therefore a need for a simple and elegant molecular graph representation that retains the topology of the ligand while simultaneously encoding 3D protein-ligand interactions. We present Protein-Ligand Interaction Graphs (PLIGs): a simple way of representing atom-atom contacts of 3D protein-ligand complexes as node features for GNNs. PLIGs featurize an atom node in the molecular graph by describing each atoms properties as well as all atom-atom contacts made with protein atoms within a distance threshold. The edges of the graph are therefore identical to ligand-based graphs, but the nodes encode the 3D protein-ligand contacts. Since PLIGs are applicable to any GNN architecture, we have benchmarked their performance with six different GNN architectures, and compared them to conventional ligand-based graphs and fingerprint-based multi-layer perceptron (MLP) models using the CASF-2016 benchmark set where we found PLIG-based Graph Attention Networks (GATNet) to be the best performing model ({rho}=0.84, RMSE=1.22 pK). In summary, we created a novel graph-based representation that incorporates 3D structural information into the node features of ligand-shaped molecular graphs. The PLIG representation is simple, elegant, flexible and easily customizable, opening up many possibilities of incorporating other 2D and 3D properties into the graph. AccessThe code and implementation for PLIGs and all models can be found at github.com/MarcMoesser/Protein-Ligand-Interaction-Graphs.

bioinformatics↗

AbLang: An antibody language model for completing antibody sequences

MotivationGeneral protein language models have been shown to summarise the semantics of protein sequences into representations that are useful for state-of-the-art predictive methods. However, for antibody specific problems, such as restoring residues lost due to sequencing errors, a model trained solely on antibodies may be more powerful. Antibodies are one of the few protein types where the volume of sequence data needed for such language models is available, for example in the Observed Antibody Space (OAS) database. ResultsHere, we introduce AbLang, a language model trained on the antibody sequences in the OAS database. We demonstrate the power of AbLang by using it to restore missing residues in antibody sequence data, a key issue with B-cell receptor repertoire sequencing, over 40% of OAS sequences are missing the first 15 amino acids. AbLang restores the missing residues of antibody sequences better than using IMGT germlines or the general protein language model ESM-1b. Further, AbLang does not require knowledge of the germline of the antibody and is seven times faster than ESM-1b. Availability and ImplementationAbLang is a python package available at https://github.com/oxpig/AbLang.

bioinformatics↗

Incorporating Target-Specific Pharmacophoric Information Into Deep Generative Models For Fragment Elaboration

Despite recent interest in deep generative models for scaffold elaboration, their applicability to fragment-to-lead campaigns has so far been limited. This is primarily due to their inability to account for local protein structure or a users design hypothesis. We propose a novel method for fragment elaboration, STRIFE that overcomes these issues. STRIFE takes as input Fragment Hotspot Maps (FHMs) extracted from a protein target, and processes them to provide meaningful and interpretable structural information to its generative model, which in turn is able to rapidly generate elaborations with complementary pharmacophores to the protein. In a large-scale evaluation, STRIFE outperforms existing, structure-unaware, fragment elaboration methods in proposing highly ligand efficient elaborations. In addition to automatically extracting pharmacophoric information from a protein targets FHM, STRIFE optionally allows the user to specify their own design hypotheses.

systems biology↗

Different B cell subpopulations show distinct patterns in their IgH repertoire metrics

BackgroundSeveral human B-cell subpopulations are recognized in the peripheral blood, which play distinct roles in the humoral immune response. These cells undergo developmental and maturational changes involving VDJ recombination, somatic hypermutation and class switch recombination, altogether shaping their immunoglobulin heavy chain (IgH) repertoire. MethodsHere, we sequenced the IgH repertoire of naive, marginal zone, switched and plasma cells from 10 healthy adults along with matched unsorted and in silico separated CD19+ bulk B cells. We used advanced bioinformatic analysis and machine learning to thoroughly examine and compare these repertoires. ResultsWe show that sorted B cell subpopulations are characterised by distinct repertoire characteristics on both the individual sequence and the repertoire level. Sorted subpopulations shared similar repertoire characteristics with their corresponding in silico separated subsets. Furthermore, certain IgH repertoire characteristics correlated with the position of the constant region on the IgH locus. ConclusionOverall, this study provides unprecedented insight over mechanisms of B cell repertoire control in peripherally circulating B cell subpopulations.

immunology↗

ABlooper: Fast accurate antibody CDR loop structure prediction with accuracy estimation

Antibodies are a key component of the immune system and have been extensively used as biotherapeutics. Accurate knowledge of their structure is central to understanding their antigen binding function. The key area for antigen binding and the main area of structural variation in antibodies is concentrated in the six complementarity determining regions (CDRs), with the most important for binding and most variable being the CDR-H3 loop. The sequence and structural variability of CDR-H3 make it particularly challenging to model. Recently deep learning methods have offered a step change in our ability to predict protein structures. In this work we present ABlooper, an end-to-end equivariant deep-learning based CDR loop structure prediction tool. ABlooper rapidly predicts the structure of CDR loops with high accuracy and provides a confidence estimate for each of its predictions. On the models of the Rosetta Antibody Benchmark, ABlooper makes predictions with an average CDR-H3 RMSD of 2.49[A], which drops to 2.05[A] when considering only its 76% most confident predictions.

bioinformatics↗

Deep Generative Design with 3D Pharmacophoric Constraints

Generative models have increasingly been proposed as a solution to the molecular design problem. However, it has proved challenging to control the design process or incorporate prior knowledge, limiting their practical use in drug discovery. In particular, generative methods have made limited use of three-dimensional (3D) structural information even though this is critical to binding. This work describes a method to incorporate such information and demonstrates the benefit of doing so. We combine an existing graph-based deep generative model, DeLinker, with a convolutional neural network to utilise physically-meaningful 3D representations of molecules and target pharmacophores. We apply our model, DEVELOP, to both linker and R-group design, demonstrating its suitability for both hit-to-lead and lead optimisation. The 3D pharmacophoric information results in improved generation and allows greater control of the design process. In multiple large-scale evaluations, we show that including 3D pharmacophoric constraints results in substantial improvements in the quality of generated molecules. On a challenging test set derived from PDBbind, our model improves the proportion of generated molecules with high 3D similarity to the original molecule by over 300%. In addition, DEVELOP recovers 10 x more of the original molecules compared to the base-line DeLinker method. Our approach is general-purpose, readily modifiable to alternate 3D representations, and can be incorporated into other generative frameworks. Code is available at https://github.com/oxpig/DEVELOP.

bioinformatics↗

Epitope profiling of coronavirus-binding antibodies using computational structural modelling

Identifying the epitope of an antibody is a key step in understanding its function and its potential as a therapeutic. It is well-established in the literature that sequence-based clonal clustering can identify antibodies with similar epitope complementarity. However, there is growing evidence that antibodies from markedly different lineages but with similar structures can engage the same epitope with near-identical binding modes. Here, we describe a novel computational method for epitope profiling based on structural modelling and clustering, and show how it can identify sequence-dissimilar antibodies that engage the same epitope. We start by searching for evidence of structural conservation across the latest solved SARS-CoV-2--binding antibody crystal structures. Despite the relatively small number of solved structures, we find numerous examples of sequence-diverse but structurally-similar coronavirus-binding antibodies engaging the same epitope. We therefore developed a high-throughput structural modeling and clustering method to identify functionally-similar antibodies across the set of thousands of coronavirus-binding antibody sequences in the Coronavirus Antibody Database (CoV-AbDab). In the resulting multiple-occupancy structural clusters, 92% bind to consistent domains based on CoV-AbDab metadata. Our approach functionally links antibodies with distinct genetic lineages, species origins, and coronavirus specificities. This indicates greater convergence exists in the immune responses to coronaviruses than would be suggested by sequence-based approaches. Our results show that applying structural analytics to large class-specific antibody databases will enable high confidence structure-function relationships to be drawn, yielding new opportunities to identify functional convergence hitherto missed by sequence-only analysis.

immunology↗