Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

591418 · Jun 202619922001200920172026
48 results for protein binding

PANDA predicts protein binding affinity changes from sequences, outperforming existing methods.

problem Accurately predicting changes in protein binding affinity due to mutations.
method Sequence-based machine learning approach using protein sequence information.
result PANDA achieves higher Pearson correlation coefficients than existing methods.

This abstract reviews recent methods for predicting protein-ligand binding affinity.

problem Predicting protein-ligand binding affinity for various applications in life sciences.
method Traditional and deep learning models for binding affinity prediction.
result Improved predictive performance of AI-driven models.

Motivation: Prediction of the interaction affinity between proteins and compounds is a major challenge in the drug discovery process. WideDTA is a deep-learning based prediction model that employs chemical and biological textual sequence information to predict binding affinity. Results: WideDTA uses four text-based inf…

2019-02-04abs ↗pdf ↗

A new model explains protein interactions via electron delocalization.

problem Understanding how protein interactions affect each other.
method Quantized discrete differential geometry of n-simplices.
result Allosteric regulation follows from the model of interactions.

NeuralMD accelerates protein-ligand binding simulations 1Kx faster.

problem Accurate and efficient simulation of protein-ligand binding dynamics.
method Physics-informed multi-grained group symmetric framework with BindingNet and augmented neural differential equation solver.
result Achieves over 1Kx speedup and up to 15x reduction in reconstruction error compared to standard methods.

Computational approaches to drug discovery can reduce the time and cost associated with experimental assays and enable the screening of novel chemotypes. Structure-based drug design methods rely on scoring functions to rank and predict binding affinities and poses. The ever-expanding amount of protein-ligand binding an…

2016-12-08abs ↗pdf ↗

The identification of novel drug-target (DT) interactions is a substantial part of the drug discovery process. Most of the computational methods that have been proposed to predict DT interactions have focused on binary classification, where the goal is to determine whether a DT pair interacts or not. However, protein-l…

2018-01-30abs ↗pdf ↗

When analyzing the genome, researchers have discovered that proteins bind to DNA based on certain patterns of the DNA sequence known as "motifs". However, it is difficult to manually construct motifs due to their complexity. Recently, externally learned memory models have proven to be effective methods for reasoning ov…

2017-02-22abs ↗pdf ↗

Protein Thoughts interprets protein interactions with clear reasoning, improving prediction accuracy.

problem Lack of mechanistic justification in protein-protein interaction predictions.
method Interpretable search problem reformulation, hypothesis-guided entropy-regularized Tree-of-Thoughts search, embedding-space flow matching.
result Improves mean best-binder rank from 47.7 to 11.2 on SHS148k benchmark.

Protein-ligand scoring is an important step in a structure-based drug design pipeline. Selecting a correct binding pose and predicting the binding affinity of a protein-ligand complex enables effective virtual screening. Machine learning techniques can make use of the increasing amounts of structural data that are beco…

2018-03-06abs ↗pdf ↗

Unified model learns from proteins and ligands for drug design.

problem Disjoint data sources and modeling assumptions limit joint use of structure- and ligand-based drug design.
method Contrastive Geometric Learning for Unified Computational Drug Design (ConGLUDe)
result Unified model achieves competitive zero-shot virtual screening performance and state-of-the-art ligand-conditioned pocket selection.

GEFA predicts drug-target affinity using graph neural networks.

problem Accurate prediction of drug-target interactions for rapid drug repurposing.
method GEFA (Graph Early Fusion Affinity) is a novel graph-in-graph neural network with attention mechanism.
result GEFA effectively models drug-target interactions, demonstrating the effectiveness of pre-trained protein embedding and nested graph representation.

We propose a novel transfer learning approach for orphan screening called corresponding projections. In orphan screening the learning task is to predict the binding affinities of compounds to an orphan protein, i.e., one for which no training data is available. The identification of compounds with high affinity is a ce…

2018-11-30abs ↗pdf ↗

Paper uses machine learning to identify key pathways for c-di-GMP in bacterial genomes.

problem Understanding pathways essential for c-di-GMP in bacterial cellulose production.
method Applied Lasso and Random Forests for feature selection and modeling gene count data.
result Bacterial chemotaxis is identified as the most essential pathway for c-di-GMP encoding domains.

InteractionNet models noncovalent protein-ligand interactions with GNNs and explains predictions.

problem Modeling noncovalent protein-ligand interactions with graph neural networks.
method InteractionNet uses a GNN architecture with separated covalent and noncovalent convolution layers and layer-wise relevance propagation for explainability.
result InteractionNet successfully predicts noncovalent protein-ligand interactions with chemical relevance.

Despite an explosion in the number of experimentally determined, atomically detailed structures of biomolecules, many critical tasks in structural biology remain data-limited. Whether performance in such tasks can be improved by using large repositories of tangentially related structural data remains an open question. …

2018-07-03abs ↗pdf ↗

Co-Diffusion predicts drug-target affinity by learning latent manifolds and diffusion, improving generalization.

problem Cold-start regimes in drug-target affinity prediction due to label scarcity and domain shifts.
method Two-stage framework: latent manifold alignment and latent diffusion regularization.
result Significantly outperforms state-of-the-art baselines, especially in zero-shot generalization.

Major histocompatibility complex class two (MHC-II) molecules are trans-membrane proteins and key components of the cellular immune system. Upon recognition of foreign peptides expressed on the MHC-II binding groove, helper T cells mount an immune response against invading pathogens. Therefore, mechanistic identificati…

2017-12-01abs ↗pdf ↗

AntBO optimizes antibody design using Bayesian optimization for efficient and effective CDRH3 sequence generation.

problem Designing optimal antigen-specific CDRH3 regions in antibody design due to combinatorial sequence space.
method Combinatorial Bayesian optimization framework with trust region for developability.
result AntBO designs CDRH3 regions with diverse biophysical properties and outperforms existing methods.

Deep generative model discovers inhibitors for unknown targets.

problem Discovering novel inhibitor molecules for unknown drug targets.
method Deep generative framework trained on protein sequences, small molecules, and interactions.
result Micromolar-level inhibition observed for two out of four synthesized candidates, including activity against SARS-CoV-2 variants.

Novel parallel GNN predicts protein-ligand interactions with high accuracy.

problem Accurate prediction of protein-ligand interactions for drug design.
method Parallel Graph Neural Networks (GNN) integrating 3D structural data.
result GNN achieves high accuracy in predicting binary interactions and activity.

A new approach to protein language models combines latent space prediction with masked language modeling.

problem Improving protein language models by predicting amino acid identities at masked positions.
method A variant of masked language modeling that predicts latent targets only at masked positions, retaining the MLM cross-entropy.
result The new approach outperforms pure masked language modeling on 11 out of 16 downstream tasks.

Molecular simulations produce very high-dimensional data-sets with millions of data points. As analysis methods are often unable to cope with so many dimensions, it is common to use dimensionality reduction and clustering methods to reach a reduced representation of the data. Yet these methods often fail to capture the…

2017-10-29abs ↗pdf ↗

Recently, machine learning (ML) has established itself in various worldwide benchmarking competitions in computational biology, including Critical Assessment of Structure Prediction (CASP) and Drug Design Data Resource (D3R) Grand Challenges. However, the intricate structural complexity and high ML dimensionality of bi…

2019-12-03abs ↗pdf ↗

Biological and cellular systems are often modeled as graphs in which vertices represent objects of interest (genes, proteins, drugs) and edges represent relational ties among these objects (binds-to, interacts-with, regulates). This approach has been highly successful owing to the theory, methodology and software that …

2017-03-14abs ↗pdf ↗

We propose generative neural network methods to generate DNA sequences and tune them to have desired properties. We present three approaches: creating synthetic DNA sequences using a generative adversarial network; a DNA-based variant of the activation maximization ("deep dream") design method; and a joint procedure wh…

2017-12-17abs ↗pdf ↗