Li Peng

Li Peng

Auto-generated profile, based on publicly available information

Li Peng

School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
2 May 2019 in Molecules
Verified
Journal Article
Open access
PDF file
LZLiqian Zhou
Liqian Zhou
ZLZejun Li
Zejun Li
JYJialiang Yang
Jialiang Yang
GTGeng Tian
Geng Tian
FLFuxing Liu
Fuxing Liu
LPLihong Peng
Lihong Peng
Background: Identifying possible drug-target interactions (DTIs) has become an important task in drug research and development. Although high-throughput screening is becoming available, experimental methods narrow down the validation space because of extremely high cost, low success rate, and time consumption. Therefore, various computational models have been exploited to infer DTI candidates. Methods: We introduced relevant databases and packages, mainly provided a comprehensive review of computational models for DTI identification, including network-based algorithms and machine learning-based methods. Specially, machine learning-based methods mainly include bipartite local model, matrix factorization, regularized least squares, and deep learning. Results: Although computational methods have obtained significant improvement in the process of DTI prediction, these models have their limitations. We discussed potential avenues for boosting DTI prediction accuracy as well as further directions.

23 March 2023 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
LPLi Peng
Li Peng
CYCheng Yang
Cheng Yang
YCYifan Chen
Yifan Chen
WLWei Liu
Wei Liu
Exploring the relationship between circular RNA (circRNA) and disease is beneficial for revealing the mechanisms of disease pathogenesis. However, a blind search for all possible associations between circRNAs and diseases through biological experiments is time-consuming. Although some prediction methods have been proposed, they still have limitations. In this study, a novel computational framework, called GATCL2CD, is proposed to forecast unknown circRNA-disease associations (CDAs). First, we calculate Gaussian interactive profile kernel (GIP) similarity and semantic similarity for diseases, circRNA sequence similarity and function similarity, and GIPs for circRNAs. Then, we combine them to construct a heterogeneous graph. Thereafter, GATCL2CD proposes a feature convolution learning framework, that uses a multi-head dynamic attention mechanism to obtain different aggregated representations of features that correspond to the nodes in the heterogeneous graph. Then, it extracts rich higher-order features from the stacked feature representations of each node by using of a single-layer convolutional neural network with filter kernels of different sizes. Finally, a pairwise element-wise product operation is implemented to capture the interactions of higher-order feature representations, and a multilayer perceptron neural network is introduced as an efficient classifier for inferring potential CDAs. Major experimental results under 5-fold cross-validation (5-fold CV) on three different datasets show that GATCL2CD is superior to five other state-of-the-art methods. Furthermore, case studies demonstrate the suitability of GATCL2CD as a useful tool for identifying potential diseaserelated circRNAs. Source codes and datasets of GATCL2CD can be found at https://github.com/biohnuster/GATCL2CD

16 June 2023 in Briefings in Bioinformatics
Verified
Journal Article
Closed access
PDF file
WLWei Liu
Wei Liu
TTTing Tang
Ting Tang
XLXu Lu
Xu Lu
XFXiangzheng Fu
Xiangzheng Fu
YYYu Yang
Yu Yang
LPLi Peng
Li Peng
Circular RNA (circRNA) is closely associated with human diseases. Accordingly, identifying the associations between human diseases and circRNA can help in disease prevention, diagnosis and treatment. Traditional methods are time consuming and laborious. Meanwhile, computational models can effectively predict potential circRNA–disease associations (CDAs), but are restricted by limited data, resulting in data with high dimension and imbalance. In this study, we propose a model based on automatically selected meta-path and contrastive learning, called the MPCLCDA model. First, the model constructs a new heterogeneous network based on circRNA similarity, disease similarity and known association, via automatically selected meta-path and obtains the low-dimensional fusion features of nodes via graph convolutional networks. Then, contrastive learning is used to optimize the fusion features further, and obtain the node features that make the distinction between positive and negative samples more evident. Finally, circRNA–disease scores are predicted through a multilayer perceptron. The proposed method is compared with advanced methods on four datasets. The average area under the receiver operating characteristic curve, area under the precision-recall curve and F1 score under 5-fold cross-validation reached 0.9752, 0.9831 and 0.9745, respectively. Simultaneously, case studies on human diseases further prove the predictive ability and application value of this method.

15 November 2022 in Briefings in Bioinformatics
Verified
Journal Article
Closed access
PDF file
LPLi Peng
Li Peng
YTYuan Tu
Yuan Tu
LHLi Huang
Li Huang
YLYang Li
Yang Li
XFXiangzheng Fu
Xiangzheng Fu
XCXiang Chen
Xiang Chen
MicroRNAs (miRNAs) are closely related to a variety of human diseases, not only regulating gene expression, but also having an important role in human life activities and being viable targets of small molecule drugs for disease treatment. Current computational techniques to predict the potential associations between small molecule and miRNA are not that accurate. Here, we proposed a new computational method based on a deep autoencoder and a scalable tree boosting model (DAESTB), to predict associations between small molecule and miRNA. First, we constructed a high-dimensional feature matrix by integrating small molecule–small molecule similarity, miRNA–miRNA similarity and known small molecule–miRNA associations. Second, we reduced feature dimensionality on the integrated matrix using a deep autoencoder to obtain the potential feature representation of each small molecule–miRNA pair. Finally, a scalable tree boosting model is used to predict small molecule and miRNA potential associations. The experiments on two datasets demonstrated the superiority of DAESTB over various state-of-the-art methods. DAESTB achieved the best AUC value. Furthermore, in three case studies, a large number of predicted associations by DAESTB are confirmed with the public accessed literature. We envision that DAESTB could serve as a useful biological model for predicting potential small molecule–miRNA associations.

8 September 2022 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
YLYuhui Li
Yuhui Li
WLWei Liang
Wei Liang
LPLi Peng
Li Peng
DZDafang Zhang
Dafang Zhang
CYCheng Yang
Cheng Yang
Kuan-Ching LiKuan-Ching Li
Kuan-Ching Li
Drug target interaction prediction is a crucial stage in drug discovery. However, brute-force search over a compound database is financially infeasible. We have witnessed the increasing measured drug-target interactions records in recent years, and the rich drug/protein-related information allows the usage of graph machine learning. Despite the advances in deep learning-enabled drug-target interaction, there are still open challenges: (1) rich and complex relationship between drugs and proteins can be explored; (2) the intermediate node is not calibrated in the heterogeneous graph. To tackle with above issues, this paper proposed a framework named DSG-DTI. Specifically, DSG-DTI has the heterogeneous graph autoencoder and heterogeneous attention network-based Matrix Completion. Our framework ensures that the known types of nodes (e.g., drug, target, side effects, diseases) are precisely embedded into high-dimensional space with our pretraining skills. Also, the attention-based heterogeneous graph-based matrix completion achieves highly competitive results via effective long-range dependencies extraction. We verify our model on two public benchmarks. The result of two publicly available benchmark application programs show that the proposed scheme effectively predicts drug-target interactions and can generalize to newly registered drugs and targets with slight performance degradation, outperforming the best accuracy compared with other baselines.

19 April 2023 in Briefings in Bioinformatics
Verified
Journal Article
Closed access
PDF file
WLWei Liu
Wei Liu
YYYu Yang
Yu Yang
XLXu Lu
Xu Lu
XFXiangzheng Fu
Xiangzheng Fu
RSRuiqing Sun
Ruiqing Sun
LPLi Peng
Li Peng
The elucidation of gene regulatory networks (GRNs) is one of the central challenges of systems biology, which is crucial for understanding pathogenesis and curing diseases. Various computational methods have been developed for GRN inference, but identifying redundant regulation remains a fundamental problem. Although considering topological properties and edge importance measures simultaneously can identify and reduce redundant regulations, how to address their respective weaknesses whilst leveraging their strengths is a critical problem faced by researchers. Here, we propose a network structure refinement method for GRN (NSRGRN) that effectively combines the topological properties and edge importance measures during GRN inference. NSRGRN has two major parts. The first part constructs a preliminary ranking list of gene regulations to avoid starting the GRN inference from a directed complete graph. The second part develops a novel network structure refinement (NSR) algorithm to refine the network structure from local and global topology perspectives. Specifically, the Conditional Mutual Information with Directionality and network motifs are applied to optimise the local topology, and the lower and upper networks are used to balance the bilateral relationship between the local topology’s optimisation and the global topology’s maintenance. NSRGRN is compared with six state-of-the-art methods on three datasets (26 networks in total), and it shows the best all-round performance. Furthermore, when acting as a post-processing step, the NSR algorithm can improve the results of other methods in most datasets.