Jing Wan

Mrs. Jing Wan

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 November 2022 in Science of The Total Environment
Verified
Journal Article
Closed access
YHYongming Han
Yongming Han
LCLian Cao
Lian Cao
Zhiqiang GengZhiqiang Geng
Zhiqiang Geng
WPWeiying Ping
Weiying Ping
XZXiaoyu Zuo
Xiaoyu Zuo
GLGang Lu
Gang Lu

21 May 2024 in Heritage Science
Verified
Journal Article
Open access
PDF file
JWJing Wan
Jing Wan
HZHao Zhang
Hao Zhang
JZJun Zou
Jun Zou
AZAo Zou
Ao Zou
YCYubin Chen
Yubin Chen
QWQiya Wang
Qiya Wang
Chinese Painting and Calligraphy (ChP&C) holds significant cultural value, representing integral aspects of both Chinese culture and global art. A considerable amount of ChP&C works are dispersed worldwide. With the emergence of digital humanities, a vast collection of cultural artifacts data is now available online. However, the online databases of these artifacts remain decentralized and diverse, posing significant challenges to their effective organization and utilization. Addressing this, our paper focuses on the Wu Men School of Painting and proposes a framework for constructing a multimodal knowledge graph for the ChP&C domain. We construct the domain ontology by analyzing the ChP&C knowledge schema. Then, we acquire knowledge from diverse data sources, including textual and visual information. To enhance data collection around collecting historical context and subject matter, we propose methods for seal extraction and subject extraction specific to ChP&C. We validate the effectiveness of these methods on the constructed dataset. Finally, we construct the Wu Men Multimodal Knowledge Graph (WuMKG) and implement applications such as cross-modal retrieval, knowledge-based question-answering and visualization.

23 July 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
QZQingyang Zeng
Qingyang Zeng
MYMinghui Yuan
Minghui Yuan
JWJing Wan
Jing Wan
KWKunfeng Wang
Kunfeng Wang
NSNannan Shi
Nannan Shi
BLBin Liu
Bin Liu

23 September 2024 in Briefings in Bioinformatics
Verified
Journal Article
Open access
PDF file
JMJia Mi
Jia Mi
HWHan Wang
Han Wang
JLJing Li
Jing Li
JSJinghong Sun
Jinghong Sun
CLChang Li
Chang Li
JGJingyang Gao
Jingyang Gao
Recent advances in high-throughput sequencing have led to an explosion of genomic and transcriptomic data, offering a wealth of protein sequence information. However, the functions of most proteins remain unannotated. Traditional experimental methods for annotation of protein functions are costly and time-consuming. Current deep learning methods typically rely on Graph Convolutional Networks to propagate features between protein residues. However, these methods fail to capture fine atomic-level geometric structural features and cannot directly compute or propagate structural features (such as distances, directions, and angles) when transmitting features, often simplifying them to scalars. Additionally, difficulties in capturing long-range dependencies limit the model’s ability to identify key nodes (residues). To address these challenges, we propose a geometric graph network (GGN-GO) for predicting protein function that enriches feature extraction by capturing multi-scale geometric structural features at the atomic and residue levels. We use a geometric vector perceptron to convert these features into vector representations and aggregate them with node features for better understanding and propagation in the network. Moreover, we introduce a graph attention pooling layer captures key node information by adaptively aggregating local functional motifs, while contrastive learning enhances graph representation discriminability through random noise and different views. The experimental results show that GGN-GO outperforms six comparative methods in tasks with the most labels for both experimentally validated and predicted protein structures. Furthermore, GGN-GO identifies functional residues corresponding to those experimentally confirmed, showcasing its interpretability and the ability to pinpoint key protein regions. The code and data are available at: https://github.com/MiJia-ID/GGN-GO

10 April 2025 in Computational Biology and Chemistry
Verified
Journal Article
Closed access
CLChang Li
Chang Li
JMJia Mi
Jia Mi
HWHan Wang
Han Wang
ZLZhikang Liu
Zhikang Liu
JGJingyang Gao
Jingyang Gao
JWJing Wan
Jing Wan

5 December 2024 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
JSJinghong Sun
Jinghong Sun
HWHan Wang
Han Wang
JMJia Mi
Jia Mi
JWJing Wan
Jing Wan
JGJingyang Gao
Jingyang Gao
The development of drug–target binding affinity (DTA) prediction tasks significantly drives the drug discovery process forward. Leveraging the rapid advancement of artificial intelligence, DTA prediction tasks have undergone a transformative shift from wet lab experimentation to machine learning-based prediction. This transition enables a more expedient exploration of potential interactions between drugs and targets, leading to substantial savings in time and funding resources. However, existing methods still face several challenges, such as drug information loss, lack of calculation of the contribution of each modality, and lack of simulation regarding the drug–target binding mechanisms. We propose MTAF–DTA, a method for drug–target binding affinity prediction to solve the above problems. The drug representation module extracts three modalities of features from drugs and uses an attention mechanism to update their respective contribution weights. Additionally, we design a Spiral-Attention Block (SAB) as drug–target feature fusion module based on multi-type attention mechanisms, facilitating a triple fusion process between them. The SAB, to some extent, simulates the interactions between drugs and targets, thereby enabling outstanding performance in the DTA task. Our regression task on the Davis and KIBA datasets demonstrates the predictive capability of MTAF–DTA, with CI and MSE metrics showing respective improvements of 1.1% and 9.2% over the state-of-the-art (SOTA) method in the novel target settings. Furthermore, downstream tasks further validate MTAF–DTA’s superiority in DTA prediction. Experimental results and case study demonstrate the superior performance of our approach in DTA prediction tasks, showing its potential in practical applications such as drug discovery and disease treatment.