Jiansheng Wu

Dr. Jiansheng Wu

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
20 March 2023 in Journal of Chemical Information and Modeling
Verified
Journal Article
Closed access
JDJi Ding
Ji Ding
STShidi Tang
Shidi Tang
ZMZheming Mei
Zheming Mei
LWLingyue Wang
Lingyue Wang
QHQinqin Huang
Qinqin Huang
JWJiansheng Wu
Jiansheng Wu

9 May 2022 in Molecules
Verified
Journal Article
Open access
PDF file
STShidi Tang
Shidi Tang
RCRuiqi Chen
Ruiqi Chen
MLMengru Lin
Mengru Lin
QLQingde Lin
Qingde Lin
YZYanxiang Zhu
Yanxiang Zhu
JWJiansheng Wu
Jiansheng Wu
AutoDock Vina is one of the most popular molecular docking tools. In the latest benchmark CASF-2016 for comparative assessment of scoring functions, AutoDock Vina won the best docking power among all the docking tools. Modern drug discovery is facing a common scenario of large virtual screening of drug hits from huge compound databases. Due to the seriality characteristic of the AutoDock Vina algorithm, there is no successful report on its parallel acceleration with GPUs. Current acceleration of AutoDock Vina typically relies on the stack of computing power as well as the allocation of resource and tasks, such as the VirtualFlow platform. The vast resource expenditure and the high access threshold of users will greatly limit the popularity of AutoDock Vina and the flexibility of its usage in modern drug discovery. In this work, we proposed a new method, Vina-GPU, for accelerating AutoDock Vina with GPUs, which is greatly needed for reducing the investment for large virtual screens and also for wider application in large-scale virtual screening on personal computers, station servers or cloud computing, etc. Our proposed method is based on a modified Monte Carlo using simulating annealing AI algorithm. It greatly raises the number of initial random conformations and reduces the search depth of each thread. Moreover, a classic optimizer named BFGS is adopted to optimize the ligand conformations during the docking progress, before a heterogeneous OpenCL implementation was developed to realize its parallel acceleration leveraging thousands of GPU cores. Large benchmark tests show that Vina-GPU reaches an average of 21-fold and a maximum of 50-fold docking acceleration against the original AutoDock Vina while ensuring their comparable docking accuracy, indicating its potential for pushing the popularization of AutoDock Vina in large virtual screens.

25 September 2024 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
STShidi Tang
Shidi Tang
JDJi Ding
Ji Ding
XZXiangyu Zhu
Xiangyu Zhu
ZWZheng Wang
Zheng Wang
Haitao ZhaoHaitao Zhao
Haitao Zhao
JWJiansheng Wu
Jiansheng Wu
AutoDock Vina and its derivatives have established themselves as a prevailing pipeline for virtual screening in contemporary drug discovery. Our Vina-GPU method leverages the parallel computing power of GPUs to accelerate AutoDock Vina, and Vina-GPU 2.0 further enhances the speed of AutoDock Vina and its derivatives. Given the prevalence of large virtual screens in modern drug discovery, the improvement of speed and accuracy in virtual screening has become a longstanding challenge. In this study, we propose Vina-GPU 2.1, aimed at enhancing the docking speed and precision of AutoDock Vina and its derivatives through the integration of novel algorithms to facilitate improved docking and virtual screening outcomes. Building upon the foundations laid by Vina-GPU 2.0, we introduce a novel algorithm, namely Reduced Iteration and Low Complexity BFGS (RILC-BFGS), designed to expedite the most time-consuming operation. Additionally, we implement grid cache optimization to further enhance the docking speed. Furthermore, we employ optimal strategies to individually optimize the structures of ligands, receptors, and binding pockets, thereby enhancing the docking precision. To assess the performance of Vina-GPU 2.1, we conduct extensive virtual screening experiments on three prominent targets, utilizing two fundamental compound libraries and seven docking tools. Our results demonstrate that Vina-GPU 2.1 achieves an average 4.97-fold acceleration in docking speed and an average 342% improvement in EF1% compared to Vina-GPU 2.0. The source code and tools for Vina-GPU 2.1 are freely available accompanied by comprehensive instructions and illustrative examples.

21 May 2021 in Brain Sciences
Verified
Journal Article
Open access
PDF file
HLHai-Tao Li
Hai-Tao Li
SYShao-Xun Yuan
Shao-Xun Yuan
JWJiansheng Wu
Jiansheng Wu
YGYu Gu
Yu Gu
XSXiao Sun
Xiao Sun
Alzheimer’s disease (AD) is a neurodegenerative brain disease in the elderly. Identifying patients with mild cognitive impairment (MCI) who are more likely to progress to AD is a key step in AD prevention. Recent studies have shown that AD is a heterogeneous disease. In this study, we propose a subtyping-based prediction strategy to predict the conversion from MCI to AD in three years according to MCI patient subtypes. Structural magnetic resonance imaging (sMRI) data and multi-omics data, including genotype data and gene expression profiling derived from peripheral blood samples, from 125 MCI patients were used in the Alzheimer’s Disease Neuroimaging Initiative (ADNI)-1 dataset and from 98 MCI patients in the ADNI-GO/2 dataset. A variational Bayes approximation model based on the multiple kernel learning method was constructed to predict whether an MCI patient will progress to AD within three years. In internal fivefold cross-validation within ADNI-1, we achieved an overall AUC of 0.83 (79.20% accuracy, 81.25% sensitivity, 77.92% specificity) compared to the model without subtyping, which achieved an AUC of 0.78 (76.00% accuracy, 77.08% sensitivity, 75.32% specificity). In external validation using ADNI-1 as a training set and ADNI-GO/2 as an independent test set, we attained an AUC of 0.78 (74.49% accuracy, 74.19% sensitivity, 74.63% specificity). Identifying MCI patient subtypes with omics data would improve the accuracy of predicting the conversion from MCI to AD. In addition to evaluating statistics, obtaining the significant sMRI, single nucleotide polymorphism (SNP) and mRNA expression data from peripheral blood of MCI patients is noninvasive and cost-effective for predicting conversion from MCI to AD.

13 October 2023 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
XZXingxing Zhou
Xingxing Zhou
MLMing Ling
Ming Ling
QLQingde Lin
Qingde Lin
STShidi Tang
Shidi Tang
JWJiansheng Wu
Jiansheng Wu
HHHaifeng Hu
Haifeng Hu
Simulated Annealing (SA) algorithm is not effective with large optimization problems for its slow convergence. Hence, several parallel Simulated Annealing (pSA) methods have been proposed, where the increase of searching threads can boost the speed of convergence. Although satisfactory solutions can be obtained by these methods, there is no rigorous mathematical analyses on their effectiveness. Thus, this paper introduces a probabilistic model, on which a theorem about the effectiveness of multiple initial states parallel SA (MISPSA) has been proven. The theorem also demonstrates that the increasing parallelism in pSA algorithm with the reducing of search depth in each thread could obtain almost the same probability of finding the global optimal solution. We validated our theorem on AutoDock Vina, a widely used molecular docking tool with high accuracy and docking speed. AutoDock Vina uses a pSA strategy to find optimal molecular conformations. Under the premise that the total searching workload (i.e., thread number * iteration depth of each thread) remains unchanged, the docking accuracy from an aggressively parallelized SA searching method is almost the same or even better than those from the default exhaustiveness (parallelism degree) configuration of AutoDock Vina. Taking complex '1hnn' as an example,with the increase (125x) in the number of initial states (from 8 to 1000) and the decrease in the search depth for each thread (from 15540 to 124, or 1/125 of the original search depth), the mean energy is -7.80 and -7.94, while the mean RMSD is 3.4 and 3.14, respectively. The result also implies that a considerable speedup (in this case 125x in theory) can be obtained by a highly parallelized SA algorithm implementation.

20 January 2021 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Open access
SYShaoxun Yuan
Shaoxun Yuan
HLHaitao Li
Haitao Li
JWJiansheng Wu
Jiansheng Wu
XSXiao Sun
Xiao Sun
Mild Cognitive Impairment (MCI) is a preclinical stage of Alzheimer's Disease (AD) and is clinical heterogeneity. The classification of MCI is crucial for the early diagnosis and treatment of AD. In this study, we investigated the potential of using both labeled and unlabeled samples from the Alzheimer's Disease Neuroimaging Initiative (ADNI) cohort to classify MCI through the multimodal co-training method. We utilized both structural magnetic resonance imaging (sMRI) data and genotype data of 364 MCI samples including 228 labeled and 136 unlabeled MCI samples from the ADNI-1 cohort. First, the selected quantitative trait (QT) features from sMRI data and SNP features from genotype data were used to build two initial classifiers on 228 labeled MCI samples. Then, the co-training method was implemented to obtain new labeled samples from 136 unlabeled MCI samples. Finally, the random forest algorithm was used to obtain a combined classifier to classify MCI patients in the independent ADNI-2 dataset. The experimental results showed that our proposed framework obtains an accuracy of 85.50 percent and an AUC of 0.825 for MCI classification, respectively, which showed that the combined utilization of sMRI and SNP data through the co-training method could significantly improve the performances of MCI classification.