Chenhao Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Chenhao Wang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Alex Jinpeng Wang
School of Computer Science and Engineering Central South University Changsha China
1 shared publication- Gang Luo
School of Computer Science and Engineering Central South University Changsha China
1 shared publication - Jing Tang
Research Program in Systems Oncology Faculty of Medicine University of Helsinki Helsinki Finland
1 shared publication - Min Li
Central South University, Changsha, China
1 shared publication Qianqian Zhang
School of Computer Science and Engineering Central South University Changsha China
1 shared publication- Wei Li
Harbin Engineering University
1 shared publication
Latest Publications
- Open Access
- 10 September 2026
- Published by Wiley in Advanced Science
- p. e77238
A Site‐Aware Representation Learning Framework For Unified Molecular Interaction Modeling and Generative Design
Unifying drug‐target affinity prediction and targeted molecular design within a single interpretable framework remains challenging. Many sequence‐based affinity and design methods rely on global target representations without explicitly modeling binding regions, leading to site‐level ambiguity in both screening and design. By contrast, structure‐based methods require high‐quality structural data and are poorly suited to dynamic targets. In this study, a new model named MolDBG is proposed as a unified site‐aware framework that combines affinity prediction, binding‐site identification, and affinity‐conditioned molecular generation within a single architecture. With binding‐site supervision, MolDBG prioritizes interaction‐critical residues before learning drug‐target representations, reducing false positives from misaligned binding sites and improving interpretability. MolDBG achieves competitive performance across all three tasks while enabling site‐specific affinity prediction and interpretable binding‐site discovery. The framework generalizes to structurally elusive targets, including cryptic pockets and intrinsically disordered proteins. Overall, these results demonstrate that MolDBG is a promising framework for molecular design and screening.
- 10 September 2026
- Published by Wiley in Advanced Science
- p. e77238
Open AccessA Site‐Aware Representation Learning Framework For Unified Molecular Interaction Modeling and Generative Design
Unifying drug‐target affinity prediction and targeted molecular design within a single interpretable framework remains challenging. Many sequence‐based affinity and design methods rely on global target representations without explicitly modeling binding regions, leading to site‐level ambiguity in both screening and design. By contrast, structure‐based methods require high‐quality structural data and are poorly suited to dynamic targets. In this study, a new model named MolDBG is proposed as a unified site‐aware framework that combines affinity prediction, binding‐site identification, and affinity‐conditioned molecular generation within a single architecture. With binding‐site supervision, MolDBG prioritizes interaction‐critical residues before learning drug‐target representations, reducing false positives from misaligned binding sites and improving interpretability. MolDBG achieves competitive performance across all three tasks while enabling site‐specific affinity prediction and interpretable binding‐site discovery. The framework generalizes to structurally elusive targets, including cryptic pockets and intrinsically disordered proteins. Overall, these results demonstrate that MolDBG is a promising framework for molecular design and screening.
- 19 December 2024
- Published by Elsevier in Information Sciences
- Vol. 699
Structural graph clustering on signed graphs: An index-based approach
- 19 December 2024
- Published by Elsevier in Information Sciences
- Vol. 699
Structural graph clustering on signed graphs: An index-based approach
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 4330-4334
Network Embedding with Adaptive Multi-hop Contrast
\beginabstract Graph neural networks (GNNs) have shown strong performance in graph-based analysis tasks. Despite their remarkable success, the inherent homophilic message-passing mechanism (MP) makes GNNs challenging to generalize to heterophilic graphs. In addition, the MP explicitly exploits the connection relationships between local neighbor nodes making GNNs unable to maintain stable performance in the face of adversarial perturbation attacks. In this paper, we propose a new method to explore graph structure by removing explicit message-passing mechanisms and present a network embedding framework AMCNE with Adaptive Multi-hop Contrast loss (AMCLoss) to address these challenges. AMCNE only relies on a simple autoencoder to obtain node representations for classification and uses elaborate contrastive loss to drive nodes capturing complex structural information on heterophilic graphs. The comprehensive experiments show that AMCNE outperforms state-of-the-art baseline models on homophilic and heterophilic graphs and is more robust in the node classification task. \endabstract
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 4330-4334
Open AccessNetwork Embedding with Adaptive Multi-hop Contrast
\beginabstract Graph neural networks (GNNs) have shown strong performance in graph-based analysis tasks. Despite their remarkable success, the inherent homophilic message-passing mechanism (MP) makes GNNs challenging to generalize to heterophilic graphs. In addition, the MP explicitly exploits the connection relationships between local neighbor nodes making GNNs unable to maintain stable performance in the face of adversarial perturbation attacks. In this paper, we propose a new method to explore graph structure by removing explicit message-passing mechanisms and present a network embedding framework AMCNE with Adaptive Multi-hop Contrast loss (AMCLoss) to address these challenges. AMCNE only relies on a simple autoencoder to obtain node representations for classification and uses elaborate contrastive loss to drive nodes capturing complex structural information on heterophilic graphs. The comprehensive experiments show that AMCNE outperforms state-of-the-art baseline models on homophilic and heterophilic graphs and is more robust in the node classification task. \endabstract