Searcharxiv⌕ Search

arXiv subjects

Mushal Zia

Publications and source records attributed to Mushal Zia.

11 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↗

Multiscale Topology-Regulated Nonlinear Dynamics for Protein B-Factor Prediction and Single-Cell Type Classification

Protein B-factor prediction and single-cell type classification are important for characterizing structural variability and cellular heterogeneity, with applications in biological function analysis and drug discovery. However, static geometric descriptors do not directly capture how multiscale connectivity shapes responses to local perturbations. Here, we introduce multiscale graph-coupled Burgers response learning (MGCBRL), a framework integrating algebraic topology and nonlinear dynamics to construct predictive biological representations. Specifically, a filtration converts protein coordinates or cellular principal component scores into weighted graphs at ten neighborhood scales. Independent unit impulses initiate node-specific responses governed by nonlinear Burgers dynamics. Statistical summaries or sampled source-node trajectories then encode the influence of structural neighborhoods on transient signal evolution. The simulated responses serve as computational probes rather than models of biological motion. For cross-protein prediction, multiscale response statistics are combined with spectral perturbation descriptors measuring changes in Laplacian spectra after node removal. For single-cell classification, principal component scores augment these features to retain explicit expression-space information, and the resulting descriptors support downstream supervised learning. Across 104 proteins and 13 single-cell datasets, MGCBRL achieved configuration-selected mean scores of 0.888 for within-protein Pearson correlation and 0.950 for transductive cell classification balanced accuracy, with leave-one-protein-out mean correlations of 0.496-0.558. Our framework provides a shared strategy for transforming multiscale biological connectivity into informative response descriptors, supporting predictive analysis of protein structures and transcriptomic profiles.

q-bio.QM↗

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↗

Chaotic Dynamics-Regulated Topological Learning for Patient-Specific Preictal State Identification

Epileptic seizures arise from complex, nonlinear interactions within brain networks, yet reliable electroencephalographic (EEG) prediction remains challenging due to the nonstationary and heterogeneous nature of neural dynamics. Existing methods typically analyze EEG data as static or weakly time-dependent snapshots, overlooking the intrinsic dynamics and lacking the geometric sensitivity to capture the hierarchical, localized evolution of the epileptogenic zone. To address these limitations, we propose an offline, patient-specific evaluation of chaotic dynamics-regulated topological learning (CDRTL) for distinguishing preictal from interictal EEG states. This framework unifies chaotic dynamics, multiscale algebraic topology, and local network differentiation. Specifically, we partition EEG signals into discrete functional subnets based on correlation strengths, capturing the multi-scale connectivity of the brain. By modeling each node as a Lorenz oscillator, we embed the underlying chaotic dynamics into the network architecture. We then apply the persistent Laplacian to simultaneously extract topological invariants and geometric shape evolution through harmonic and non-harmonic spectral analysis. Additionally, a node-removal topological differentiation strategy isolates localized neural contributions. Our framework was evaluated on the CHB-MIT database using balanced preictal and interictal labels and stratified channel-level cross-validation within each patient. The results support offline discrimination of preictal and interictal channel-level nodes within fixed patient-specific networks. Because representations are constructed from the complete network, including held-out unlabeled nodes, before cross-validation, the reported performance is specific to this transductive setting and does not establish generalization to unseen EEG windows, seizures, or patients.

q-bio.NC↗

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↗

GBNL: Graded Betti Number Learning of Complex Biological Data

While persistent homology is widely used for data shape analysis, persistent commutative algebra (PCA) has seen limited adoption in machine learning and data science. Unlike persistent homology, which delivers topological invariants in the form of Betti numbers, PCA provides both algebraic invariants and graded Betti numbers. However, graded Betti numbers have seldom been applied to real-world data. In this work, we introduce the first-of-its-kind application of commutative algebra graded Betti numbers in machine learning and data science. Specifically, we present Graded Betti Number Learning (GBNL) for protein-nucleic acid binding prediction. Protein-DNA/RNA interactions are fundamental to cellular processes such as replication, transcription, translation, and gene regulation, and their understanding and prediction remain challenging. GBNL represents each nucleic acid sequence as a family of $k$-mer-specific sets and derives persistent graded Betti invariants from PCA, generating multiscale topological representations of local nucleotide organization. To incorporate cross-molecule context, these graded Betti representations are paired with transformer-based protein embeddings, linking nucleotide-level signals with global protein patterns. The proposed graded Betti representations effectively detect single-site mutations and distinguish complete mutation patterns. Operating on primary sequences with minimal preprocessing, GBNL bridges commutative algebra, reduced algebraic topology, combinatorics, and machine learning, establishing a new paradigm for comparative sequence analysis. Numerical studies using three datasets highlight the success of GBNL in protein-nucleic acid binding prediction.

math.AC↗

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), 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 $\textit{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.

q-bio.QM↗

Topological Sequence Analysis of Genomes: Category theory Approaches

Sequence data, such as DNA, RNA, and protein sequences, exhibit intricate, multi-scale structures that pose significant challenges for conventional analysis methods, particularly those relying on alignment or purely statistical representations. In this work, we introduce category-based topological sequence analysis (CTSA ) of genomes. CTSA models a sequence as a resolution category, capturing its hierarchical structure through a categorical construction. Substructure complexes are then derived from this categorical representation, and their persistent homology is computed to extract multi-scale topological features. Our models depart from traditional alignment-free approaches by incorporating structured mathematical formalisms rooted in sequence topology. The resulting topological signatures provide informative representations across a variety of tasks, including the phylogenetic analysis of SARS-CoV-2 variants and the prediction of protein-nucleic acid binding affinities. Comparative studies were carried out against six state-of-the-art methods. Experimental results demonstrate that CTSA achieves excellent and consistent performance in these tasks, suggesting its general applicability and robustness. Beyond sequence analysis, the proposed framework opens new directions for the integration of categorical and homological theories for biological sequence analysis.

q-bio.GN↗

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↗

Persistent Directed Flag Laplacian (PDFL)-Based Machine Learning for Protein-Ligand Binding Affinity Prediction

Directionality in molecular and biomolecular networks plays a significant role in the accurate represention 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 the PDFL, providing an in-depth analysis of spectral graph theory combined with machine learning. Besides its superior accuracy and reliability, the PDFL model offers simplicity by requiring only raw inputs without complex data processing. We validated our multi-kernel PDFL model for its scoring power against other state-of-art methods on three popular benchmarks, namely PDBbind v2007, v2013, and v2016. Computational results indicate that the proposed PDFL model outperforms competitors in protein-ligand binding affinity predictions, indicating that PDFL is a promising tool for protein engineering, drug discovery, and general applications in science and engineering.

q-bio.BM↗