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,742 papers · 148 categories

Trend · papers per month

326496128 · Jun 202019922001200920172026
48 results for protein interactions

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.

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.

Study improves LLMs for PPI analysis by addressing uncertainty.

problem Uncertainty in LLM predictions for PPIs.
method Fine-tuned LLaMA-3 and BioMedGPT models, LoRA ensembles, Bayesian LoRA for UQ.
result Competitive PPI identification performance across diverse disease contexts.

Study identifies cancer genes through graph anomaly analysis of protein interactions.

problem Insufficient modeling of biological information in protein interaction networks for cancer gene identification.
method Proposes HIerarchical-Perspective Graph Neural Network (HIPGNN) to detect weight heterogeneity and spectral flattening in cancer gene nodes.
result HIPGNN detects weight heterogeneity and spectral flattening, leading to improved cancer gene identification.

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.

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.

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.

Knot theory applied to proteins, distinguishing folded linear chains.

problem Classifying proteins as unknots when intra-chain interactions are ignored.
method Developing knot theory for folded linear molecular chains, considering self-bonding, and using Gauss codes and quandles.
result Extended knot theory to distinguish topologies of proteins with intra-chain bonds.

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 ↗

Bi-GNN models drug interactions using a bi-level graph approach.

problem Predicting drug-drug interactions using machine learning.
method Bi-level graph neural networks that consider both interaction graph and representation graphs of drugs.
result Bi-GNN model improves DDI prediction accuracy compared to existing methods.

Protein interaction networks are a promising type of data for studying complex biological systems. However, despite the rich information embedded in these networks, they face important data quality challenges of noise and incompleteness that adversely affect the results obtained from their analysis. Here, we explore th…

2012-10-25abs ↗pdf ↗

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 ↗

LMI approximates mutual information in high dimensions using learned low-dimensional representations.

problem Estimating mutual information between high-dimensional variables is challenging due to sample size limitations.
method Developed a method called latent MI (LMI) approximation that applies a nonparametric MI estimator to low-dimensional representations learned by a simple model architecture.
result LMI can approximate MI well for variables with >10^3 dimensions if their dependence structure has low intrinsic dimensionality.

EGR refines and assesses protein complex structures.

problem Improving the accuracy of protein complex 3D structures for drug discovery.
method E(3)-equivariant graph neural network (GNN) for multi-task refinement and assessment.
result EGR achieves state-of-the-art performance in refining and assessing protein complexes.

Motivation: Understanding functions of proteins in specific human tissues is essential for insights into disease diagnostics and therapeutics, yet prediction of tissue-specific cellular function remains a critical challenge for biomedicine. Results: Here we present OhmNet, a hierarchy-aware unsupervised node feature le…

2017-07-14abs ↗pdf ↗

TIP model improves POSE prediction with less resources.

problem Predicting polypharmacy side effects from drug-protein interactions.
method TIP model operates on three subgraphs for progressive representation learning.
result Improves accuracy by 7%+, time efficiency by 83imes imes, and space efficiency by 3imes imes.

HopGAT improves node classification in sparsely labeled graphs by learning from distant neighbors.

problem Classifying nodes in sparsely labeled graphs with limited labeled data.
method Hop-aware supervision mechanism and simulated annealing learning strategy.
result The model achieves high accuracy even with 40% labeled data, reducing performance loss to 3.9%.

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 ↗

In this paper, we consider data consisting of multiple networks, each comprised of a different edge set on a common set of nodes. Many models have been proposed for the analysis of such multi-view network data under the assumption that the data views are closely related. In this paper, we provide tools for evaluating t…

2019-09-25abs ↗pdf ↗

Observations consisting of measurements on relationships for pairs of objects arise in many settings, such as protein interaction and gene regulatory networks, collections of author-recipient email, and social networks. Analyzing such data with probabilisic models can be delicate because the simple exchangeability assu…

2007-05-30abs ↗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 ↗

Improved drug-protein interaction prediction using FTL method.

problem Predicting drug-protein interactions from noisy data with uncertain labels.
method Filtered Transfer Learning (FTL) method that fine-tunes a deep neural network across multiple tiers of data confidence.
result FTL method outperforms deep neural networks trained on single confidence ranges.

The use of drug combinations, termed polypharmacy, is common to treat patients with complex diseases and co-existing conditions. However, a major consequence of polypharmacy is a much higher risk of adverse side effects for the patient. Polypharmacy side effects emerge because of drug-drug interactions, in which activi…

2018-02-02abs ↗pdf ↗

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.

New model uses pretrained biochemical language models to generate drug compounds.

problem Developing novel compounds targeting specific proteins.
method Exploits pretrained language models to initialize and fine-tune targeted molecule generation models.
result Warm-started models outperform baseline models, with one-stage strategy showing better generalization.

Graph auto-encoder predicts unobserved node features from biological networks and omics data.

problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.