Abstract
This paper introduces Universal Sequence Maps (USM), a robust numerical encoding for symbolic sequences such as DNA that revitalizes Chaos Game Representation (CGR). By implementing a novel bidirectional convergence approach, USM resolves long-standing seeding biases, providing a scale-free, alignment-free, and perfectly bijective representation of genomic data. The method is computationally efficient and applicable to alphabets of any cardinality, offering a minimalist yet mathematically perfect encoding for sequence comparison and machine learning.
Introduction
In the era of Large Language Models (LLMs), researchers are seeking efficient ways to numerically represent symbolic sequences, such as the alphabets of DNA or proteins. Traditional methods often struggle with two primary challenges: retaining contextual information across multiple scales and managing "edge effects." Earlier fractal encoding methods, like CGR, utilized a static starting point (a "seed") in the center of a coordinate plane. For short sequences or the termini of long ones, this created "tail effects" where the numerical position failed to accurately reflect sequence identity.
Universal Sequence Maps (USM) address these limitations by creating a scale-free representation that allows for sequence comparison without computationally expensive alignment.
Methods
USM builds upon the Chaos Game Representation through an iterated map process. In a square where each corner represents a nucleotide (A, C, G, T), a point moves halfway toward the corner corresponding to the first symbol in a sequence. This process is repeated for every subsequent symbol.
Bidirectional Encoding and Novel Seeding
To resolve the edge effect problem, the authors introduced Circular and Bidirectional seeding. Instead of a random center point, the tail of the forward pass seeds the head of the backward pass, and vice versa. This causes numerical coordinates to converge to a steady state, effectively treating the sequence as a continuous loop or a Möbius strip.
Distance Metrics
The system utilizes the Chebyshev distance ($Sn$) to calculate the length of matching segments between sequences using only numerical coordinates. This approach is positionally agnostic and highly parallelizable, as calculating a distance matrix does not require knowledge of neighboring cells.
Key Insights
- Scale-Free Representation: Unlike fixed-length k-mer counting, USM coordinates contain sequence context at all lengths simultaneously.
- Bijectivity: The mapping is one-to-one, allowing for perfect decoding of numerical coordinates back into the original symbolic sequence.
- Fractal Geometry as Memory: The recursive folding of the unit square into quadrants acts as a natural memory of the sequence's history.
Results
The approach was validated using the EGFR gene (244,589 nucleotides) and protein sequences. Key performance metrics include:
- High Efficiency: A quarter-million nucleotides were indexed in 300 milliseconds on a standard laptop.
- Bias Resolution: Bidirectional seeding achieved full reconciliation of numeric positioning with sequence identity, eliminating distortion from starting points.
- Universal Application: The transition from a 4-letter DNA alphabet to a 20-letter amino acid alphabet (a 5D hypercube) is mathematically straightforward and requires no algorithmic changes.
Conclusion and Future Work
While USM proves mathematically superior to older CGR methods for encoding, future research will focus on integrating these density maps as direct inputs for non-linear classifiers like Convolutional Neural Networks (CNNs). The authors suggest that the true potential of USM lies in exploring the statistical regularities of the fractal embedded space rather than simple compression or alignment tasks.
Summary updated