Demo Data from VLDB 2026 / reviewers in the wild / expert
Xianchen Zheng
dblp:126/8087
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › gene regulation
binding site prediction |
1.0 | 1 | 2026 | Protein-nucleic acid binding site prediction using interpretable Kolmogorov-Arnold networks with hypergraph representation learning · Bioinform. 2026 |
Bioinformatics and computational biology › computational structural biology
protein-nucleic acid interaction |
1.0 | 1 | 2026 | Protein-nucleic acid binding site prediction using interpretable Kolmogorov-Arnold networks with hypergraph representation learning · Bioinform. 2026 |
Bioinformatics and computational biology
protein structure analysis |
0.3 | 1 | 2026 | Protein-nucleic acid binding site prediction using interpretable Kolmogorov-Arnold networks with hypergraph representation learning · Bioinform. 2026 |
Methods — techniques the papers use, named apart from their topics
protein language model · 1.0kolmogorov-arnold network · 1.0hypergraph neural network · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Protein-nucleic acid binding site prediction using interpretable Kolmogorov-Arnold networks with hypergraph representation learningabstractMOTIVATION: In 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. RESULTS: In 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. Yangfeng Zhu, Guicong Sun, Weimin Zhu, Yongxian Fan, Zeheng Wu, Xianchen Zheng, Xiaoyong Pan |
Bioinform. | 6 |
| 2015 | PathWalker: A Dynamic Symbolic Execution Tool Based on LLVM Byte Code Instrumentation
Junxian Zhang, Zhoujun Li 0001, Xianchen Zheng |
SETTA | 3 |