Ping Zhang

Prof. Ping Zhang

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
22 March 2024 in Computers and Electronics in Agriculture
Verified
Journal Article
Closed access
PZPing Zhang
Ping Zhang
NDNianzu Dai
Nianzu Dai
JYJin Yuan
Jin Yuan
Jin YuanJin Yuan
Jin Yuan
ZXZhenbo Xin
Zhenbo Xin

27 February 2023 in Applied Soft Computing
Verified
Journal Article
Closed access
GLGuodong Li
Guodong Li
WSWeicheng Sun
Weicheng Sun
JXJinsheng Xu
Jinsheng Xu
LHLun Hu
Lun Hu
WZWeihan Zhang
Weihan Zhang
PZPing Zhang
Ping Zhang

17 January 2022 in Briefings in Bioinformatics
Verified
Journal Article
Closed access
PDF file
GLGuodong Li
Guodong Li
PZPing Zhang
Ping Zhang
WSWeicheng Sun
Weicheng Sun
CRChengjuan Ren
Chengjuan Ren
LWLei Wang
Lei Wang
Predicting drug–target interactions (DTIs) is a convenient strategy for drug discovery. Although various computational methods have been put forward in recent years, DTIs prediction is still a challenging task. In this paper, based on indirect prior information (we term them as mediators), we proposed a new model, called Bridging-BPs (bridging paths), for DTIs prediction. Specifically, we regarded linkage process between mediators and DTs (drugs and proteins) as ‘bridging’ and source (drug)-mediators-destination (protein) as bridging paths. By integrating various bridging paths, we constructed a bridging heterogeneous graph for DTIs. After that, an improved graph-embedding algorithm—BPs2vec—was designed to capture deep topological features underlying the bridging graph, thereby obtaining the low-dimensional node vector representations. Then, the vector representations were fed into a Random Forest classifier to train and score the probability, outputting the final classification results for potential DTIs. Under 5-fold cross validation, our method obtained AUPR of 88.97% and AUC of 88.63%, suggesting that Bridging-BPs could effectively mine the link relationships hidden in indirect prior information and it significantly improved the accuracy and robustness of DTIs prediction without direct prior information. Finally, we confirmed the practical prediction ability of Bridging-BPs by case studies.

28 June 2023 in Briefings in Bioinformatics
Verified
Journal Article
Closed access
PDF file
KLKai Li
Kai Li
PZPing Zhang
Ping Zhang
ZWZilin Wang
Zilin Wang
WSWei Shen
Wei Shen
WSWeicheng Sun
Weicheng Sun
Li LiLi Li
Li Li
Although sequencing-based high-throughput chromatin interaction data are widely used to uncover genome-wide three-dimensional chromatin architecture, their sparseness and high signal-noise-ratio greatly restrict the precision of the obtained structural elements. To improve data quality, we here present iEnhance (chromatin interaction data resolution enhancement), a multi-scale spatial projection and encoding network, to predict high-resolution chromatin interaction matrices from low-resolution and noisy input data. Specifically, iEnhance projects the input data into matrix spaces to extract multi-scale global and local feature sets, then hierarchically fused these features by attention mechanism. After that, dense channel encoding and residual channel decoding are used to effectively infer robust chromatin interaction maps. iEnhance outperforms state-of-the-art Hi-C resolution enhancement tools in both visual and quantitative evaluation. Comprehensive analysis shows that unlike other tools, iEnhance can recover both short-range structural elements and long-range interaction patterns precisely. More importantly, iEnhance can be transferred to data enhancement of other tissues or cell lines of unknown resolution. Furthermore, iEnhance performs robustly in enhancement of diverse chromatin interaction data including those from single-cell Hi-C and Micro-C experiments.

11 May 2023 in BMC Genomics
Verified
Journal Article
Open access
PDF file
JXJinsheng Xu
Jinsheng Xu
WZWeihan Zhang
Weihan Zhang
PZPing Zhang
Ping Zhang
WSWeicheng Sun
Weicheng Sun
Yuepeng HanYuepeng Han
Yuepeng Han
Li LiLi Li
Li Li
Background: As an important source of genetic variation, copy number variation (CNV) can alter the dosage of DNA segments, which in turn may affect gene expression level and phenotype. However, our knowledge of CNV in apple is still limited. Here, we obtained high-confidence CNVs and investigated their functional impact based on genome resequencing data of two apple populations, cultivars and wild relatives. Results: In this study, we identified 914,610 CNVs comprising 14,839 CNV regions (CNVRs) from 346 apple accessions, including 289 cultivars and 57 wild relatives. CNVRs summed to 71.19 Mb, accounting for 10.03% of the apple genome. Under the low linkage disequilibrium (LD) with nearby SNPs, they could also accurately reflect the population structure of apple independent of SNPs. Furthermore, A total of 3,621 genes were covered by CNVRs and functionally involved in biological processes such as defense response, reproduction and metabolic processes. In addition, the population differentiation index ( $${V}_{st}$$ V st ) analysis between cultivars and wild relatives revealed 127 CN-differentiated genes, which may contribute to trait differences in these two populations. Conclusions: This study was based on identification of CNVs from 346 diverse apple accessions, which to our knowledge was the largest dataset for CNV analysis in apple. Our work presented the first comprehensive CNV map and provided valuable resources for understanding genomic variations in apple.

17 June 2024 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
WSWeicheng Sun
Weicheng Sun
CRChengjuan Ren
Chengjuan Ren
JXJinsheng Xu
Jinsheng Xu
PZPing Zhang
Ping Zhang
Circular RNAs (circRNAs) play a significant role in cancer development and therapy resistance. There is substantial evidence indicating that the expression of circRNAs affects the sensitivity of cells to drugs. Identifying circRNAs-drug sensitivity association (CDA) is helpful for disease treatment and drug discovery. However, the identification of CDA through conventional biological experiments is both time-consuming and costly. Therefore, it is urgent to develop computational methods to predict CDA. In this study, we propose a new computational method, the subgraph-aware graph convolutional network (SAGCN), for predicting CDA. SAGCN first construct a heterogeneous network composed of circRNA similarity network, drug similarity network, and circRNA-drug bipartite network. Then, a subgraph extractor is proposed to learn the latent subgraph structure of the heterogeneous network using a graph convolutional network. The extractor can capture 1-hop and 2-hop information and then a fusing attention mechanism is designed to integrate them adaptively. Simultaneously, a novel subgraph-aware attention mechanism is proposed to detect intrinsic subgraph structure. The final node feature representation is obtained to make the CDA prediction. Experimental results demonstrate that SAGCN obtained an average AUC of 0.9120 and AUPR of 0.8693, exceeding the performance of the most advanced models under 10-fold cross-validation. Case studies have demonstrated the potential of SAGCN in identifying associations between circRNA and drug sensitivity.