Abelian Finite Group of DNA Genomic Sequences
Robersy Sanchez, Jesus Barreto, Eberto Morgado, Ricardo Grau

TL;DR
This paper introduces an abelian finite group framework for DNA sequences, enabling analysis of coding and non-coding regions, including indel mutations, through algebraic structures and automorphism groups.
Contribution
It develops a novel algebraic group model for DNA sequences that incorporates indel mutations, extending previous algebraic approaches like the Z_64-algebra.
Findings
Representation of DNA sequences as abelian 5-groups for indel mutations
Decomposition of genome structures into direct sums of 2-groups and 5-groups
Potential for analyzing mutational pathways using automorphism groups
Abstract
The Z_64-algebra of the genetic code and DNA sequences of length N was recently stated. In order to beat the limits of this structure such as the impossibility of non-coding region analysis in genomes and the impossibility of the insertions and deletions analysis (indel mutations), we have develop a cycle group structure over the of extended base triplets of DNA X_1X_2X_3, X_i belong to {O, A, C, G, U}, where the letter O denote the base omission (deletion) in the codon. The obtained group is isomorphic to the abelian 5-group Z_125 of integer module 125. Next, it is defined the abelian finite group S over a set of DNA alignment sequences of length N. The group S could be represented as the direct sum of homocyclic groups: 2-group and 5-group. In particular, DNA subsequences without indel mutation could be considered building block of genes represented by homocyclic 2-groups (described…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Algorithms and Data Compression · Fractal and DNA sequence analysis
