Computational Antibody Papers

Filter by tags
All
Filter by published year
All
TitleKey points
    • Nice developability dataset with associated computational modeling.
    • A total of 334 antibodies were initially characterized, with a subset of 43 antibodies selected for in vivo pharmacokinetic (PK) assessment. These data points included high-throughput developability assays and various physicochemical measurements.
    • A multivariate regression model, using Partial Least Squares (PLS) regression, was developed. This model combined multiple in vitro measures (nonspecific interactions, self-association, and FcRn binding) to predict in vivo clearance, significantly improving PK correlation over individual assays.
  • 2025-02-03

    Benchmarking Inverse Folding Models for Antibody CDR Sequence Design

    • generative methods
    • protein design
    • nanobodies
    • Benchmarking of sequence design methods that are structure-conditioned
    • ESM-IF, LM-Design, ProteinMPNN and AntiFold were benchmarked.
    • On sequence recovery, AntiFold beats others on antibodies, but LM-Design is better when VHHs are considered.
    • AntiFold makes minimal use of the antigen information.
    • ESM-IF and ProteinMPNN have some weak correlation with affinity data.
  • 2025-02-03

    Clinical antibody ADA

    • developability
    • clinical trials
    • Authors study 171 Roche clinical studies representing 28 drugs for their ADA incidence.
    • Authors demonstrate that ADA is highly context-specific with non-trivial inter-drug variation and factors such as disease or mode of action impacting the incidence.
    • They train a random forest model on T-cell epitope predictions and a model combined with non-epitope features. The extended model, including non-epitope features performs better than the one that is solely sequence-based.
    • Novel method to design antibodies in silico with experimental validation.
    • The actual computational method is not disclosed.
    • The computational method takes target sequence/structure and constraints where the antibody should bind. The structure and sequence are then produced.
    • Method can generate nanomolar grade binders.
    • The main interesting take-away is test-time compute. By feeding the answers of the model back to itself, it produces better binders and does not compromise on diversity of the designs.
    • Computational framework to calculate descriptors correlating with certain developability features for early antibody screening.
    • The framework calculates a number of sequence and structural descriptors.
    • The correlations were demonstrated to bring value on a HIC and viscosity datasets.
    • Exact calculation of descriptors takes time, so authors showed that it is possible to train a ML model to get the descriptors right away from sequence.
    • Computational analysis of pK (clearance) of biologics based on a dataset collated for this publication.
    • Authors collated a set of 64 therapeutic antibodies and their clearances.
    • Here, they defined fast clearance as more than 5.4 mL/day/kg. 48 antibodies fel below this threshold and 16 above.
    • They tested whether any single computationally calculated property (e.g. isoelectric point etc.) determines fast vs slow clearance.
    • No single computational property was a good discriminator.
    • THey constructed a random forest algorithm and showed that the poly specify reagent (PSR), which is an in vitro property and isoelectrip point, which can be computationally calculated are the strong discriminators according to the model.
    • Authors revisit computational calculations from sequence and structure to filter out clinical stage therapeutics as an alternative/refinement to the popular TAP metrics.
    • Authors explain how the FvCSP charge asymmetry calculated in TAP might not be the ideal formulation.
    • They introduce FV_CHML which as opposed to FvCSP is a difference between the net charges.
    • Of the several computational metrics employed they show that the FV_CHML metric captures most of the clinical stage therapeutics.
    • They analyse the effect of the isotype, demonstrating that for accurate pI calculations, constant region should be modeled and not only the Fv
    • They propose four descriptors that appear to show good degree of separation of natural vs clinical antibodies and some correlation with the experimental values: 1. Patch_cdr_hyd - hydrophobicity of CDRs, not the same as in TAP 2. ens_charge_Fv - in lieu of PPC and PNC from TAP 3. Cdr_len - these separate repertoire from clinical abs. 4. Fv_chml - in lieu of FvCSP from TAP
    • Novel experimental/computational workflow that demonstrates how little data might be needed to develop antibody affinity predictors.
    • Mice were immunized with hen egg white lysozyme and via computational procedure of clustering with known binders 35 antibodies were characterized together with their affinities.
    • These 35 antibodies were used to train the methods: Gaussian Process (GP) models with Matern and RBF kernels, Kernel Ridge Regression (KRR), Random Forest (RF) and Linear Regression (used as a baseline).
    • Seed sequences were point or double-mutated and their affinity predicted using GP (that performed the best). Eight mutants predicted to span the whole range of affinities were selected for experimental testing and they had very good agreement with the predictions.
    • Novel masking scheme for antibody sequences with applications to Vh-Vl pairing and specificity prediction.
    • Since antibodies have intrinsically biased mutation patterns in favor of CDRs, the authors questioned the canonical 15% uniform masking procedure in antibody language models.
    • They focused the masking on the CDR3 regions during training which resulted in faster convergence.
    • They tested pairing prediction of Vh/Vl and they noticed 60% random vs non-random pairing accuracy.
    • Novel algorithm to perform structural search of proteins and at the same time introduces an innovative way to encode protein structures
    • It encodes protein structures as sequences over a 20-state 3Di alphabet, representing tertiary residue-residue interactions (Ca of neighboring residues) rather than backbone conformations, enabling faster sequence-based comparisons.
    • The 3Di alphabet and substitution matrix were trained on the SCOPe40 dataset (~11k structures), which consists of manually classified single-domain protein structures clustered at 40% sequence identity.
    • FoldSEEK is thousands of times faster than structural alignment tools like Dali, TM-align, and CE, being 184,600 times faster than Dali and 23,000 times faster than TM-align on the AlphaFoldDB.
    • FoldSEEK achieves sensitivities of 86%, 88%, and 133% relative to Dali, TM-align, and CE, respectively, and ranks among the top tools in precision-recall benchmarks.
    • FoldSEEK produces alignments with accuracy comparable to Dali and TM-align, is 15% more sensitive than CE, and excels in detecting homologous multi-domain structures efficiently.