MétaCan
Menu
Back to cohort
Record W4413311999 · doi:10.1038/s41467-025-62899-0

LABind: identifying protein binding ligand-aware sites via learning interactions between ligand and protein

2025· article· en· W4413311999 on OpenAlexaff
Zhijun Zhang, Lijun Quan, Junkai Wang, Qiufeng Chen, B. X. Zhang, Lexin Cao, Yelu Jiang, Geng Li, Liangpeng Nie, Tingfang Wu, Qiang Lyu

Bibliographic record

VenueNature Communications · 2025
Typearticle
Languageen
FieldComputer Science
TopicComputational Drug Discovery Methods
Canadian institutionsNovelis (Canada)
FundersPriority Academic Program Development of Jiangsu Higher Education InstitutionsNational Natural Science Foundation of China
KeywordsLigand (biochemistry)Protein ligandComputational biologyProtein–protein interactionPlasma protein bindingChemistryComputer scienceBiologyBiochemistryReceptor

Abstract

fetched live from OpenAlex

Protein-ligand interactions are crucial for understanding various biological processes and drug discovery and design. However, experimental methods are costly; single-ligand-oriented methods are tailored to specific ligands; multi-ligand-oriented methods are constrained by the lack of ligand encoding. In this study, we propose a structure-based method called LABind, designed to predict binding sites for small molecules and ions in a ligand-aware manner. LABind utilizes a graph transformer to capture binding patterns within the local spatial context of proteins, and incorporates a cross-attention mechanism to learn the distinct binding characteristics between proteins and ligands. Experimental results on three benchmark datasets demonstrate both the effectiveness of LABind and its ability to generalize to unseen ligands. Further analysis validates that LABind can effectively integrate ligand information to predict binding sites. Additionally, the application of LABind is extended to binding site center localization, sequence-based methods, and molecular docking tasks.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0030.001
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0020.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.038
GPT teacher head0.370
Teacher spread0.333 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations8
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueNature CommunicationsSame topicComputational Drug Discovery MethodsFrench-language works237,207