Limeng Pu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Limeng Pu has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Hsiao-Chun Wu
Institute of Communications Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan
3 shared publications - Michal Brylinski
Center for Computation and Technology, Louisiana State University, Baton Rouge, LA 70803, USA
3 shared publications - Gopal Srivastava
Department of Biological Sciences, Louisiana State University, Baton Rouge, LA 70803, USA
2 shared publications - Jagannathan Ramanujam
Division of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, LA 70803, USA
2 shared publications - Manali Singha
Department of Biological Sciences, Louisiana State University, Baton Rouge, LA 70803, USA
2 shared publications - Brent Stanfield
Department of Pathobiological Sciences, School of Veterinary Medicine, Louisiana State University, Baton Rouge, LA 70803, USA
1 shared publication
Latest Publications
- Open Access
Unlocking the Potential of Kinase Targets in Cancer: Insights from CancerOmicsNet, an AI-Driven Approach to Drug Response Prediction in Cancer
Deregulated protein kinases are crucial in promoting cancer cell proliferation and driving malignant cell signaling. Although these kinases are essential targets for cancer therapy due to their involvement in cell development and proliferation, only a small part of the human kinome has been targeted by drugs. A comprehensive scoring system is needed to evaluate and prioritize clinically relevant kinases. We recently developed CancerOmicsNet, an artificial intelligence model employing graph-based algorithms to predict the cancer cell response to treatment with kinase inhibitors. The performance of this approach has been evaluated in large-scale benchmarking calculations, followed by the experimental validation of selected predictions against several cancer types. To shed light on the decision-making process of CancerOmicsNet and to better understand the role of each kinase in the model, we employed a customized saliency map with adjustable channel weights. The saliency map, functioning as an explainable AI tool, allows for the analysis of input contributions to the output of a trained deep-learning model and facilitates the identification of essential kinases involved in tumor progression. The comprehensive survey of biomedical literature for essential kinases selected by CancerOmicsNet demonstrated that it could help pinpoint potential druggable targets for further investigation in diverse cancer types.
Open AccessUnlocking the Potential of Kinase Targets in Cancer: Insights from CancerOmicsNet, an AI-Driven Approach to Drug Response Prediction in Cancer
Deregulated protein kinases are crucial in promoting cancer cell proliferation and driving malignant cell signaling. Although these kinases are essential targets for cancer therapy due to their involvement in cell development and proliferation, only a small part of the human kinome has been targeted by drugs. A comprehensive scoring system is needed to evaluate and prioritize clinically relevant kinases. We recently developed CancerOmicsNet, an artificial intelligence model employing graph-based algorithms to predict the cancer cell response to treatment with kinase inhibitors. The performance of this approach has been evaluated in large-scale benchmarking calculations, followed by the experimental validation of selected predictions against several cancer types. To shed light on the decision-making process of CancerOmicsNet and to better understand the role of each kinase in the model, we employed a customized saliency map with adjustable channel weights. The saliency map, functioning as an explainable AI tool, allows for the analysis of input contributions to the output of a trained deep-learning model and facilitates the identification of essential kinases involved in tumor progression. The comprehensive survey of biomedical literature for essential kinases selected by CancerOmicsNet demonstrated that it could help pinpoint potential druggable targets for further investigation in diverse cancer types.
- Open Access
- 29 July 2022
- Published by MDPI AG in Biomolecules
- Vol. 12 (8) , 1053
GraphSite: Ligand Binding Site Classification with Deep Graph Learning
The binding of small organic molecules to protein targets is fundamental to a wide array of cellular functions. It is also routinely exploited to develop new therapeutic strategies against a variety of diseases. On that account, the ability to effectively detect and classify ligand binding sites in proteins is of paramount importance to modern structure-based drug discovery. These complex and non-trivial tasks require sophisticated algorithms from the field of artificial intelligence to achieve a high prediction accuracy. In this communication, we describe GraphSite, a deep learning-based method utilizing a graph representation of local protein structures and a state-of-the-art graph neural network to classify ligand binding sites. Using neural weighted message passing layers to effectively capture the structural, physicochemical, and evolutionary characteristics of binding pockets mitigates model overfitting and improves the classification accuracy. Indeed, comprehensive cross-validation benchmarks against a large dataset of binding pockets belonging to 14 diverse functional classes demonstrate that GraphSite yields the class-weighted F1-score of 81.7%, outperforming other approaches such as molecular docking and binding site matching. Further, it also generalizes well to unseen data with the F1-score of 70.7%, which is the expected performance in real-world applications. We also discuss new directions to improve and extend GraphSite in the future.
- 29 July 2022
- Published by MDPI AG in Biomolecules
- Vol. 12 (8) , 1053
Open AccessGraphSite: Ligand Binding Site Classification with Deep Graph Learning
The binding of small organic molecules to protein targets is fundamental to a wide array of cellular functions. It is also routinely exploited to develop new therapeutic strategies against a variety of diseases. On that account, the ability to effectively detect and classify ligand binding sites in proteins is of paramount importance to modern structure-based drug discovery. These complex and non-trivial tasks require sophisticated algorithms from the field of artificial intelligence to achieve a high prediction accuracy. In this communication, we describe GraphSite, a deep learning-based method utilizing a graph representation of local protein structures and a state-of-the-art graph neural network to classify ligand binding sites. Using neural weighted message passing layers to effectively capture the structural, physicochemical, and evolutionary characteristics of binding pockets mitigates model overfitting and improves the classification accuracy. Indeed, comprehensive cross-validation benchmarks against a large dataset of binding pockets belonging to 14 diverse functional classes demonstrate that GraphSite yields the class-weighted F1-score of 81.7%, outperforming other approaches such as molecular docking and binding site matching. Further, it also generalizes well to unseen data with the F1-score of 70.7%, which is the expected performance in real-world applications. We also discuss new directions to improve and extend GraphSite in the future.
- Open Access
- 15 May 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (5) , 104
Balanced Parallel Exploration of Orthogonal Regions
We consider the use of multiple mobile agents to explore an unknown area. The area is orthogonal, such that all perimeter lines run both vertically and horizontally. The area may consist of unknown rectangular holes which are non-traversable internally. For the sake of analysis, we assume that the area is discretized into N points allowing the agents to move from one point to an adjacent one. Mobile agents communicate through face-to-face communication when in adjacent points. The objective of exploration is to develop an online algorithm that will explore the entire area while reducing the total work of all k agents, where the work is measured as the number of points traversed. We propose splitting the exploration into two alternating tasks, perimeter and room exploration. The agents all begin with the perimeter scan and when a room is found they transition to room scan after which they continue with perimeter scan until the next room is found and so on. Given the total traversable points N, our algorithm completes in total work with each agent performing work, namely the work is balanced. If the rooms are hole-free the exploration time is also asymptotically optimal, . To our knowledge, this is the first agent coordination algorithm that considers simultaneously work balancing and small exploration time.- 15 May 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (5) , 104
Open AccessBalanced Parallel Exploration of Orthogonal Regions
We consider the use of multiple mobile agents to explore an unknown area. The area is orthogonal, such that all perimeter lines run both vertically and horizontally. The area may consist of unknown rectangular holes which are non-traversable internally. For the sake of analysis, we assume that the area is discretized into N points allowing the agents to move from one point to an adjacent one. Mobile agents communicate through face-to-face communication when in adjacent points. The objective of exploration is to develop an online algorithm that will explore the entire area while reducing the total work of all k agents, where the work is measured as the number of points traversed. We propose splitting the exploration into two alternating tasks, perimeter and room exploration. The agents all begin with the perimeter scan and when a room is found they transition to room scan after which they continue with perimeter scan until the next room is found and so on. Given the total traversable points N, our algorithm completes in total work with each agent performing work, namely the work is balanced. If the rooms are hole-free the exploration time is also asymptotically optimal, . To our knowledge, this is the first agent coordination algorithm that considers simultaneously work balancing and small exploration time. - Open Access
- 8 January 2019
- Published by Springer Nature in BMC Pharmacology and Toxicology
- Vol. 20 (1) , 1-15
eToxPred: a machine learning-based approach to estimate the toxicity of drug candidates
The efficiency of drug development defined as a number of successfully launched new pharmaceuticals normalized by financial investments has significantly declined. Nonetheless, recent advances in high-throughput experimental techniques and computational modeling promise reductions in the costs and development times required to bring new drugs to market. The prediction of toxicity of drug candidates is one of the important components of modern drug discovery. In this work, we describe eToxPred, a new approach to reliably estimate the toxicity and synthetic accessibility of small organic compounds. eToxPred employs machine learning algorithms trained on molecular fingerprints to evaluate drug candidates. The performance is assessed against multiple datasets containing known drugs, potentially hazardous chemicals, natural products, and synthetic bioactive compounds. Encouragingly, eToxPred predicts the synthetic accessibility with the mean square error of only 4% and the toxicity with the accuracy of as high as 72%. eToxPred can be incorporated into protocols to construct custom libraries for virtual screening in order to filter out those drug candidates that are potentially toxic or would be difficult to synthesize. It is freely available as a stand-alone software at https://github.com/pulimeng/etoxpred .
- 8 January 2019
- Published by Springer Nature in BMC Pharmacology and Toxicology
- Vol. 20 (1) , 1-15
Open AccesseToxPred: a machine learning-based approach to estimate the toxicity of drug candidates
The efficiency of drug development defined as a number of successfully launched new pharmaceuticals normalized by financial investments has significantly declined. Nonetheless, recent advances in high-throughput experimental techniques and computational modeling promise reductions in the costs and development times required to bring new drugs to market. The prediction of toxicity of drug candidates is one of the important components of modern drug discovery. In this work, we describe eToxPred, a new approach to reliably estimate the toxicity and synthetic accessibility of small organic compounds. eToxPred employs machine learning algorithms trained on molecular fingerprints to evaluate drug candidates. The performance is assessed against multiple datasets containing known drugs, potentially hazardous chemicals, natural products, and synthetic bioactive compounds. Encouragingly, eToxPred predicts the synthetic accessibility with the mean square error of only 4% and the toxicity with the accuracy of as high as 72%. eToxPred can be incorporated into protocols to construct custom libraries for virtual screening in order to filter out those drug candidates that are potentially toxic or would be difficult to synthesize. It is freely available as a stand-alone software at https://github.com/pulimeng/etoxpred .
- 9 June 2017
- Published by Springer Nature in Biomedical Engineering Letters
- Vol. 7 (4) , 299-304
Novel tailoring algorithm for abrupt motion artifact removal in photoplethysmogram signals
Photoplethysmogram (PPG) signals are widely used for wearable electronic devices nowadays. The PPG signal is extremely sensitive to the motion artifacts (MAs) caused by the subject’s movement. The detection and removal of such MAs remains a difficult problem. Due to the complicated MA signal waveforms, none of the existing techniques can lead to satisfactory results. In this paper, a new framework to identify and tailor the abrupt MAs in PPG is proposed, which consists of feature extraction, change-point detection, and MA removal. In order to achieve the optimal performance, a data-dependent frame-size determination mechanism is employed. Experiments for the heart-beat-rate-measurement application have been conducted to demonstrate the effectiveness of our proposed method, by a correct detection rate of MAs at 98% and the average heart-beat-rate tracking accuracy above 97%. On the other hand, this new framework maintains the original signal temporal structure unlike the spectrum-based approach, and it can be further applied for the calculation of blood oxygen level (SpO2).
- 9 June 2017
- Published by Springer Nature in Biomedical Engineering Letters
- Vol. 7 (4) , 299-304
Novel tailoring algorithm for abrupt motion artifact removal in photoplethysmogram signals
Photoplethysmogram (PPG) signals are widely used for wearable electronic devices nowadays. The PPG signal is extremely sensitive to the motion artifacts (MAs) caused by the subject’s movement. The detection and removal of such MAs remains a difficult problem. Due to the complicated MA signal waveforms, none of the existing techniques can lead to satisfactory results. In this paper, a new framework to identify and tailor the abrupt MAs in PPG is proposed, which consists of feature extraction, change-point detection, and MA removal. In order to achieve the optimal performance, a data-dependent frame-size determination mechanism is employed. Experiments for the heart-beat-rate-measurement application have been conducted to demonstrate the effectiveness of our proposed method, by a correct detection rate of MAs at 98% and the average heart-beat-rate tracking accuracy above 97%. On the other hand, this new framework maintains the original signal temporal structure unlike the spectrum-based approach, and it can be further applied for the calculation of blood oxygen level (SpO2).