Evidence map›Paper›PMID 42323855›Full record

ArticleBioinformatics (Oxford, England)2026

Protein-nucleic acid binding site prediction using interpretable Kolmogorov-Arnold networks with hypergraph representation learning.

Yangfeng Zhu, Guicong Sun, Weimin Zhu, Yongxian Fan, Zeheng Wu, Xianchen Zheng, Xiaoyong Pan

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors.

Yangfeng ZhuSchool of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541004, China.ORCID 0009-0003-7125-4067
Guicong SunSchool of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541004, China.ORCID 0000-0002-4597-0268
Weimin ZhuInstitute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, and Key Laboratory of System Control and Information Processing, Ministry of Education of China, Shanghai 200240, China.
Yongxian FanSchool of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541004, China.ORCID 0000-0003-0120-8092
Zeheng WuSchool of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541004, China.
Xianchen ZhengSchool of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541004, China.
Xiaoyong PanInstitute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, and Key Laboratory of System Control and Information Processing, Ministry of Education of China, Shanghai 200240, China.ORCID 0000-0001-5010-464X

Funding

Guangxi Natural Science Foundation 2023GXNSFAA026054National Natural Science Foundation of China 62162015National Natural Science Foundation of China 62473257Science and Technology Commission of Shanghai Municipality 24ZR1435300
6 · The paper itself

Abstract

motivationIn recent years, protein language models (pLMs) and graph neural networks (GNNs) have demonstrated powerful expressive and reasoning capabilities in modeling protein-RNA/DNA interactions. However, existing methods, which use simple graphs to describe the relationships between residues, struggle to effectively capture the high-order, multi-body residue interactions present in protein-nucleic acid complex structures. In fact, spatially continuous but sequence-wise discontinuous residues often cooperatively determine nucleic acid binding capacity.

resultsIn this study, we present IKANbind, a computational approach that combines hypergraph representation learning and interpretable Kolmogorov-Arnold Networks (KANs), for identifying nucleic acid binding residues (NBRs) in proteins. By combining the advantages of pLM, hypergraph neural networks and symbolic KAN, IKANbind outperforms existing methods on multiple NBR benchmark datasets. We also demonstrated that the pLM used in IKANbind can implicitly learn the physicochemical properties of binding residues, such as charge and hydrophobicity. In addition, the symbolic KAN, which uses a unique weighted mechanism of decomposable basis functions, can accurately identify the features with the greatest contribution to NBR recognition. We found that polarity and charge make greater contributions to NBR prediction than other physicochemical properties or evolutionary information. Finally, IKANbind achieves promising performance when extended to other ligand-binding residue prediction tasks. AVAILABILITY AND IMPLEMENTATION: IKANbind is freely available at https://github.com/yangfengzhuguet/IKANBind.

Indexed as

Computational BiologyDNAProteinsRNABinding SitesRepresentation Machine LearningDNAProteinsRNA

Identifiers

PMID42323855
PMCPMC13345923

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.