Hongsong Feng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hongsong Feng has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Guo-Wei Wei
Department of Mathematics, University of Georgia, Athens, GA 30602, USA
7 shared publications - Mushal Zia
Department of Mathematics, Michigan State University, East Lansing, MI 48824, United States of America
3 shared publications - Ekaterina Merkurjev
Department of Mathematics, Michigan State University, East Lansing, USA
2 shared publications Guo-Wei Wei
2 shared publications- JunJie Wee
Department of Mathematics, Michigan State University, East Lansing, MI 48824, United States of America
2 shared publications Nicole Hayes
2 shared publications
Latest Publications
- Open Access
- 4 September 2026
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 66 (18) , 11767-11777
Persistent Local Laplacian Prediction of Protein–Ligand Binding Affinities
Accurate prediction of protein–ligand binding affinity remains a central challenge in structure-based drug discovery. The effectiveness of machine learning models critically depends on the quality of molecular representations, for which advanced mathematical frameworks provide powerful tools. In this work, we employ a novel mathematical theory, termed the persistent local Laplacian (PLL), to construct molecular descriptors that capture localized geometric and topological features of biomolecular structures. The PLL framework addresses key limitations of traditional topological data analysis methods, such as persistent homology and the persistent Laplacian, which are often insensitive to local structural variations, while maintaining high computational efficiency. The resulting molecular descriptors are integrated with advanced machine learning algorithms to develop accurate predictive models for protein–ligand binding affinity. The proposed models are systematically evaluated on three well-established benchmark datasets, including PDBbind-v2007, PDBbind-v2013, and PDBbind-v2016, demonstrating consistently strong and competitive predictive performance. Computational results show that the PLL-based models outperform existing approaches, highlighting their potential as a powerful tool for drug discovery, protein engineering, and broader applications in science and engineering.
- 4 September 2026
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 66 (18) , 11767-11777
Open AccessPersistent Local Laplacian Prediction of Protein–Ligand Binding Affinities
Accurate prediction of protein–ligand binding affinity remains a central challenge in structure-based drug discovery. The effectiveness of machine learning models critically depends on the quality of molecular representations, for which advanced mathematical frameworks provide powerful tools. In this work, we employ a novel mathematical theory, termed the persistent local Laplacian (PLL), to construct molecular descriptors that capture localized geometric and topological features of biomolecular structures. The PLL framework addresses key limitations of traditional topological data analysis methods, such as persistent homology and the persistent Laplacian, which are often insensitive to local structural variations, while maintaining high computational efficiency. The resulting molecular descriptors are integrated with advanced machine learning algorithms to develop accurate predictive models for protein–ligand binding affinity. The proposed models are systematically evaluated on three well-established benchmark datasets, including PDBbind-v2007, PDBbind-v2013, and PDBbind-v2016, demonstrating consistently strong and competitive predictive performance. Computational results show that the PLL-based models outperform existing approaches, highlighting their potential as a powerful tool for drug discovery, protein engineering, and broader applications in science and engineering.
- Open Access
- 17 December 2025
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 6 (4) , 045068
CAP: Commutative algebra prediction of protein-nucleic acid binding affinities
An accurate prediction of protein-nucleic acid binding affinity is vital for deciphering genomic processes, yet existing approaches often struggle in reconciling high accuracy with interpretability and computational efficiency. In this study, we introduce commutative algebra prediction (CAP) framework, which couples persistent Stanley–Reisner theory with advanced sequence embedding for predicting protein-nucleic acid binding affinities. CAP encodes proteins through transformer-learned embeddings that retain long-range evolutionary context, and represents DNA and RNA with k -mer algebra embeddings derived from persistent facet ideals, which capture fine-scale nucleotide geometry. We demonstrate that CAP surpasses the SVSBI protein-nucleic acid benchmark and, in a further test, maintains reasonable performance on newly curated protein-RNA and protein-nucleic acid datasets. Leveraging only primary sequences, CAP generalizes to any protein-nucleic acid pair with minimal preprocessing, enabling genome-scale analyses without 3D structural data and promising faster virtual screening for drug discovery and protein engineering.
- 17 December 2025
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 6 (4) , 045068
Open AccessCAP: Commutative algebra prediction of protein-nucleic acid binding affinities
An accurate prediction of protein-nucleic acid binding affinity is vital for deciphering genomic processes, yet existing approaches often struggle in reconciling high accuracy with interpretability and computational efficiency. In this study, we introduce commutative algebra prediction (CAP) framework, which couples persistent Stanley–Reisner theory with advanced sequence embedding for predicting protein-nucleic acid binding affinities. CAP encodes proteins through transformer-learned embeddings that retain long-range evolutionary context, and represents DNA and RNA with k -mer algebra embeddings derived from persistent facet ideals, which capture fine-scale nucleotide geometry. We demonstrate that CAP surpasses the SVSBI protein-nucleic acid benchmark and, in a further test, maintains reasonable performance on newly curated protein-RNA and protein-nucleic acid datasets. Leveraging only primary sequences, CAP generalizes to any protein-nucleic acid pair with minimal preprocessing, enabling genome-scale analyses without 3D structural data and promising faster virtual screening for drug discovery and protein engineering.
- Open Access
- 16 June 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 65 (13) , 6732-6743
CAML: Commutative Algebra Machine Learning─A Case Study on Protein–Ligand Binding Affinity Prediction
Recently, Suwayyid and Wei introduced commutative algebra as an emerging paradigm for machine learning and data science. In this work, we propose commutative algebra machine learning (CAML) for the prediction of protein-ligand binding affinities. Specifically, we apply persistent Stanley-Reisner theory, a key concept in combinatorial commutative algebra, to the affinity predictions of protein-ligand binding and metalloprotein-ligand binding. We present three new algorithms, i.e., element-specific commutative algebra, category-specific commutative algebra, and commutative algebra on bipartite complexes, to tackle the complexity of data involved in (metallo) protein-ligand complexes. We show that the proposed CAML outperforms other state-of-the-art methods in (metallo) protein-ligand binding affinity predictions, indicating the great potential of commutative algebra learning.
- 16 June 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 65 (13) , 6732-6743
Open AccessCAML: Commutative Algebra Machine Learning─A Case Study on Protein–Ligand Binding Affinity Prediction
Recently, Suwayyid and Wei introduced commutative algebra as an emerging paradigm for machine learning and data science. In this work, we propose commutative algebra machine learning (CAML) for the prediction of protein-ligand binding affinities. Specifically, we apply persistent Stanley-Reisner theory, a key concept in combinatorial commutative algebra, to the affinity predictions of protein-ligand binding and metalloprotein-ligand binding. We present three new algorithms, i.e., element-specific commutative algebra, category-specific commutative algebra, and commutative algebra on bipartite complexes, to tackle the complexity of data involved in (metallo) protein-ligand complexes. We show that the proposed CAML outperforms other state-of-the-art methods in (metallo) protein-ligand binding affinity predictions, indicating the great potential of commutative algebra learning.
- Open Access
- 6 June 2025
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry B
- Vol. 129 (24) , 6112-6113
Correction to “Persistent Sheaf Laplacian Analysis of Protein Flexibility”
- 6 June 2025
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry B
- Vol. 129 (24) , 6112-6113
Open AccessCorrection to “Persistent Sheaf Laplacian Analysis of Protein Flexibility”
- Open Access
- 22 April 2025
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry B
- Vol. 129 (17) , 4169-4178
Persistent Sheaf Laplacian Analysis of Protein Flexibility
Protein flexibility, measured by the B-factor or Debye-Waller factor, is essential for protein functions such as structural support, enzyme activity, cellular communication, and molecular transport. Theoretical analysis and prediction of protein flexibility are crucial for protein design, engineering, and drug discovery. In this work, we introduce the persistent sheaf Laplacian (PSL), an effective tool in topological data analysis, to model and analyze protein flexibility. By representing the local topology and geometry of protein atoms through the multiscale harmonic and nonharmonic spectra of PSLs, the proposed model effectively captures protein flexibility and provides accurate, robust predictions of protein B-factors. Our PSL model demonstrates an increase in accuracy of 32% compared to the classical Gaussian network model (GNM) in predicting B-factors for a data set of 364 proteins. Additionally, we construct a blind machine learning prediction method utilizing global and local protein features. Extensive computations and comparisons validate the effectiveness of the proposed PSL model for B-factor predictions.
- 22 April 2025
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry B
- Vol. 129 (17) , 4169-4178
Open AccessPersistent Sheaf Laplacian Analysis of Protein Flexibility
Protein flexibility, measured by the B-factor or Debye-Waller factor, is essential for protein functions such as structural support, enzyme activity, cellular communication, and molecular transport. Theoretical analysis and prediction of protein flexibility are crucial for protein design, engineering, and drug discovery. In this work, we introduce the persistent sheaf Laplacian (PSL), an effective tool in topological data analysis, to model and analyze protein flexibility. By representing the local topology and geometry of protein atoms through the multiscale harmonic and nonharmonic spectra of PSLs, the proposed model effectively captures protein flexibility and provides accurate, robust predictions of protein B-factors. Our PSL model demonstrates an increase in accuracy of 32% compared to the classical Gaussian network model (GNM) in predicting B-factors for a data set of 364 proteins. Additionally, we construct a blind machine learning prediction method utilizing global and local protein features. Extensive computations and comparisons validate the effectiveness of the proposed PSL model for B-factor predictions.
- Open Access
- 5 April 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 21 (8) , 4276-4285
Persistent Directed Flag Laplacian (PDFL)-Based Machine Learning for Protein–Ligand Binding Affinity Prediction
Directionality in molecular and biomolecular networks plays an important role in the accurate representation of the complex, dynamic, and asymmetrical nature of interactions present in protein-ligand binding, signal transduction, and biological pathways. Most traditional techniques of topological data analysis (TDA), such as persistent homology (PH) and persistent Laplacian (PL), overlook this aspect in their standard form. To address this, we present the persistent directed flag Laplacian (PDFL), which incorporates directed flag complexes to account for edges with directionality originated from polarization, gene regulation, heterogeneous interactions, etc. This study marks the first application of PDFL, providing an in-depth analysis of spectral graph theory combined with machine learning. In addition to its superior accuracy and reliability, the PDFL model offers simplicity by requiring only raw inputs without complex data processing. We validated our multikernel PDFL model for its scoring power against other state-of-the-art methods on three popular benchmarks, namely PDBbind v2007, v2013, and v2016. The computational results indicate that the proposed PDFL model outperforms competitors in protein-ligand binding affinity predictions, suggesting that PDFL is a promising tool for protein engineering, drug discovery, and general applications in science and engineering.
- 5 April 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 21 (8) , 4276-4285
Open AccessPersistent Directed Flag Laplacian (PDFL)-Based Machine Learning for Protein–Ligand Binding Affinity Prediction
Directionality in molecular and biomolecular networks plays an important role in the accurate representation of the complex, dynamic, and asymmetrical nature of interactions present in protein-ligand binding, signal transduction, and biological pathways. Most traditional techniques of topological data analysis (TDA), such as persistent homology (PH) and persistent Laplacian (PL), overlook this aspect in their standard form. To address this, we present the persistent directed flag Laplacian (PDFL), which incorporates directed flag complexes to account for edges with directionality originated from polarization, gene regulation, heterogeneous interactions, etc. This study marks the first application of PDFL, providing an in-depth analysis of spectral graph theory combined with machine learning. In addition to its superior accuracy and reliability, the PDFL model offers simplicity by requiring only raw inputs without complex data processing. We validated our multikernel PDFL model for its scoring power against other state-of-the-art methods on three popular benchmarks, namely PDBbind v2007, v2013, and v2016. The computational results indicate that the proposed PDFL model outperforms competitors in protein-ligand binding affinity predictions, suggesting that PDFL is a promising tool for protein engineering, drug discovery, and general applications in science and engineering.
- 6 November 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Computational Biophysics and Chemistry
- Vol. 24 (02) , 253-266
Mayer-Homology Learning Prediction of Protein-Ligand Binding Affinities
Artificial intelligence-assisted drug design is revolutionizing the pharmaceutical industry. Effective molecular features are crucial for accurate machine learning predictions, and advanced mathematics plays a key role in designing these features. Persistent homology theory, which equips topological invariants with persistence, provides valuable insights into molecular structures. The standard homology theory is based on a differential rule for the boundary operator that satisfies [ ] = 0. Our recent work has extended this rule by employing Mayer homology with generalized differentials that satisfy [ ] = 0 for [ ] 2, leading to the development of persistent Mayer homology (PMH) theory and richer topological information across various scales. In this study, we utilize PMH to create a novel multiscale topological vectorization for molecular representation, offering valuable tools for descriptive and predictive analyses in molecular data and machine learning prediction. Specifically, benchmark tests on established protein-ligand datasets, including PDBbind-v2007, PDBbind-v2013, and PDBbind-v2016, demonstrate the superior performance of our Mayer homology models in predicting protein-ligand binding affinities.
- 6 November 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Computational Biophysics and Chemistry
- Vol. 24 (02) , 253-266
Mayer-Homology Learning Prediction of Protein-Ligand Binding Affinities
Artificial intelligence-assisted drug design is revolutionizing the pharmaceutical industry. Effective molecular features are crucial for accurate machine learning predictions, and advanced mathematics plays a key role in designing these features. Persistent homology theory, which equips topological invariants with persistence, provides valuable insights into molecular structures. The standard homology theory is based on a differential rule for the boundary operator that satisfies [ ] = 0. Our recent work has extended this rule by employing Mayer homology with generalized differentials that satisfy [ ] = 0 for [ ] 2, leading to the development of persistent Mayer homology (PMH) theory and richer topological information across various scales. In this study, we utilize PMH to create a novel multiscale topological vectorization for molecular representation, offering valuable tools for descriptive and predictive analyses in molecular data and machine learning prediction. Specifically, benchmark tests on established protein-ligand datasets, including PDBbind-v2007, PDBbind-v2013, and PDBbind-v2016, demonstrate the superior performance of our Mayer homology models in predicting protein-ligand binding affinities.
- Open Access
- 11 October 2024
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 121 (42)
Knot data analysis using multiscale Gauss link integral
In the past decade, topological data analysis has emerged as a powerful algebraic topology approach in data science. Although knot theory and related subjects are a focus of study in mathematics, their success in practical applications is quite limited due to the lack of localization and quantization. We address these challenges by introducing knot data analysis (KDA), a paradigm that incorporates curve segmentation and multiscale analysis into the Gauss link integral. The resulting multiscale Gauss link integral (mGLI) recovers the global topological properties of knots and links at an appropriate scale and offers a multiscale geometric topology approach to capture the local structures and connectivities in data. By integration with machine learning or deep learning, the proposed mGLI significantly outperforms other state-of-the-art methods across various benchmark problems in 13 intricately complex biological datasets, including protein flexibility analysis, protein–ligand interactions, human Ether-à-go-go-Related Gene potassium channel blockade screening, and quantitative toxicity assessment. Our KDA opens a research area—knot deep learning—in data science.
- 11 October 2024
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 121 (42)
Open AccessKnot data analysis using multiscale Gauss link integral
In the past decade, topological data analysis has emerged as a powerful algebraic topology approach in data science. Although knot theory and related subjects are a focus of study in mathematics, their success in practical applications is quite limited due to the lack of localization and quantization. We address these challenges by introducing knot data analysis (KDA), a paradigm that incorporates curve segmentation and multiscale analysis into the Gauss link integral. The resulting multiscale Gauss link integral (mGLI) recovers the global topological properties of knots and links at an appropriate scale and offers a multiscale geometric topology approach to capture the local structures and connectivities in data. By integration with machine learning or deep learning, the proposed mGLI significantly outperforms other state-of-the-art methods across various benchmark problems in 13 intricately complex biological datasets, including protein flexibility analysis, protein–ligand interactions, human Ether-à-go-go-Related Gene potassium channel blockade screening, and quantitative toxicity assessment. Our KDA opens a research area—knot deep learning—in data science.
- Top Cited PapersOpen Access
- 30 August 2024
- Published by Elsevier in Journal of Pharmaceutical Analysis
- Vol. 15 (6) , 101081
A review of transformer models in drug discovery and beyond
- 30 August 2024
- Published by Elsevier in Journal of Pharmaceutical Analysis
- Vol. 15 (6) , 101081
Top Cited PapersOpen AccessA review of transformer models in drug discovery and beyond
- 13 November 2023
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 63 (22) , 7189-7209
ChatGPT in Drug Discovery: A Case Study on Anticocaine Addiction Drug Development with Chatbots
The birth of ChatGPT, a cutting-edge language model-based chatbot developed by OpenAI, ushered in a new era in AI. However, due to potential pitfalls, its role in rigorous scientific research is not clear yet. This paper vividly showcases its innovative application within the field of drug discovery. Focused specifically on developing anticocaine addiction drugs, the study employs GPT-4 as a virtual guide, offering strategic and methodological insights to researchers working on generative models for drug candidates. The primary objective is to generate optimal drug-like molecules with desired properties. By leveraging the capabilities of ChatGPT, the study introduces a novel approach to the drug discovery process. This symbiotic partnership between AI and researchers transforms how drug development is approached. Chatbots become facilitators, steering researchers toward innovative methodologies and productive paths for creating effective drug candidates. This research sheds light on the collaborative synergy between human expertise and AI assistance, wherein ChatGPT's cognitive abilities enhance the design and development of pharmaceutical solutions. This paper not only explores the integration of advanced AI in drug discovery but also reimagines the landscape by advocating for AI-powered chatbots as trailblazers in revolutionizing therapeutic innovation.
- 13 November 2023
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 63 (22) , 7189-7209
ChatGPT in Drug Discovery: A Case Study on Anticocaine Addiction Drug Development with Chatbots
The birth of ChatGPT, a cutting-edge language model-based chatbot developed by OpenAI, ushered in a new era in AI. However, due to potential pitfalls, its role in rigorous scientific research is not clear yet. This paper vividly showcases its innovative application within the field of drug discovery. Focused specifically on developing anticocaine addiction drugs, the study employs GPT-4 as a virtual guide, offering strategic and methodological insights to researchers working on generative models for drug candidates. The primary objective is to generate optimal drug-like molecules with desired properties. By leveraging the capabilities of ChatGPT, the study introduces a novel approach to the drug discovery process. This symbiotic partnership between AI and researchers transforms how drug development is approached. Chatbots become facilitators, steering researchers toward innovative methodologies and productive paths for creating effective drug candidates. This research sheds light on the collaborative synergy between human expertise and AI assistance, wherein ChatGPT's cognitive abilities enhance the design and development of pharmaceutical solutions. This paper not only explores the integration of advanced AI in drug discovery but also reimagines the landscape by advocating for AI-powered chatbots as trailblazers in revolutionizing therapeutic innovation.