Wenda Wang 0004

dblp:89/8453-4 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0003-2469-8522ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, 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.

Artificial intelligence
1 paper
Generative modeling · 77% 3D vision · 12% Deep learning architectures and training · 12%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › flow matching
equivariant flow matching
1.012026
AbFlow: End-to-end Paratope-Centric Antibody Design by Interaction Enhanced Flow Matching · KDD (1) 2026
Machine learning › Generative modeling
flow matching
1.012026
AbFlow: End-to-end Paratope-Centric Antibody Design by Interaction Enhanced Flow Matching · KDD (1) 2026
Bioinformatics and computational biology › protein design
antibody design
1.012026
AbFlow: End-to-end Paratope-Centric Antibody Design by Interaction Enhanced Flow Matching · KDD (1) 2026
Bioinformatics and computational biology
protein design
1.012026
AbFlow: End-to-end Paratope-Centric Antibody Design by Interaction Enhanced Flow Matching · KDD (1) 2026
Machine learning › Deep learning architectures and training
equivariant neural network
0.312026
AbFlow: End-to-end Paratope-Centric Antibody Design by Interaction Enhanced Flow Matching · KDD (1) 2026
Computer vision › 3D vision
geometric deep learning
0.312026
AbFlow: End-to-end Paratope-Centric Antibody Design by Interaction Enhanced Flow Matching · KDD (1) 2026

Methods — techniques the papers use, named apart from their topics

flow matching · 2.0equivariant surface encoding · 2.0binding affinity optimization · 2.0
YearPublicationVenuePosition
2026 AbFlow: End-to-end Paratope-Centric Antibody Design by Interaction Enhanced Flow Matching
abstract
Antigen-antibody binding is a critical process in the immune response. Although recent progress has advanced antibody design, current methods lack a generative framework for end-to-end modeling of full-atom antibody structures and struggle to fully exploit antigen-specific geometric information for optimizing local binding interfaces and global structures. To overcome these limitations, we introduce AbFlow, a paratope-restricted one-step flow-matching framework for designing full-atom antibodies end-to-end. AbFlow incorporates an extended velocity field network featuring an equivariant Surface Multi-channel Encoder, which uses surface-level antigen interaction data to refine the antibody structure, particularly the CDR-H3 region. Extensive experiments in paratope-centric antibody design, multi-CDRs and full-atom antibody design, binding affinity optimization, and complex structure prediction show that AbFlow produces superior antigen-antibody complexes, especially at the contact interface, and markedly improves the binding affinity of generated antibodies.
Wenda Wang 0004, Yang Zhang 0094, Zhewei Wei, Wenbing Huang 0001
KDD (1)1
2022 Inter-chain contact map prediction for protein complex based on graph attention network and triangular multiplication update
abstract
Residue-residue interactions between individual subunits of protein complexes are critical for predicting complex structures and can serve as distance constraints to guide complex structure modeling. Some recent studies have made some progress in predicting protein inter-chain contact maps based on multiple sequence alignments and deep learning models. Here we develop a new model based on graph attention network and triangular multiplication update to predict interchain contact maps for homologous protein complexes, named PGT (P is Protein, G is Graph attention network and T is Triangular multiplication update). Different from other methods which need to perform multiple sequence alignment processes and extract complicated manual features, PGT extracts embeddings of residues through the protein language model. Besides, we introduce structural information through the graph attention network to learn the spatial information of subunits from the complex structure and utilize the triangular multiplication module to capture triangular constraints between residues. To demonstrate the effectiveness of our method, we compare PGT with previous works such as DeepHomo, DRCon and Glinter on two independent test sets. The results show that PGT substantially outperforms these methods. Furthermore, we also perform two ablation experiments to demonstrate the necessity of introducing graph attention network and triangular multiplication update. In all, our framework presents new modules to accurately predict inter-chain contact maps in homologous protein complexes and it’s also useful to analyze interactions in other type of protein complexes.
Jiashan Li, Wenda Wang 0004, Xinqi Gong
BIBM4