The researchers call the underlying problem the Euclidean barrier. In flat space, the volume of a ball grows only polynomially with its radius, meaning that each additional dimension buys a steadily shrinking amount of room. Biological sequences, however, often encode hierarchies that grow exponentially with depth: an evolutionary tree, a taxonomic classification, or a phylogenetic lineage doubles or multiplies its number of branches at every level. When such exponentially expanding structures are squeezed into a fixed number of Euclidean dimensions, distortion is unavoidable. Distances get compressed, subtle relationships between sequences blur, and downstream classifiers inherit the noise. The team’s central insight is that the mismatch is not a flaw in the algorithms but a property of the geometry itself, and that the remedy is to change the stage on which the data performs.

Hyperbolic geometry, the mathematics of spaces with constant negative curvature, has exactly the property the sequences need. The volume of a disk in hyperbolic space grows exponentially with its radius, mirroring the exponential growth of tree-like data. This means a hierarchy can be embedded with far less distortion, with ancestral or central elements placed near the center and more specialized descendants fanning outward toward the boundary. The idea has gained momentum in machine learning in recent years, notably through Poincaré embeddings for hierarchical representations, but its application to the practical problems of biological sequence classification has remained limited. The new work extends this line of research by building a complete pipeline that takes raw sequence representations and transports them into hyperboloid space, where similarity can be measured with a geometry-aware kernel.

The methodology proceeds in well-defined stages. First, biological sequences are transformed into numerical feature representations, preserving the structural information inherent in the original data. Rather than allowing a classifier to operate on these vectors in flat space, the researchers apply a transformation that projects the representations onto the hyperboloid, a model of hyperbolic geometry embedded in a higher-dimensional real space. Once the sequences reside on this curved manifold, the method computes a kernel matrix from the hyperboloid features. Kernels are the mathematical engines behind algorithms such as support vector machines: they encode pairwise similarities between data points without requiring explicit feature engineering. Here, the kernel exploits the hyperbolic dot product of the embedded representations, a quantity that captures how close two sequences are on the curved surface and therefore how similar they are in a structurally meaningful sense.

This hyperboloid-based kernel matrix becomes the foundation for classification. Because the kernel encodes pairwise sequence similarities in a way that respects hierarchical structure, standard learning algorithms fed with this matrix can distinguish sequence families and categories with greater precision than they could using Euclidean distances alone. The approach also promises benefits for exploratory analysis: sequences that share deep evolutionary ancestry cluster together naturally, while divergent lineages separate cleanly, allowing researchers to detect valuable sequence patterns that flat representations tend to smear across artificial boundaries.

Classifying biological sequences is not a niche exercise. It underpins progress in medicine and public health, from identifying SARS-CoV-2 variants and predicting which hosts a coronavirus spike protein can infect, to classifying T-cell receptor sequences for cancer immunotherapy, to recognizing anticancer peptides and predicting protein function from amino acid composition alone. Whole genome sequencing has become central to precision medicine, and the flood of data produced by high-throughput sequencing demands representations that are both faithful and computationally tractable. Every improvement in sequence classification accuracy translates into faster variant tracking during outbreaks, more reliable host-species predictions, and better-informed therapeutic design.

The new study builds on a substantial body of work by the same research group, which has systematically explored non-Euclidean and kernel-based approaches to molecular data. Earlier efforts include Spike2Vec, an efficient embedding method for COVID-19 spike sequences; Reads2Vec, which embeds raw high-throughput sequencing reads; PWM2Vec, which uses position-weight matrices for viral host specification; and Hashing2Vec, a fast embedding generator for SARS-CoV-2 spike classification. The group has also experimented with other curved geometries, publishing a Gaussian Beltrami-Klein model for protein sequence classification and an elliptic geometry-based kernel matrix, along with a Poincaré-distance approach for preserving hidden hierarchical structure in genomic data. The hyperboloid method represents a continuation and refinement of this geometric program, moving from models of hyperbolic space toward a formulation that plugs directly into kernel-based machine learning workflows.

The experimental evaluation reported in the paper suggests that the hyperboloid approach improves the precision of sequence classification relative to conventional Euclidean representations, detecting patterns that traditional machine learning methods miss when working in high-dimensional flat spaces. Traditional classifiers such as support vector machines, naive Bayes, random forests, logistic regression, decision trees, and nearest-neighbor methods all depend on the geometry of the space in which similarities are computed. When that geometry distorts the true relationships among sequences, no amount of tuning at the classifier level can fully recover the lost signal. By repairing the geometry at the representation level, the hyperbolic kernel approach lets well-established classifiers perform closer to their potential.

Importantly, the researchers position their contribution within a broader shift in representation learning for the life sciences. Neural distance embeddings for biological sequences, transfer-learning models trained on protein language, and transformer-based protein encoders have all pushed the field toward richer representations. Hyperbolic methods add a complementary dimension to this progress: rather than learning better features in flat space, they change the space itself. The tradeoffs of hyperbolic embeddings, including the computational cost of operating on curved manifolds and the care needed to optimize within them, remain active research questions, but the evidence that hierarchical biological data benefits from negative curvature continues to accumulate across tasks ranging from multi-label classification to unsupervised representation learning.

The authors note that the datasets used in the study, drawn from resources such as virology databases and public genomic data collections, cannot be shared openly but are available on request, and the code is likewise available on request. As sequencing costs continue to fall and biological datasets grow exponentially in size and complexity, geometric approaches that respect the natural structure of molecular data are likely to move from the mathematical literature into the standard toolkit of bioinformatics. By breaking the Euclidean barrier, this work suggests that the shortest path to understanding biological sequences may not be a straight line at all, but a curve through hyperbolic space.

Subject of Research: Hyperboloid-based representation of biological sequences in hyperbolic geometry for improved machine learning classification

Article Title: Breaking the euclidean barrier: hyperboloid-based biological sequence analysis

Article References: Ali, S., Mansoor, H., & Patterson, M. (2026). Breaking the euclidean barrier: hyperboloid-based biological sequence analysis. Neural Computing and Applications, 38(18), Article 746. https://doi.org/10.1007/s00521-026-12468-3

Image Credits: AI Generated

DOI: 10.1007/s00521-026-12468-3

Keywords: bio-sequence analysis, sequence classification, hyperbolic geometry, hyperboloid space, kernel methods, k-mers, spike sequence, genomic sequence analysis, machine learning, bioinformatics, feature vector representation, hierarchical embeddings