Searcharxiv⌕ Search

arXiv subjects

Guo-Wei Wei

Publications and source records attributed to Guo-Wei Wei.

At least 19 recordsLinked to original sources

Commutative Algebra Modeling of Mutation and Disease Association

Genetic mutations can lead to disease by disrupting molecular interactions, altering protein stability, inducing misfolding, and promoting protein aggregation. Although existing predictive models have achieved promising performance, they often lack mechanistic interpretability and fail to fully incorporate the underlying physical and chemical principles governing mutation-induced effects. Moreover, current approaches typically address disease association, protein stability changes, and solubility alterations as separate prediction tasks rather than integrating them within a unified framework. In this study, we introduce a multiscale commutative algebra modeling framework for predicting disease-mutation association. Leveraging persistent Stanley-Reisner theory, we extract algebraic invariants to build two predictive models: Commutative Algebra Neural Network (CANet) and Commutative Algebra Gradient Boosting Tree (CATree). The proposed framework is applied to three biologically connected tasks: disease-associated mutation identification, mutation-induced protein stability change prediction, and mutation-induced protein solubility change classification. Across six benchmark tasks, CANet and CATree consistently achieve leading predictive performance, with up to 7.5% relative improvement over existing methods. These results demonstrate that commutative algebra provides a unified, interpretable, and generalizable modeling strategy for mutation-disease association prediction.

q-bio.QM↗

Mathematical AI Predicts 40% and 57% Influenza Vaccine Effectiveness Against H1N1 and H3N2, Respectively, for the 2026--2027 U.S. Season

Background: Clinical influenza vaccine effectiveness (VE) has often been low over the past two decades, highlighting the need for preseason VE forecasting. Timely forecasts could help health authorities plan prevention strategies and allocate healthcare resources. However, preseason forecasting of clinical influenza VE remains relatively uncommon. Methods: We obtained hemagglutinin (HA) sequences from GISAID for U.S. specimens collected in August--September before each influenza season from 2010--2011 through 2024--2025. After quality screening, we compared each virus with the corresponding vaccine target strain for the same season and subtype or lineage using two mathematical distances based on amino acid patterns in the HA protein. We calculated mean distances for each season and subtype or lineage and paired them with published clinical VE estimates, yielding 26 observations across 13 seasons. Using a mathematical AI approach, we fitted linear regression models of VE against each distance and evaluated their predictive performance by forecasting later seasons using data from earlier seasons, with the historical mean VE for each subtype or lineage as a reference. We then applied the same approach to 87 HA sequences collected in August--September 2026 to forecast VE for the 2026--2027 season. Results: We generated component-specific forecasts of influenza VE for the upcoming 2026--2027 U.S. season. Both mathematical distances were negatively associated with historical VE, indicating that greater differences between circulating viruses and vaccine strains were associated with lower VE. The topological model forecast VE of 40.3%, 56.9%, and 47.1% against A(H1N1)pdm09, A(H3N2), and B/Victoria, respectively, whereas the geometric model forecast corresponding VE values of 34.0%, 56.8%, and 51.1%.

math.AT↗

Capturing Coordination Core Topology in Metal--Organic Frameworks Using Persistent Mayer Homology

Local coordination cores are critically important in metal-organic frameworks (MOFs) and polyoxometalates (POMs), as they govern the fundamental chemical and structural properties of these materials. Existing methods, including element-resolved persistent homology (ERPH), have limited ability to translate local coordination cores into quantitative, scalable, and interpretable information. Here, we introduce persistent Mayer homology (PMH) to enable the detection of the geometric variability invisible by classical topology. By focusing on coordination cores formed by periodic metal-centered heavy-atom, carbon, and donor channels, PMH distinguishes different arrangements of the local coordination environment, linker framework, and potential coordinating atoms. We examine explainable PMH of orders $N=3$ and $N=5$ and separately combine each with ERPH, which characterizes the multiscale organization of chemically defined element groups across the extended framework, to predict eight nitrogen- and oxygen-related adsorption and self-diffusion properties. The resulting coordination-core PMH representations consistently improve predictive performance over ERPH alone, with the third-order Mayer representation providing the strongest overall performance. These results demonstrate that the inner coordination configurations captured by PMH contain essential structural information that is not fully represented by conventional element-resolved topological descriptors. This finding provides a quantitative interpretable topological framework for understanding local coordination environments and may facilitate the rational design of MOFs and POM-based materials.

cond-mat.mtrl-sci↗

TopoLIA: Topology-Inspired Latent Interaction Attention for Drug Discovery

The growing sophistication of drug discovery calls for new advances in artificial intelligence (AI). Transformers have underpinned recent breakthroughs in AI, yet their conventional source-target attention mechanism can become a bottleneck for modeling complex interactions. Here, we introduce TopoLIA, a topology-inspired latent interaction attention mechanism that learns not only how much information should be exchanged between interaction partners, but also how that information should be transformed. Source-target-dependent attention is mediated through a compact latent interaction space, providing a structured representation of complex interactions. We further incorporate topological spectral representations to capture multiscale data geometry and extract algebraic relationships. TopoLIA thus incorporates topological principles into both data representation and neural network architecture. We demonstrate TopoLIA on protein-ligand binding, where persistent spectra encode multiscale topological and geometric patterns in 3D protein-ligand complexes, while latent interaction attention (LIA) enables structured, source-target-dependent information exchange. We pretrain TopoLIA by reconstructing masked multiscale spectral tokens from unlabeled molecular structures, yielding transferable structural representations without task-specific annotations. Across multiple scoring and docking benchmarks, TopoLIA achieves state-of-the-art performance and consistently outperforms its standard-attention counterpart. Rank analyses show that compact latent dimensions yield the best performance, supporting compact interaction spaces as an effective inductive bias for biomolecular learning. More broadly, LIA provides a general framework for structured, source-target-dependent information exchange that is applicable to diverse scientific and AI problems involving complex heterogeneous interactions.

q-bio.BM↗

Mathematical Invariant-Enabled Topological Neural Networks for Molecular and Materials Property Prediction

Existing molecular and materials learning approaches often rely on a limited set of structural representations, which may capture only selected aspects of complex three-dimensional structure. Here, we introduce mathematical invariant-enabled topological neural networks (MITNNs), a framework that represents complex structures through multiple complementary mathematical views and integrates them with topological neural architectures. MITNNs combine multiscale invariants from topology, spectral theory, commutative algebra, differential geometry, and discrete curvature, capturing complementary structural information from the same system. Systematic invariant-subset, architecture-subset, and ensemble analyses show that predictive performance depends on how mathematical representations and neural architectures are paired, with selected combinations outperforming individual models and the aggregation of all available components. Across protein-ligand binding, metal-organic framework properties, mutation-induced protein solubility, and molecular toxicity prediction, MITNN consistently outperforms existing methods. These results establish MITNN as a mathematically multimodal framework for scientific machine learning.

q-bio.BM↗

TargetAgent: Mathematical AI Co-Scientist for Drug Target Identification

Given the challenges of pharmaceutical development, there is increasing interest in computational approaches for identifying novel drug targets. Transcriptomics technologies enable the analysis of disease mechanisms at unprecedented resolution, while spatially resolved platforms further preserve the spatial organization of cells within tissues, allowing analysis to focus on specific regions of disease localization. To derive actionable therapeutic targets from these data, it is necessary to identify mechanisms that recur across a population rather than those observed in individual patients, which requires integrated analysis across disease conditions and donor cohorts. Here, we present the groundwork for an AI co-scientist framework for the sequential analysis of multi-batch spatial transcriptomics data that integrates interpretable mathematical models, including optimal transport, tensor factorizations, and topological data analysis, with LLM-powered agentic interpretation. Leveraging the complementary information provided by these mathematical models, the agents sequentially identify regions in which the disease is localized, molecular targets within these regions, and the direction in which each target should be modulated. Applied as a proof of concept to a public Stereo-seq study of the Alzheimer's disease (AD)-affected prefrontal cortex, we demonstrate that the agents converge on the white matter as the primary locus of the moderate-disease signal and identify a loss of myelin programme usage despite increasing oligodendrocyte abundance. The agents subsequently propose 29 candidate therapeutic targets, led by an oligodendrocyte differentiation module on which multiple mathematical perspectives converge, and flag 20 genes whose relevance to AD has not been previously reported. These results are hypothesis-generating and motivate further validation in larger, independent cohorts.

q-bio.QM↗

MathAgent: Multi-Agent Optimization of Mathematical Invariants for Molecular Property Prediction

Mathematical invariants provide complementary representations of molecular structure, but their predictive utility can vary across datasets and prediction tasks. For a new dataset, appropriate construction of invariant representations from algebraic topology, differential geometry, topological spectral theory, and commutative algebra is a challenging task, particularly when evaluating multiple representations is computationally expensive. We develop a Mathematical Agentic Model (MathAgent) to automatically optimize invariant representations in molecular property prediction. The framework combines dataset-aware representation design, low-cost candidate screening, and progressive evaluation. Language-model reasoning supports task interpretation, strategy proposal, and workflow coordination, while scientific computations and numerical decisions are carried out by deterministic tools. We evaluate MathAgent on protein--ligand binding-affinity and quantitative toxicity prediction tasks. Different datasets favor different combinations of mathematical invariants, demonstrating the need for dataset-adaptive representation selection rather than a fixed universal representation. Objective-conditioned executions further show that the framework can adjust its evaluation strategy according to user-specified goals. MathAgent therefore provides a systematic, evidence-driven, and traceable approach for optimizing mathematical invariant representations and reducing reliance on manual configuration and/or experimentation in molecular property prediction.

q-bio.BM↗

Fragment Path Complex Networks for Viral Genome Classification

Accurate classification of viral families is essential to understanding genomic diversity, but rapid evolution and heterogeneous genome structure complicate reliable assignment. Newly discovered viruses, particularly those from underrepresented ecosystems, expand the known diversity of viral genomes. This growing diversity poses challenges for classification methods that rely on similarity to existing references. We present Fragment Path Complex Networks (FPCN), a framework that represents viral genomes as sequences of ordered fragments at various scales. FPCN captures contextual sequence information within each fragment and uses path complexes to model complex relationships between neighboring fragments. We evaluated FPCN on well-established NCBI benchmarks, and FPCN achieved higher classification accuracy than competing methods. Further evaluations on newly released datasets revealed FPCN's ability to generalize to genomes that were not presented in the training. Together, these results position FPCN as an effective tool for classifying viral genomes within known families across benchmark datasets and newly released genomes.

q-bio.GN↗

CANN: Commutative Algebra Neural Networks for Virus Classification

The extensive diversity of viral genomes challenges alignment-free representations to capture both nucleotide composition and the higher-order organization of recurring sequence patterns. Conventional $k$-mer representations quantify pattern abundance but do not explicitly encode how these patterns are organized across scales. Here, we introduce CANN, an alignment-free framework that combines persistent commutative-algebraic descriptors with neural representation learning for viral family classification. CANN uses persistent facet descriptors to encode the multiscale organization of $k$-mer patterns and complementary $k$-mer counts to capture sequence composition. Convolutional and Transformer encoders independently learn latent representations of these features, and cosine distances within their respective embedding spaces are averaged before $k$-nearest-neighbor classification. Across multiple NCBI viral genome collections, CANN achieves robust family-level performance, with the fusion of encoder-specific distances consistently improving classification relative to either encoder alone. Evaluation on genomes present in the 2026 NCBI collection but absent from the 2024 reference set further supports generalization to unseen members of families already represented in the reference data. Together, these findings show that persistent commutative-algebraic descriptors can complement neural representations of viral genomes, linking algebraic descriptions of genomic organization with data-driven classification.

q-bio.GN↗

Mayer Path Homology

We introduce Mayer path homology, a new homology theory for directed path complexes obtained by equipping path complexes with an $N$-nilpotent differential. The main novelty of this work is the introduction of an $N$-differential on path complexes, giving rise to $N$-chain complexes of $\partial$-invariant paths and Mayer path homology groups $H_n^{N,q}(P)$. We prove that this construction defines a canonical invariant of directed graphs and is more sensitive than standard path homology, distinguishing directed network motifs that ordinary path homology cannot separate. We further establish a complete classification of generators of $Ω_2^N$ and $Ω_3^N$, determining all admissible combinatorial types. Finally, we characterize elements of the first Mayer path cycles group $Z_1^{N,q}$ in terms of weighted directed cycles arising from spanning-tree constructions. These results provide the first systematic structural theory for Mayer path complexes and reveal new higher-order algebraic structures in directed graphs.

math.AT↗

Quantum Advantage in Topological Data Analysis via Mayer Homology

Prior work has explored quantum algorithms for topological data analysis (TDA), revealing the possibility of exponential quantum speedups in estimating the ratios of Betti numbers to the dimension of the combinatorial Laplacian. However, this quantity is only non-vanishing and efficient-to-quantumly-estimate when Betti numbers are exponentially large, a case for which concrete examples are rarely known. Furthermore, certain randomized classical algorithms are sometimes efficient in this regime. Thus, the prospect of achieving quantum advantage in conventional TDA appears fairly narrow. Here, we address these challenges to the quantum advantage in TDA by developing quantum algorithms for Mayer homology, which generalize simplicial homology to $N$-nilpotent boundary operators ($\partial^N =0$) and have recently been successfully applied to real-world TDA contexts. We introduce an efficient quantum algorithm for estimating Mayer Betti numbers and their persistent counterparts. We then prove that for high-order simplices, Mayer Betti numbers are often exponentially large in the dense regime, which ameliorates the normalization bottleneck of conventional quantum TDA. In the same regime, we argue that existing dequantization algorithms developed for conventional TDA, when applied to Mayer homology, generally lose theoretical guaranties, facing certain structural barriers that prevent their practical utilities. We also provide logical resource estimates revealing that a quantum computer with roughly a few hundred qubits and sixty million Toffoli gates could solve Mayer homology problems beyond the capabilities of known classical approaches. Finally, we discuss real-world applications of Mayer homology in genomics, supersymmetry, drug discovery, and neuroscience, revealing the potential of our quantum algorithm to deliver real-world impacts via Mayer homology.

quant-ph↗

Combinatorial Network-Based Manifold Topological Deep Learning for Image Analysis

Medical image analysis remains fundamentally challenging because of the intricate geometric and topological structures present in medical data. Conventional convolutional neural networks model images as regular Euclidean grids, limiting their ability to preserve geometric relationships and higher-order structural information. Recently, manifold topological deep learning (MTDL) has emerged as a promising paradigm that integrates deep learning with geometric and topological representations. Nevertheless, existing methods have not yet fully exploited discrete manifold structures within combinatorial complex neural networks. To bridge this gap, we introduce CNMTDL, a MTDL framework that integrates Hodge decomposition with a combinatorial attention mechanism. In our approach, medical images are represented as discrete manifolds and decomposed into three Hodge components. Features extracted from these components are concatenated and embedded into a combinatorial complex architecture, enabling enhanced higher-order message passing between $0$-cells and $2$-cells through attention-based blocks. We evaluate CNMTDL on six two-dimensional and three-dimensional datasets from the MedMNIST v2 benchmark, demonstrating its effectiveness for medical image analysis.

cs.CV↗

GrassTop: Grassmannian k-mer Topology for Viral Classification and Phylogenetic Analysis

We introduce GrassTop, a genome representation that integrates Grassmann manifolds and algebraic topology for viral classification and phylogenetic analysis. The framework begins by constructing multiscale topological and spectral descriptors of (k)-mer positional patterns. It then extracts a low-rank subspace that summarizes variation across the filtration and compares genomes using a Grassmannian distance. Although the reported implementation uses the chordal distance, the framework is not restricted to this particular choice. We evaluate GrassTop on four families of viral classification datasets, four phylogenetic clustering datasets, and a sequence perturbation experiment. Under the reported 5-nearest-neighbor protocol, GrassTop achieves higher scores than five published alignment-free reference methods across all reported classification metrics and datasets. Its UPGMA (unweighted pair-group method using arithmetic averages) trees achieve an average label purity of 1.0 on every phylogenetic dataset. The perturbation experiment provides a more nuanced result: the subspace representation differs most clearly from direct comparison of the unprojected feature matrices for SARS-CoV-2, whereas the differences are smaller or non-monotonic for the other datasets. Overall, these results support GrassTop as an effective topological-geometric representation for viral classification and phylogenetic analysis.

q-bio.PE↗

Data-Adaptive Grassmann Manifold Representations for Spatial Transcriptomics Alignment

Spatial transcriptomics measures gene expression together with spatial coordinates, but many existing analysis methods represent each spot primarily by a single feature vector. We propose GrassST, a subspace method for spatial transcriptomics analysis and cross-slice alignment. For each spatial spot, GrassST constructs a neighborhood from tissue coordinates, fits a low-dimensional subspace to the embedded expression profiles in that neighborhood, and represents the spot by the resulting subspace. These representations are points on a Grassmann manifold and can be compared using distances between subspaces. GrassST selects the neighborhood size and subspace rank from the spectral energy of the data, allowing these parameters to vary across datasets rather than being fixed globally. Experiments on four spatial transcriptomics datasets show that GrassST achieves competitive clustering and cross-slice integration performance under a unified evaluation pipeline.

math.AG↗

Localized Persistent Commutative Algebra

We develop a localized persistent theory of commutative algebra for Stanley-Reisner rings, based on local cohomology supported at a coordinate prime rather than at the maximal ideal. The construction is modeled on the persistent Stanley-Reisner theory of Suwayyid and Wei (arXiv:2503.23482) and its functorial development for graphs and hypergraphs (arXiv:2512.17619), in which invariants of the face ring such as graded Betti numbers and f- and h-vectors are persisted across a filtration. That framework is built from the minimal free resolution and is thus Tor-theoretic; we work instead on the injective side, and the resulting modules record information localized at a single vertex, complementing the global picture given by maximal-support local cohomology. For a vertex prime $p_i = (x_j : j \neq i)$ we prove an exact $\mathbb{Z}^n$-graded decomposition of $H^q_{p_i}(k[Δ])$ into the maximal-support local cohomology of the deletion and of the link of the vertex $i$, the first in $x_i$-degree zero and the second repeated in every positive $x_i$-degree; at the level of graded dimensions this recovers the vertex-prime case of Rahimi's bigraded formula. With Hochster's formula this yields a closed combinatorial description of every multigraded piece. Building on this structure we introduce per-vertex persistent local cohomology numbers, prove a persistent links-Hochster formula, obtain interval decompositions of the resulting reversed-arrow persistence modules and a bottleneck stability theorem, retain multiplication by the uninverted variable as a morphism of persistence modules that the two barcodes alone do not determine, and extend the theory to an arbitrary coordinate prime, where the multiplication maps of the uninverted variables assemble into a commuting Boolean diagram of persistence modules.

math.AC↗

Parametrization of Symmetry in Data

Symmetry plays a fundamental role in understanding natural phenomena and mathematical structures. This work develops a comprehensive theory for studying the persistent symmetries and degree of asymmetry of finite point configurations over parameterization in metric spaces. Leveraging category theory and span categories, we define persistent symmetry groups and introduce novel invariants called symmetry barcodes and polybarcodes that capture the birth, death, persistence, and reappearance of symmetries over parameter evolution. Metrics and stability theorems are established for these invariants. The concept of symmetry types is formalized via the action of isometry groups in configuration spaces. To quantitatively characterize symmetry and asymmetricity, measures such as degree of symmetry and symmetry defect are introduced, the latter revealing connections to approximate group theory in Euclidean settings. Moreover, a theory of persistence representations of persistence groups is developed, generalizing the classical decomposition theorem of persistence modules. Persistent Fourier analysis on persistence groups is further proposed to characterize dynamic phenomena including symmetry breaking and phase transitions. Algorithms for computing symmetry groups, barcodes, and symmetry defect in low-dimensional spaces are presented, complemented by discussions on extending symmetry analysis beyond geometric contexts. This work thus bridges geometric group theory, topological data analysis, representation theory, and machine learning, providing novel tools for the analysis of the parametrized symmetry of data.

math.AT↗

PSLL: Persistent Sheaf Laplacian Learning for Protein-Ligand Binding Affinity Prediction

Accurate prediction of protein-ligand binding affinity remains a central challenge in computational drug discovery due to the complex interplay among molecular geometry, physicochemical interactions, and atom-specific charge information. In this work, we introduce a Persistent Sheaf Laplacian learning (PSLL) framework for protein-ligand binding affinity prediction. The proposed approach constructs multiscale topological representations from three-dimensional protein-ligand complexes by incorporating atomic partial charges into sheaf restriction maps over Vietoris-Rips and alpha complex filtrations. To capture chemically diverse protein-ligand interactions, we introduce element-specific and category-specific atom-pair representations within the PSLL framework. Harmonic and non-harmonic spectra extracted from the resulting persistent sheaf Laplacians are used as molecular descriptors. To complement the PSLL-derived molecular representation, we incorporate transformer-based protein embeddings and SMILES-derived ligand descriptors for binding affinity prediction. The scoring power of the proposed multiscale PSLL model is validated against existing state-of-the-art methods on three widely used PDBbind benchmark datasets, including PDBbind-v2007, PDBbind-v2013, and PDBbind-v2016. The computational results indicate that the proposed PSLL model achieves strong predictive performance across benchmark datasets, highlighting its potential as an interpretable and mathematically grounded framework with promising generalizability for molecular machine learning and drug discovery.

q-bio.BM↗

CAKR: Commutative algebra k-mer representations for genomics

Despite the availability of various sequence analysis models, comparative genomic analysis remains a challenge in genomics, genetics, and phylogenetics. Commutative algebra, a fundamental tool in algebraic geometry and number theory, has rarely been used in data and biological sciences. In this study, we introduce commutative algebra $k$-mer representations as a nonlinear algebraic framework for analyzing genomic sequences. This representation bridges commutative algebra, algebraic topology, combinatorics, and machine learning to establish a mathematical framework for comparative genomic analysis. We evaluate its effectiveness on three tasks including genetic variant classification, phylogenetic tree reconstruction, and viral classification, typically requiring alignment-based, alignment-free, and machine-learning approaches, respectively. In this work, we show that commutative algebra k-mer representations outperform five state-of-the-art sequence analysis methods across twelve primary datasets, with two additional supplementary fragment-placement benchmarks, especially in viral classification, and maintain relatively stable predictive accuracy as dataset size increases, underscoring scalability and robustness.

q-bio.QM↗