arXiv subjects

Guo-Wei Wei

Publications and source records attributed to Guo-Wei Wei.

At least 55 records · Page 3Linked to original sources

arXiv2025

Topological Learning Prediction of Virus-like Particle Stoichiometry and Stability

Understanding the stoichiometry and associated stability of virus-like particles (VLPs) is crucial for optimizing their assembly efficiency and immunogenic properties, which are essential for advancing biotechnology, vaccine design, and drug delivery. However, current experimental methods for determining VLP stoichiometry are labor-intensive, and time consuming. Machine learning approaches have hardly been applied to the study of VLPs. To address this challenge, we introduce a novel persistent Laplacian-based machine learning (PLML) mode that leverages both harmonic and non-harmonic spectra to capture intricate topological and geometric features of VLP structures. This approach achieves superior performance on the VLP200 dataset compared to existing methods. To further assess robustness and generalizability, we collected a new dataset, VLP706, containing 706 VLP samples with expanded stoichiometry diversity. Our PLML model maintains strong predictive accuracy on VLP706. Additionally, through random sequence perturbative mutation analysis, we found that 60-mers and 180-mers exhibit greater stability than 240-mers and 420-mers.

q-bio.BM↗

arXiv2025

Topological Data Analysis and Topological Deep Learning Beyond Persistent Homology -- A Review

Topological data analysis (TDA) is a rapidly evolving field in applied mathematics and data science that leverages tools from topology to uncover robust, shape-driven insights in complex datasets. The main workhorse is persistent homology, a technique rooted in algebraic topology. Paired with topological deep learning (TDL) or topological machine learning, persistent homology has achieved tremendous success in a wide variety of applications in science, engineering, medicine, and industry. However, persistent homology has many limitations due to its high-level abstraction, insensitivity to non-topological changes, and reliance on point cloud data. This paper presents a comprehensive review of TDA and TDL beyond persistent homology. It analyzes how persistent topological Laplacians and Dirac operators provide spectral representations to capture both topological invariants and homotopic evolution. Other formulations are presented in terms of sheaf theory, Mayer topology, and interaction topology. For data on differentiable manifolds, techniques rooted in differential topology, such as persistent de Rham cohomology, persistent Hodge Laplacian, and Hodge decomposition, are reviewed. For one-dimensional (1D) curves embedded in 3-space, approaches from geometric topology are discussed, including multiscale Gauss-link integrals, persistent Jones polynomials, and persistent Khovanov homology. This paper further discusses the appropriate selection of topological tools for different input data, such as point clouds, sequential data, data on manifolds, curves embedded in 3-space, and data with additional non-geometric information. A review is also given of various topological representations, software packages, and machine learning vectorizations. Finally, this review ends with concluding remarks.

math.HO↗

arXiv2025

Topological Sequence Analysis of Genomes: Delta Complex approaches

Algebraic topology has been widely applied to point cloud data to capture geometric shapes and topological structures. However, its application to genome sequence analysis remains rare. In this work, we propose topological sequence analysis (TSA) techniques by constructing $Δ$-complexes and classifying spaces, leading to persistent homology, and persistent path homology on genome sequences. We also develop $Δ$-complex-based persistent Laplacians to facilitate the topological spectral analysis of genome sequences. Finally, we demonstrate the utility of the proposed TSA approaches in phylogenetic analysis using Ebola virus sequences and whole bacterial genomes. The present TSA methods are more efficient than earlier TSA model, k-mer topology, and thus have a potential to be applied to other time-consuming sequential data analyses, such as those in linguistics, literature, music, media, and social contexts.

math.AT↗

arXiv2025

Topological Machine Learning for Protein-Nucleic Acid Binding Affinity Changes Upon Mutation

Understanding how protein mutations affect protein-nucleic acid binding is critical for unraveling disease mechanisms and advancing therapies. Current experimental approaches are laborious, and computational methods remain limited in accuracy. To address this challenge, we propose a novel topological machine learning model (TopoML) combining persistent Laplacian (from topological data analysis) with multi-perspective features: physicochemical properties, topological structures, and protein Transformer-derived sequence embeddings. This integrative framework captures robust representations of protein-nucleic acid binding interactions. To validate the proposed method, we employ two datasets, a protein-DNA dataset with 596 single-point amino acid mutations, and a protein-RNA dataset with 710 single-point amino acid mutations. We show that the proposed TopoML model outperforms state-of-the-art methods in predicting mutation-induced binding affinity changes for protein-DNA and protein-RNA complexes.

q-bio.QM↗

arXiv2025

CAML: Commutative algebra machine learning -- a case study on protein-ligand binding affinity prediction

Recently, Suwayyid and Wei have introduced commutative algebra as an emerging paradigm for machine learning and data science. In this work, we integrate 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 introduce three new algorithms, i.e., element-specific commutative algebra, category-specific commutative algebra, and commutative algebra on bipartite complexes, to address 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.

q-bio.BM↗

arXiv2025

Dimensionality reduction for k-means clustering of large-scale influenza mutation datasets

Viral mutations pose significant threats to public health by increasing infectivity, strengthening vaccine resistance, and altering disease severity. To track these evolving patterns, agencies like the CDC annually evaluate thousands of virus strains, underscoring the urgent need to understand viral mutagenesis and evolution in depth. In this study, we integrate genomic analysis, clustering, and three leading dimensionality reduction approaches, namely, principal component analysis (PCA), t-distributed stochastic neighbor embedding (t-SNE), and uniform manifold approximation and projection (UMAP)-to investigate the effects of COVID-19 on influenza virus propagation. By applying these methods to extensive pre- and post-pandemic influenza datasets, we reveal how selective pressures during the pandemic have influenced the diversity of influenza genetics. Our findings indicate that combining robust dimension reduction with clustering yields critical insights into the complex dynamics of viral mutation, informing both future research directions and strategies for public health intervention.

q-bio.PE↗

arXiv2025

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 non-harmonic 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 dataset 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.

q-bio.BM↗

arXiv2025

Persistent Stanley--Reisner Theory

Topological data analysis (TDA) has emerged as an effective approach in data science, with its key technique, persistent homology, rooted in algebraic topology. Although alternative approaches based on differential topology, geometric topology, and combinatorial Laplacians have been proposed, combinatorial commutative algebra has hardly been developed for machine learning and data science. In this work, we introduce persistent Stanley-Reisner theory to bridge commutative algebra, combinatorial algebraic topology, machine learning, and data science. We propose persistent h-vectors, persistent f-vectors, persistent graded Betti numbers, persistent facet ideals, and facet persistence modules. Stability analysis indicates that these algebraic invariants are stable against geometric perturbations. We employ a machine learning prediction on a molecular dataset to demonstrate the utility of the proposed persistent Stanley-Reisner theory for practical applications.

math.AT↗

arXiv2025

Machine learning predictions from unpredictable chaos

Chaos is omnipresent in nature, and its understanding provides enormous social and economic benefits. However, the unpredictability of chaotic systems is a textbook concept due to their sensitivity to initial conditions, aperiodic behavior, fractal dimensions, nonlinearity, and strange attractors. In this work, we introduce, for the first time, chaotic learning, a novel multiscale topological paradigm that enables accurate predictions from chaotic systems. We show that seemingly random and unpredictable chaotic dynamics counterintuitively offer unprecedented quantitative predictions. Specifically, we devise multiscale topological Laplacians to embed real-world data into a family of interactive chaotic dynamical systems, modulate their dynamical behaviors, and enable the accurate prediction of the input data. As a proof of concept, we consider 28 datasets from four categories of realistic problems: 10 brain waves, four benchmark protein datasets, 13 single-cell RNA sequencing datasets, and an image dataset, as well as two distinct chaotic dynamical systems, namely the Lorenz and Rossler attractors. We demonstrate chaotic learning predictions of the physical properties from chaos. Our new chaotic learning paradigm profoundly changes the textbook perception of chaos and bridges topology, chaos, and learning for the first time.

nlin.CD↗

arXiv2025

Manifold Topological Deep Learning for Biomedical Data

Recently, topological deep learning (TDL), which integrates algebraic topology with deep neural networks, has achieved tremendous success in processing point-cloud data, emerging as a promising paradigm in data science. However, TDL has not been developed for data on differentiable manifolds, including images, due to the challenges posed by differential topology. We address this challenge by introducing manifold topological deep learning (MTDL) for the first time. To highlight the power of Hodge theory rooted in differential topology, we consider a simple convolutional neural network (CNN) in MTDL. In this novel framework, original images are represented as smooth manifolds with vector fields that are decomposed into three orthogonal components based on Hodge theory. These components are then concatenated to form an input image for the CNN architecture. The performance of MTDL is evaluated using the MedMNIST v2 benchmark database, which comprises 717,287 biomedical images from eleven 2D and six 3D datasets. MTDL significantly outperforms other competing methods, extending TDL to a wide range of data on smooth manifolds.

eess.IV↗

arXiv2025

Artificial Intelligence Approaches for Anti-Addiction Drug Discovery

Drug addiction is a complex and pervasive global challenge that continues to pose significant public health concerns. Traditional approaches to anti-addiction drug discovery have struggled to deliver effective therapeutics, facing high attrition rates, long development timelines, and inefficiencies in processing large-scale data. Artificial intelligence (AI) has emerged as a transformative solution to address these issues. Using advanced algorithms, AI is revolutionizing drug discovery by enhancing the speed and precision of key processes. This review explores the transformative role of AI in the pipeline for anti-addiction drug discovery, including data collection, target identification, and compound optimization. By highlighting the potential of AI to overcome traditional barriers, this review systematically examines how AI addresses critical gaps in anti-addiction research, emphasizing its potential to revolutionize drug discovery and development, overcome challenges, and advance more effective therapeutic strategies.

q-bio.BM↗

arXiv2025

Drug Resistance Predictions Based on a Directed Flag Transformer

The continuous evolution of the SARS-CoV-2 virus poses a significant challenge to global public health. Of particular concern is the potential resistance to the widely prescribed drug PAXLOVID, of which the main ingredient nirmatrelvir inhibits the viral main protease (Mpro). Here, we developed CAPTURE (direCted flAg laPlacian Transformer for drUg Resistance prEdictions) to analyze the effects of Mpro mutations on nirmatrelvir-Mpro binding affinities and identify potential drug-resistant mutations. CAPTURE combines a comprehensive mutation analysis with a resistance prediction module based on DFFormer-seq, which is a novel ensemble model that leverages a new Directed Flag Transformer and sequence embeddings from the protein and small-molecule-large-language models. Our analysis of the evolution of Mpro mutations revealed a progressive increase in mutation frequencies for residues near the binding site between May and December 2022, suggesting that the widespread use of PAXLOVID created a selective pressure that accelerated the evolution of drug-resistant variants. Applied to mutations at the nirmatrelvir-Mpro binding site, CAPTURE identified several potential resistance mutations, including H172Y and F140L, which have been experimentally confirmed, as well as five other mutations that await experimental verification. CAPTURE evaluation in a limited experimental data set on Mpro mutants gives a recall of 57\% and a precision of 71\% for predicting potential drug-resistant mutations. Our work establishes a powerful new framework for predicting drug-resistant mutations and real-time viral surveillance. The insights also guide the rational design of more resilient next-generation therapeutics.

q-bio.QM↗

arXiv2025

Proteomic Learning of Gamma-Aminobutyric Acid (GABA) Receptor-Mediated Anesthesia

Anesthetics are crucial in surgical procedures and therapeutic interventions, but they come with side effects and varying levels of effectiveness, calling for novel anesthetic agents that offer more precise and controllable effects. Targeting Gamma-aminobutyric acid (GABA) receptors, the primary inhibitory receptors in the central nervous system, could enhance their inhibitory action, potentially reducing side effects while improving the potency of anesthetics. In this study, we introduce a proteomic learning of GABA receptor-mediated anesthesia based on 24 GABA receptor subtypes by considering over 4000 proteins in protein-protein interaction (PPI) networks and over 1.5 millions known binding compounds. We develop a corresponding drug-target interaction network to identify potential lead compounds for novel anesthetic design. To ensure robust proteomic learning predictions, we curated a dataset comprising 136 targets from a pool of 980 targets within the PPI networks. We employed three machine learning algorithms, integrating advanced natural language processing (NLP) models such as pretrained transformer and autoencoder embeddings. Through a comprehensive screening process, we evaluated the side effects and repurposing potential of over 180,000 drug candidates targeting the GABRA5 receptor. Additionally, we assessed the ADMET (absorption, distribution, metabolism, excretion, and toxicity) properties of these candidates to identify those with near-optimal characteristics. This approach also involved optimizing the structures of existing anesthetics. Our work presents an innovative strategy for the development of new anesthetic drugs, optimization of anesthetic use, and deeper understanding of potential anesthesia-related side effects.

q-bio.BM↗

arXiv2024

Revealing the Shape of Genome Space via K-mer Topology

Despite decades of effort, understanding the shape of genome space in biology remains a challenge due to the similarity, variability, diversity, and plasticity of evolutionary relationships among species, genes, or other biological entities. We present a k-mer topology method, the first of its kind, to delineate the shape of the genome space. K-mer topology examines the topological persistence and the evolution of the homotopic shape of the sequences of k nucleotides in species, organisms, and genes using persistent Laplacians, a new multiscale combinatorial approach. We also propose a topological genetic distance between species by their topological invariants and non-harmonic spectra over scales. This new metric defines the topological phylogenetic trees of genomes, facilitating species classification and clustering. K-mer topology substantially outperforms state-of-the-art methods on a variety of benchmark datasets, including mammalian mitochondrial genomes, Rhinovirus, SARS-CoV-2 variants, Ebola virus, Hepatitis E virus, Influenza hemagglutinin genes, and whole bacterial genomes. K-mer topology reveals the intrinsic shapes of the genome space and can be directly applied to the rational design of viral vaccines.

q-bio.GN↗

arXiv2024

Category-Specific Topological Learning of Metal-Organic Frameworks

Metal-organic frameworks (MOFs) are porous, crystalline materials with high surface area, adjustable porosity, and structural tunability, making them ideal for diverse applications. However, traditional experimental and computational methods have limited scalability and interpretability, hindering effective exploration of MOF structure-property relationships. To address these challenges, we introduce, for the first time, a category-specific topological learning (CSTL), which combines algebraic topology with chemical insights for robust property prediction. The model represents MOF structures as simplicial complexes and incorporates elemental categorizations to enable balanced, interpretable machine learning study. By integrating category-specific persistent homology, CSTL captures both global and local structural characteristics, rendering multi-dimensional, category-specific descriptors that support a predictive model with high accuracy and robustness across eight MOF datasets, outperforming all previous results. This alignment of topological and chemical features enhances the predictive power and interpretability of CSTL, advancing understanding of structure-property relationships of MOFs and promoting efficient material discovery.

q-bio.BM↗

arXiv2024

Superionic Ionic Conductor Discovery via Multiscale Topological Learning

Lithium superionic conductors (LSICs) are crucial for next-generation solid-state batteries, offering exceptional ionic conductivity and enhanced safety for renewable energy and electric vehicles. However, their discovery is extremely challenging due to the vast chemical space, limited labeled data, and the understanding of complex structure-function relationships required for optimizing ion transport. This study introduces a multiscale topological learning (MTL) framework, integrating algebraic topology and unsupervised learning to tackle these challenges efficiently. By modeling lithium-only and lithium-free substructures, the framework extracts multiscale topological features and introduces two topological screening metrics-cycle density and minimum connectivity distance-to ensure structural connectivity and ion diffusion compatibility. Promising candidates are clustered via unsupervised algorithms to identify those resembling known superionic conductors. For final refinement, candidates that pass chemical screening undergo ab initio molecular dynamics simulations for validation. This approach led to the discovery of 14 novel LSICs, four of which have been independently validated in recent experiments. This success accelerates the identification of LSICs and demonstrates broad adaptability, offering a scalable tool for addressing complex materials discovery challenges.

cond-mat.mtrl-sci↗

arXiv2024

A Khovanov Laplacian and Khovanov Dirac for Knots and Links

Khovanov homology has been the subject of much study in knot theory and low dimensional topology since 2000. This work introduces a Khovanov Laplacian and a Khovanov Dirac to study knot and link diagrams. The harmonic spectrum of the Khovanov Laplacian or the Khovanov Dirac retains the topological invariants of Khovanov homology, while their non-harmonic spectra reveal additional information that is distinct from Khovanov homology.

math.GT↗

arXiv2024

Persistent Topological Laplacians -- a Survey

Persistent topological Laplacians constitute a new class of tools in topological data analysis (TDA). They are motivated by the necessity to address challenges encountered in persistent homology when handling complex data. These Laplacians combines multiscale analysis with topological techniques to characterize the topological and geometrical features of functions and data. Their kernels fully retrieve the topological invariants of corresponding persistent homology, while their non-harmonic spectra provide supplementary information. Persistent topological Laplacians have demonstrated superior performance over persistent homology in analyzing large-scale protein engineering datasets. In this survey, we offer a pedagogical review of persistent topological Laplacians formulated in various mathematical settings, including simplicial complexes, path complexes, flag complexes, digraphs, hypergraphs, hyperdigraphs, cellular sheaves, as well as $N$-chain complexes.

math.AT↗