Search arXivSearch

arXiv · 2510.23187

GBNL: Graded Betti Number Learning of Complex Biological Data

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mushal Zia, Faisal Suwayyid, Guo-Wei Wei. 2025-10-27. GBNL: Graded Betti Number Learning of Complex Biological Data. https://arxiv.org/abs/2510.23187

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Unified Common-Root and Interpolation Bounds Based on Leading Monomial Data

For general fields the footprint bound from Gröbner basis theory estimates the number of common affine roots of any set of multivariate polynomials using information on their leading monomials. In this paper we develop an interpolation bound with a similar flavor extending a previously known result for only a single polynomial to any prescribed number of polynomials. Surprisingly, our interpolation theorem and the footprint bound can be shown to be two sides of the same coin, solving similar problems, but for dual spaces. As discussed the footprint bound compares well with the improved Alon-Füredi bound and for finite fields the presented interpolation theorem is sharp. Our work can be viewed as a comment to a question raised by Tao in [Tao, 2014]

math.AC

Poincaré Duality and Quadratic Refinements over Laurent Rings

We develop a Poincaré duality theory for defects of nondegenerate sesquilinear pairings over Laurent polynomial rings. A key ingredient is a novel flat resolution of the character module, constructed from a triangulation of the sphere at infinity associated with a fan. The cup product on this resolution turns Poincaré duality on the sphere into canonical pairings between the resulting defect modules. In middle degrees, we construct distinguished quadratic refinements using equivariant cohomology of the sphere with the antipodal action. The effective replacement of the sphere with a projective space provides a geometric substitute for division by two. Applied to translation-invariant Pauli stabilizer codes, our results establish the nondegeneracy of higher-dimensional braiding pairings. They extend the two-dimensional T-junction formula for topological spin to higher dimensions, while giving it a geometric interpretation.

math.AC