Groups of Symmetries of the Two Classes of Synthetases in the Four-Dimensional Hypercubes of the Extended Code Type II

Preprint

Article

Groups of Symmetries of the Two Classes of Synthetases in the Four-Dimensional Hypercubes of the Extended Code Type II

Altmetrics

Downloads

Views

Comments

A peer-reviewed article of this preprint also exists.

Marco V. José^*

,Eberto R. Morgado,Juan R. Bobadilla

Marco V. José^*

,Eberto R. Morgado,Juan R. Bobadilla

This version is not peer-reviewed

Submitted:

28 August 2023

Posted:

29 August 2023

You are already at the latest version

Alerts

Abstract

Aminoacyl-tRNA synthetases (aaRSs) originated from an ancestral bidirectional gene (mirror symmetry) and through the evolution of the genetic code the twenty aaRSs exhibit a symmetrical distribution in a 6-dimensional hypercube of the Standard Genetic Code. In this work, we assume a primeval RNY code, and the Extended Genetic RNA code type II which includes codons of the type YNY, YNR and RNR. Each of the 4 subsets of codons can be represented in a 4-dimensional hypercube. Altogether these 4 subcodes constitute the 6-dimensional representation of the SGC. We identify the aaRSs' symmetry groups in each of these hypercubes. We show that each of the four hypercubes contains the following sets of symmetries for the two known Classes of synthetases: RNY: dihedral group D2; YNY: binary group Z2; YNR: amplified octahedral group Oh; and RNR: binary group Z2. We demonstrate that for each hypercube, the group of symmetries of Class 1 is the same as the group of symmetries of Class 2. The biological implications of these findings are discussed.

Keywords:

Subject: Biology and Life Sciences - Life Sciences

1. Introduction

Aminoacyl-tRNA synthetases (aaRSs) are key players of the genetic code in all living beings. AaRS attaches an amino acid to the cognate tRNA, and the aminoacyl-tRNA is then used for translation upon binding to mRNA according to the codon–anticodon interaction on the ribosome. The Standard Genetic Code (SGC) is the mapping of 61 codons or triplets to 20 canonical amino acids. There are 20 aaRSs, one for each of the 20 standard amino acids. AaRSs are divided into two mutually exclusive Classes, 1 and 2, based on their structural, functional, and evolutionary relatedness [1,2,3,4,5,6,7,8]. Each aaRS falls into either Class 1 or Class 2, except for lysyl-tRNA synthetase (LysRS), which has a representative in both classes. The correspondence between amino acids and synthetases is one to one, that is, bijective. For every triplet, or codon there is a synthetase, associated to the amino acid it specifies. In a previous work [9], we outlined the group of symmetries of both Classes of synthetases in each of the 4-dimensional hypercubes of the so-called Extended Code of type II [10,11]. Herein, we rigorously determine the symmetries of aaRSs in the 4 subcodes RNY, YNY, YNR, and RNR. The article is organized as follows. First, we provide the basic mathematics needed to understand the derivation of symmetries of the SGC. In Appendix A we present formal mathematical definitions and concepts. Second, we determine the symmetries in each of the four subcodes. We show that the group of symmetries of Class 1 is the same as the group of symmetries of Class 2. We also analyze the 5-dimensional hypercubes NNY and NNR as obtained by the union of RNA with YNY, and YNR with RNR, respectively. The 4 subcodes constitute the whole SGC. Finally, we discuss the biological implications of the results.

1.1. Basic Mathematics of the SGC

The cartesian product

N^{3} = N \times N \times N,

being

N = {C, U, A, G}

the set of the four RNA-nucleotides, C=Cytosine, U=Uracil, A=Adenine, G=Guanine, is the set of the 64 triplets

(X, Y, Z),

where

X, Y, Z \in N .

The standard genetic code (SGC) may be seen as a surjective function

f : N^{3} \to A_{S} = A \cup {S},

being

A

the set of the 20 known amino acids, and

S

the stop signal, which means the instruction of finalizing the process of synthesis of a protein.

For every

a \in A,

its preimage set

f^{- 1} {a} = {(X, Y, Z) | f (X, Y, Z) = a},

is the set of triplets, also called codons, that encode the amino acid, or stop signal,

a \in A {}_{S}.

Since the decipherment of the genetic code [12] (Marshall W. Nirenberg, Har Gobind Khorana and Robert W. Holley, 1967), it is known that the number of coding triplets for any

a \in A {}_{S}

is one of the numbers 1,2,3,4, or 6.

In Table 1 we show the table of the genetic code, highlighting the 4 subcodes RNY, YNY, YNR and RNR. The table also indicates the subcodes NNY and NNR.

1.2. Arithmetization of the genetic code

The bijective correspondence

C \leftrightarrow 00, U \leftrightarrow 01, A \leftrightarrow 10, G \leftrightarrow 11,

between the set

N

and the set

ℤ_{2}^{2} = ℤ_{2} \times ℤ_{2},

being

ℤ_{2} = {0, 1},

induces a bijective correspondence between the set

NNN

of the 64 triplets and the set

ℤ_{2}^{6}

of all the sextuples of zeros and ones.

Binary operations: In the binary set

ℤ_{2} = {0, 1},

the two binary operations

\oplus_{2}, \otimes_{2},

the so-called addition and product, module 2, are defined. Their Cayley Tables (Table 2) are:

They define, in the set

ℤ_{2} = {0, 1},

the algebraic structure of a field, or commutative division ring. This is the smallest possible field, with only two elements: the neutral of the addition and the neutral of the product, respectively.

The addition ⊕₂ is extended, component-wise, to the set

ℤ_{2}^{6},

which, with the natural definition of the product of any scalar

α \in ℤ {}_{2},

, by a sextuple

(a_{1}, a {}_{2}, a_{3}, a_{4}, a_{5}, a_{6}),

becomes a 6-dimensional vector space over the binary field

(ℤ_{2}, \oplus_{2}, \otimes_{2}) .

This vector space is the so-called 6-dimensional binary hypercube.

The bijection between

ℤ_{2}^{6}

and the set

NNN

of the 64 triplets, induces in it the algebraic structure of a 6-dimensional vector space, whose canonical basis is the system: (ACC, UCC, CAC, CUC, CCA, CCU). The addition of nucleotides is shown in the following Table 3:

It is seen that the nucleotide C, cytosine, is the neutral element of the group. This group is isomorphic to de group

(ℤ_{2}, ℤ_{2}, \oplus),

which is known as the Four Klein Group. It is an Abelian group of order 4, where each element is its own inverse. It is, in the Felix Klein list of finite groups, the fourth, and the first that is not cyclic.

Mutations in the triplets of the genetic code: A mutation in a triplet

XYZ

is the substitution of any of its components, by some nucleotide. For example, GUC→GAC, where U is replaced by A. Obviously, a mutation in a triplet may produce the change of the amino acid it encodes. In our example, valine, that is encoded by GUC, is converted into aspartic acid, encoded by GAC. Algebraically, a mutation in a triplet is performed by the addition of triplets of the canonical basis. In our example, the mutation GUC→GAC is obtained by the addition of the triplet CGC= CAC+CUC.

Classification of the nucleotides

There is a partition

{Y, R}

of the set

N,

being

Y = {C, U}

pyrimidines, and

R = {A, G}

purines. The condition of being a pyrimidine or a purine is called the chemical type of a nucleotide.

Transitions and transversion: A mutation is called a transition if it does not change the chemical type, and it is called a transversion if the chemical type is changed. It is easy to notice that transitions are produced by additions of pyrimidines and transversions by addition of purines.

The primaeval genetic code. It is assumed that there was, in the RNA world, a primitive, or primaeval genetic code, of only sixteen triplets and eight amino acids: the set

RNY = {(X, Y, Z)},

where

X

is a purine,

Y

is any of them, and

Z

is a pyrimidine. It is a 4-dimensional hypercube, a translation of the 4-dimensional subspace

YNY,

derived from

RNY

for transversion in the first nucleotide. By transversions in the first or the third component, the hypercubes

YNY, Y N R

and

RNR

are derived from the primaeval

RNY .

These four sets are pairwise disjoint, and they cover the whole set

NNN .

Hence, the set of sets

{YNY, R N Y, Y N R, R N R}

is a partition of

NNN .

The hypercube

YNY

determines, with the addition

\oplus_{2},

a subgroup of the additive group

(NNN, \oplus_{2}),

being the other

RNY, Y N R

and

RNR

its cosets. With the addition and the product of scalars by vectors,

YNY

determines a 4-dimensional vector subspace, while

RNY, Y N R

and

RNR

are its affine subspaces, that is, translations of it, namely:

\begin{array}{l} RNY = Y N Y + {ACC} \\ YNR = Y N Y + {CCA} \\ RNR = Y N Y + {ACA} \end{array}

The Classes of Synthetases

The synthetases are enzymes that regulate the selection of amino acids that shall be charged to tRNA molecules. A little more than 20 aaRSs are found in modern organisms. They are classified into two groups, Class 1, and Class 2, each having three subclasses (a, b, and c) based on similarity in sequences and structures [13,14]. The classification is shown in Table 4:

In general, aaRS consists of a catalytic domain, an anticodon-binding domain, and often an editing domain. Each class harbors class-specific characteristic motifs and structural topology in its catalytic domains [3].

According to the RO model [15,16,17,18] the table of the genetic code can be divided into the sub-codes NAN, NGN, NUN, NCN. We have also shown that there exists an automorphism F of the cube defined also piecewise, which transforms that division into the sub-codes RNR, YNR, RNY, YNY, respectively, which is precisely our algebraic model [19].

3. Results

3.1. Group of symmetries of the classes of synthetases in the hypercube $RNY .$

The members of Class 2 are in the vertexes of a square, contained in the set

{[- 1, 1]}^{4}

, the convex closure of the set

{[- 1, 1]}^{4}

, taken, by a suitable change of coordinates, rotations, and translations of axis, as a representation of the hypercube

RNY .

See Figure 1:

The quadruplets that belong to Class 2 of synthetases (colored in black), are in the set

V_{2}

of vertexes of a square

S,

one of the 24 faces of the hypercube.

V_{2}

is a subset of the set

{[- 1, 1]}^{4}

of the sixteen vertexes of the hypercube

RNY .

The set of vertexes of that square is:

V_{2} = {V_{1}, V_{2}, V_{3}, V_{4}},

where

v_{1} = (1, - 1, - 1, - 1)

v_{2} = (1, - 1, - 1, 1)

v_{3} = (1, 1, - 1, 1)

, and

v_{4} = (1, 1, - 1, 1)

black colored.

The center of this square is the point

c_{2} = \frac{v_{1} + v_{2} + v_{3} + v_{4}}{4} = (1, 0, - 1, 0) .

The members of Class 1 are in the complementary set of vertexes

V_{1},

that is, the other 12 vertexes, red colored, out of the four vertexes of the square

S .

v_{1} = (u_{1}, u_{2}, u_{3}, u_{4}, u_{5}, u_{6}, u_{7}, u_{8}, u_{9}, u_{10}, u_{11}, u_{12})

where

Now we can state the following:

3.2. Theorem I. The group of symmetries of Class 1 are the same as that of Class 2.

Proof: As a symmetry of the Class 1 is a bijective isometrical function

f

from

RNY

onto itself, it preserves the set

Class 1 \in RNY .

It also preserves the square

S .

that contains the quadruples of Class 2, that is, the vertexes of the square

S .

It means that both classes have the same group of symmetries. That is so, because the binary set of sets

{Class 1, Class 2}

is a partition of the finite set

{- 1, 1}^{4}

of the 16 vertexes of the hypercube

RNY .

Observation: A similar theorem takes place in any of the other hypercubes of the Extended code type II, and in the whole 6-dimensional hypercubes

NNN .

In the case of the 4-dimensional YNR, the 5-dimensional NNR and the whole 6-dimensional

NNN,

it is valid if, for methodological reasons, we assume the stop signal as it would be an amino acid of Class 1.

Let us consider the orthogonal matrix

A = (\begin{matrix} 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 \\ 0 & - 1 & 0 & 0 \end{matrix})

which represents a rotation of angle

\frac{3 π}{2}

in the plane

〈 e_{2}, e_{4} 〉

It operates over the set of vertexes of the square S in the following way:

This means that

A

is an isometry of the square

S .

Let us now consider the orthogonal matrix

B = (\begin{matrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & - 1 \end{matrix})

, which represents a reflection through the 3-dimensional hyperplane

〈 e_{1}, e_{2}, e_{3} 〉

that reverses the fourth axis

ℝ {}_{e_{4}}.

It operates over the set of vertexes of the square

S

in the following way:

This means that

B

is an isometry of the square

S .

It is not difficult to verify the following equalities, that occur between the matrixes

A

and

B :

A^{4} = B^{2} = I; BA = A^{3} B .

They are the defining relations of the dihedral group

D_{4},

the group of all the symmetries of a square.

Now, we will see which is the action of the dihedral group

D_{4},

generated by the matrixes

A

and

B,

over the set

V_{1}

of the 12 quadruplets that represent the synthetases of Class 1.

The action of

A

over the set

V_{1}

is,

It is seen that

A

is an isometry of the set of synthetases of Class 1.

The action of

B

over the set

V_{1}

is:

Note that

B

is an isometry of the set of synthetases of Class 1.

We see that

B

is a symmetry of the set

V_{1}

vertexes of the Class 1 of synthetases. As

A

and

B

are symmetries of the Class 1 of synthetases this result confirms the assertion of Theorem 1, where it was proved that boss classes have the same group of symmetries.

The main result of Part I; We have proved that the group of symmetries of both classes of synthetases, in the hypercube

RNY,

is the dihedral group

D_{4} .

3.3. Group of symmetries of the classes of synthetases in the hypercube $YNY$

In this case the members of each class are in eight vertexes, out of the sixteen vertexes of the hypercube

YNY .

They are represented by the sixteen quadruples of the set

{- 1, 1}^{4}

of ones and minus one, being the hypercube

{[- 1, 1]}^{4}

the convex closure of the set

{- 1, 1}^{4}

The set

{[- 1, 1]}^{4}

is taken, by a suitable change of coordinates, rotations, and translations of axis, as a representation of the hypercube

YNY .

The center of this hypercube is the origin of coordinates

O = (0, 0, 0, 0)

Figure 2. aaRSs distribution in the

YNY

code. Class 1 (red, 4 amino acids) and Class 2 (blue, 4 amino acids). Graphic representation of the subsets

YYY

and

YRY .

Second 4-dimensional hypercube of the Extended RNA-code type 2:

YNY = YYY \cup YRY .

Figure 2. aaRSs distribution in the

YNY

code. Class 1 (red, 4 amino acids) and Class 2 (blue, 4 amino acids). Graphic representation of the subsets

YYY

and

YRY .

Second 4-dimensional hypercube of the Extended RNA-code type 2:

YNY = YYY \cup YRY .

The set of vertexes of the Class 1, colored in red, is the set:

V_{1} = {(1, 1, - 1, - 1), (1, 1, - 1, 1), (- 1, 1, - 1, - 1), (- 1, 1, - 1, 1), (- 1, - 1, - 1, - 1), (- 1, - 1, - 1, 1), (- 1, - 1, 1, - 1), (- 1, - 1, 1, 1)} .

The members of Class 2 are in the complementary set of vertexes, that is, the other eight vertexes, colored in black, out of the eight of Class 1.

This is the set:

V_{2} = {(1, - 1, - 1, - 1), (1, - 1, - 1, 1), (1, - 1, 1, - 1), (1, - 1, 1, 1), (1, 1, 1, - 1), (1, 1, 1, 1), (- 1, 1, 1, - 1), (- 1, 1, 1, 1)} .

Let us consider the affine transformation:

T_{(1 / 2,} {_{1 / 2,}}_{1 / 2,}_{1 / 2)}

, that converts each -1 into 0 and 1 into itself. It represents a change of coordinates, that converts the hypercube

{[- 1, 1]}^{4}

into its isometric

{[0, 1]}^{4}

, whose center is the point (1/2, 1/2, 1/2, 1/2). The sets

V_{1}

and

V_{2}

are now:

V_{1} = {(1, 1, 0, 0), (1, 1, 0, 1), (0, 1, 0, 0), (0, 1, 0, 1), (0, 0, 0, 0), (0, 0, 0, 1), (0, 0, 1, 0), (0, 0, 1, 1)} . V_{2} = {(1, 0, 0, 0), (1, 0, 0, 1), (1, 0, 1, 0), (1, 0, 1, 1), (1, 1, 1, 0), (1, 1, 1, 1), (0, 1, 1, 0), (0, 1, 1, 1)} .

Let us consider the orthogonal matrix

A = (\begin{matrix} 0 & 0 & 1 & 0 \\ 0 & - 1 & 0 & 0 \\ 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 \end{matrix}),

which represents a rotation of angle π = 180° around the vectorial plane generated by the vectors

e {}_{4}

and

e {}_{1}+ e {}_{3}+ e {}_{4}= (1, 0, 1, 1)

, which fixes the point

e {}_{4}

changes the sign the vector

e {}_{2}

and interchanges the vectors

e {}_{1}

and

e {}_{3}.

Let us now see what the action of the rotation A over the set

V_{1}

is:

It is seen that the rotation

A

is a symmetry of the set

V_{1} .

Next, we will see the action of

A

over the set of vertexes

V_{2} :

Notice that rotation

A

is a symmetry of the set

V_{2} .

The rotation

A

of angle π = 180° is an element of order two. Then, the group of symmetries of the classes of synthetases in the hypercube

YNY

contains the group generated by the rotation

A,

which is isomorphic to the binary group

(ℤ_{2}, \oplus_{2}) .

The isometric transformation

A

is the only symmetry of the sets

V_{1}

and

V_{2}

in the hypercube

YNY .

Then, the group of symmetries of both classes of synthetases is the binary group

(ℤ_{2}, \oplus_{2}) .

3.4. Group of symmetries of the synthetases in the hypercube $YNR$

Figure 3. aaRSs distribution in the

YNR

code. Class 1 (red, 3 amino acids) and Class 2 (blue, 3 amino acids and yellow, the stop signals). Graphical representation of the subsets

YYR

and

YRR .

Third 4-dimensional hypercube of the Extended

RNA -

code type II:

YNR = YYR \cup YRR

Figure 3. aaRSs distribution in the

YNR

code. Class 1 (red, 3 amino acids) and Class 2 (blue, 3 amino acids and yellow, the stop signals). Graphical representation of the subsets

YYR

and

YRR .

Third 4-dimensional hypercube of the Extended

RNA -

code type II:

YNR = YYR \cup YRR

For methodological reasons we have assumed the three stop codons as members of Class 1. In this case the members of each Class are in the eight vertexes of a 3-dimensional cube. Both Classes coincide with the cubes

YNU

and

YNG .

The vertexes of

YNR

are represented by the sixteen quadruples of the set

{- 1, 1}^{4}

of ones and minus ones, being the hypercube

{[- 1, 1]}^{4}

the convex closure of the set

{- 1, 1}^{4}

The set

{[- 1, 1]}^{4}

is taken, by a suitable change of coordinates, rotation, and translations of axis, as a representation of the hypercube

YNR .

The center of this hypercube is the origin of coordinates

O = (0, 0, 0, 0)

The set of vertexes of the cube, associated to Class I, colored in red, is the set:

V_{1} = {(- 1, - 1, - 1, - 1), (- 1, - 1, - 1, 1), (- 1, 1, - 1, 1), (- 1, 1, - 1, - 1), (1, - 1, - 1, - 1), (1, - 1, - 1, 1), (1, 1, - 1, 1), (1, 1, - 1, - 1)} .

The center of this cube is the point

- e_{1} = (0, 0, - 1, 0),

and the set of vertexes of the Class 2, colored in black, is the set:

V_{2} = {(- 1, - 1, 1, - 1), (- 1, - 1, 1, 1), (- 1, 1, 1, 1), (- 1, 1, 1, - 1), (1, - 1, 1, - 1), (1, - 1, 1, 1), (1, 1, 1, 1), (1, 1, 1, - 1)} .

whose center is the point

e_{3} = (0, 0, 1, 0) .

Then, we have proved that the group of symmetries of both classes of synthetases in the hypercube

YNR

is the extended octahedral group

(O_{h}, \circ) .

Let us consider the translation

T_{e 3}

associated to the point

e_{3} = (0, 0, 1, 0) .

Applying it to the set

V_{1}

we obtain:

T_{e 3} (V_{1}) = U_{1} = {(- 1, - 1, 0, - 1), (- 1, - 1, 0, 1), (- 1, 1, 0, 1), (- 1, 1, 0, - 1), (1, - 1, 0, - 1), (1, - 1, 0, 1), (1, 1, 0, 1), (1, 1, 0, - 1)},

which is the set of vertexes of another cube, with center in the origin

O = (0, 0, 0, 0)

of coordinates.

Analogously, applying to the set

V_{1}

the translation

T {}_{- e_{3}}

we obtain:

T_{- e_{3}} (V_{2}) = U_{2} = {(- 1, - 1, 0, - 1), (- 1, - 1, 0, 1), (- 1, 1, 0, 1) (- 1, 1, 0, - 1), (1, - 1, 0, - 1), (1, - 1, 0, 1), (1, 1, 0, 1), (1, 1, 0, 1)},

which is the same set

U_{1},

of vertexes of a cube with center in the origin

O = (0, 0, 0, 0)

of coordinates.

Let us now consider the orthogonal matrices:

which represent rotations,

A, B

and

D

of angles

π

radians and

C

of angle

\frac{2 π}{3}

radians. They satisfy the relations:

A^{2} = B^{2} = C^{3} = D^{2} = I,

BA = A B, C A = B C, C B = A B C, D A = B D, D B = A D, D C = A C^{2} D .

that are the defining relations of the octahedral group

O, o

which is the group of the rotational symmetries of a cube or regular hexahedron. It is also the group of rotational symmetries of a regular octahedron, which is the dual figure of the regular hexahedron. Adding to the set of rotational matrixes

A, B, C

and

D,

the matrix

which represents a reflection through the three-dimensional subspace

X Y Z,

generated by the unitary vectors

e_{1}, e_{2}, e_{3},

that reverses the fourth axis

ℝ e_{4},

the amplified octahedral group

(O_{h}, o)

is obtained, where

O_{h} = O \cup (O \circ R) .

We invite the lector to verify that these rotations, and the reflection

R,

are symmetries of the sets

V_{1}

and

V_{2}

of the vertexes of the Class 1 and the Class 2, respectively.

From this it follows that the group of symmetries of classes of synthetases in the hypercube

YNR

is the extended octahedral group

(O_{h}, o)

3.5. Group of symmetries of the synthetases in the hypercube $RNR$

Figure 4. aaRSs distribution in the

RNR

code. Class I (red, 3 amino acids) and Class 2 (blue, 5 amino acids). Graphic representation of the subsets

RYR

and

RRR .

Fourth 4-dimensional hypercube of the Extended RNA-code type II:

RNR = RYR \cup RRR .

Figure 4. aaRSs distribution in the

RNR

code. Class I (red, 3 amino acids) and Class 2 (blue, 5 amino acids). Graphic representation of the subsets

RYR

and

RRR .

Fourth 4-dimensional hypercube of the Extended RNA-code type II:

RNR = RYR \cup RRR .

In this case the vertexes of Class 1, colored in red, are the set of six vectors:

V_{1} = {v_{1} = (- 1, - 1, - 1, - 1), v_{2} = (- 1, - 1, - 1, 1), v_{3} = (- 1, 1, - 1, 1), v_{4} = (- 1, 1, - 1, - 1),

V_{5} = (1, 1, 1, - 1), V_{6} = (1, 1, 1, 1),

which is the union of the square of vertexes

V_{1}, V_{2}, V_{3}, V_{4}

with the edge of vertexes

V_{5}, V_{6} .

And the set of vertexes of Class 2, colored in black, are the set of the ten vertexes:

V_{2} = {\begin{cases} u_{1} = (1, - 1, - 1, - 1), u_{2} = (1, - 1, - 1, 1), u_{3} = (1, 1, - 1, 1), u_{4} = (1, 1, - 1, - 1), \\ u_{5} = (- 1, - 1, 1, - 1), u_{6} = (- 1, - 1, 1, 1), u_{7} = (- 1, 1, 1.1), u_{8} = (- 1, 1, 1, - 1), \\ u_{9} = (1, - 1, 1, - 1), u_{10} = (1, - 1, 1, 1) \end{cases}}

which is he union of the squares of vertexes

u_{1}, u_{2}, u_{3}, u_{4}

and

u_{5}, u_{6}, u_{7}, u_{8}

with the edge of vertexes

u_{9}, u_{10} .

Now, consider the matrix

R = (\begin{matrix} 1 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & - 1 \end{matrix})

, which represents the same reflection of Part III, through the hyperplane

XYZ,

that reverses the axis

ℝ e {}_{4}.

This reflection changes the sign of the fourth component of each quadruple and it easy to notice that it produces the following interchange of vectors in the Class I of synthetases:

v_{1} \leftrightarrow v_{2}, v_{3} \leftrightarrow v_{4}, v_{5} \leftrightarrow v_{6}

Hence,

R

is a symmetry of the Class I of synthetases in the hypercube

RNR .

By Theorem 1 it should also be a symmetry of the set

V_{2}

of vertexes of Class 2. But it is straightforward to verify that it produces the interchange of vectors:

u_{1} \leftrightarrow u_{2}, u_{3} \leftrightarrow u_{4}, u {}_{5}\leftrightarrow u_{6}, u_{7} \leftrightarrow u_{8}, u_{9} \leftrightarrow u_{10} .

Then,

R

is also a symmetry of Class 2.

It is not difficult to notice that the reflection

R

is the only symmetry of both Classes 1 and 2. As it is an element of order two, the group

(ℤ_{2}, \oplus_{2})

, isomorphic to the Abelian group

({R, I} \circ)

, is, as in the case of Part II, the group of symmetries of the classes of synthetases in the hypercube RNR.

3.6. Conclusions

It has been proved that the groups of symmetries of both classes of synthetases in each of the four hypercubes are the following (Table 5):

3.7. The Genetic 5-dimensional hypercube

The 5-dimensional hypercube

NNY

is the disjoint union of the 4-dimensional hypercubes

YNY

and

RNY .

YNY

is the subspace generated by the four unitary vectors

UCC, CAC, CUC, CCU

and

RNY

is its affine subspace

YNY + {ACC} .

Here the sextuples of zeros and ones have been replaced by triplets of the letters

C, U, A, G,

with the following equivalence:

C = 00, U = 01, A = 10, G = 11

Y

is the binary set

{C, U},

R

is the also binary

{A, G},

and

N

is the set

{C, U, A, G} = {Y, R} .

The four triplets

UCC, CAC, CUC, CCU

are associated to the canonical unitary vectors

e_{2}, e_{3}, e_{4} . e_{6} .

In Figure 5 they are vectors initiated in the point

CCC,

colored in red, that generate the hypercube

YNY .

The triplet

ACC,

associated to the unitary vector

e_{1},

also initiated in

CCC,

and colored in blue, completes the canonical basis of the 5-dimensional hypercube

NNY .

Obviously, the translation associated to convert

YNY

into its affine subspace

RNY,

colored in blue, and the union of both

YNY

with

RNY,

is the 5-dimensional hypercube

NNY .

The vertexes of

NNY

are the triplets or codons that end in a pyrimidine.

It can be seen that the translation

T_{e},

associated to the unitary vector

e {}_{5},

represented by the triplet

CCA,

converts the 5-dimensional subspace

NNY

into its 5-dimensional affine subspace

NNR,

whose triplets are those that end in a purine (Figure A1). It is the disjoint union of the 4-dimensional hypercubes

YNR

and

RNR .

It is clear that the 6-dimensional hypercube

NNN

is the union of the 5-dimensional hypercube

NNY

with its affine subspace, also a 5-dimensional hypercube,

NNR = NNY + {CCA} .

Finally, we have, that

NNN

is the disjoint union

RNY \cup YNY \cup YNR \cup RNR

of the four 4-dimensional hypercubes, derived from the primaeval

RNY

by transversions in the first or the third nucleotide.

Note: The subspace (hypercube)

YNY,

is the solution set of the homogeneous system of two liner equations

x_{1} = 0, x_{5} = 0,

with the six unknowns

x_{1}, x_{2}, x_{3}, x_{4}, x_{5} . x_{6} .

Its affine subspace (hypercube)

RNY,

is the solution set of the non-homogeneous system

x_{1} = 0, x_{5} = 0,

also of rank 2, with the same six unknowns.

The 5D hypercube

NNR

(see Figure A1) is obtained by the translation

T_{CCA},

that converts every triplet that ends in pyrimidine into other that ends in purine, obtaining the hypercube

NNR .

It represents the disjoint union of the subcodes

YNR

and

RNR .

Note that this hypercube contains the stop codons

UGA, UAG

and

UAA .

The disjoint union of

NNY

and

NNR

is equal to the 6D hypercube

NNN

that represents the entire SGC. For the 6D genetic code each triplet is mapped into sextuples of o´s and 1’s. This hypercube is the set

NNN

isomorphic to

ℤ_{2}^{6},

which is the binary vector space over the binary field

ℤ_{2},

Figure 5. The five-dimensional hypercube of triplets

NNY,

which is the union of the 4-dimensional hypercubes

RNY

and

YNY .

YNY

is obtained from the

RNY

by means of transversion of each nucleotide at the left of the triplet.

YNY

is the subspace generated by the four unitary vectors CAC, CUC, CCU, UCC, and

RNY

is its affine subspace

YNY + {ACC} .

The translation that represents these transversions is situated at an angle of 22.5 degrees with respect to the horizontal axis generated by the canonical vector

UCC .

At this angle none of the vertexes are overlapped.

Figure 5. The five-dimensional hypercube of triplets

NNY,

which is the union of the 4-dimensional hypercubes

RNY

and

YNY .

YNY

is obtained from the

RNY

by means of transversion of each nucleotide at the left of the triplet.

YNY

is the subspace generated by the four unitary vectors CAC, CUC, CCU, UCC, and

RNY

is its affine subspace

YNY + {ACC} .

The translation that represents these transversions is situated at an angle of 22.5 degrees with respect to the horizontal axis generated by the canonical vector

UCC .

At this angle none of the vertexes are overlapped.

The edges of the hypercube

Two vertexes are said to be neighbors if the distance between them is equal to 1. It means that they differ in only one of their n components. An edge of the hypercube is the segment that joins two neighbor vertexes. This segment has a length equal to 1. For every vertex there are

n

neighbors. As there are

2^{n}

vertexes, the product

2^{n} \times n

would count the total number of edges. But as every edge has two extremes, it would be counted twice. Then, the actual number of edges is equal to

\frac{2^{n} \times n}{2} = 2^{n - 1} \times n

. For example, in the ordinary cube, 3-dimensional, the number of edges is 2² × 3 = 12 and, in the 4-dimensional, this number is 2³ × 4 = 32.

The faces of the hypercube

Any face of the hypercube is a plane square determined by four vertexes and four edges, in such a way that two edges with a common vertex are orthogonal. If we fix n-2 components with values zeros and ones, and leave free the other two, the four obtained vertexes are the vertexes of a plane square, then, of a face of the hypercube. It may be done in

(\begin{array}{l} n \\ n - 2 \end{array}) \times 2^{n - 2}

ways. Hence, the total number of different faces is precisely

(\begin{array}{l} n \\ n - 2 \end{array}) \times 2^{n - 2} .

(The combinatorial number

(\begin{array}{l} n \\ k \end{array}) = \frac{n!}{k! (n - k)!}

is the number of subsets of k elements of a set of n elements, being

0 \leq k \leq n

). For example, for n=3 the number of faces is 3× 2 = 6, and for n=4 it is 6x4=24.

The hypercube of dimension 6

NNN

It is the disjoint union of the 5-dimensional

NNY

and

NNR .

NNY

is the subspace generated by the five unitary vectors CAC, CUC, CCU, UCC, ACC and

NNR

is its affine subspace

NNY + {CCA} .

The vector space

NNN

is generated by the six unitary vectors CAC, CUC, CCU, UCC, ACC, CCA. They conform the canonical basis of

ℤ_{2}^{6} = NNN .

Conversion of the hypercube [0, 1]ⁿ in other whose components are ones and minus ones. Multiplying by 2 all the vectors of the space, the set of the

2^{n}

vertexes is converted into the set {0, 2}ⁿ, of vertexes of the hypercube [0, 2]ⁿ whose edges have length 2. Next, performing the substraction of the n-tuple E = (1, 1, …, 1) the hypercube [0, 2]ⁿ is converted into [−1, 1]ⁿ, which is another hypercube, also with edges of length 2, whose set of vertexes is the set

{- 1, 1}^{n}

of the

2^{n}

n-tuples of ones and minus ones.

Note: The n-tuple E is the opposite vertex, in the hypercube [0, 1]ⁿ, of the null vector O = (0, 0, …, 0) The distance between them is the real number

\sqrt{n} = | E |,

which is the diameter of that hypercube. The diameter of a hypercube is the diameter of the hypersphere that circumscribes it-

Actually, the hypercube [−1, 1]ⁿ is the image of [0, 1]ⁿ under the affine transformation

T_{- E} \circ 2 I

being

I

the identical automorphism. The new hypercube has its center in the origin

{O = (0, 0, \dots, 0) = (T}_{- E} \circ 2 I) (\frac{1}{2}, \frac{1}{2}, \dots, \frac{1}{2})

of coordinates, and its radius is

\sqrt{n} .

The affine transformation

T_{- E} \circ 2 I

converts every 0 into -1, and the number 1 into itself. The linear transformation

2 I

is a homothetic transformation of ratio 2, that duplicate the size of every n-dimensional Figure. Its only fixed point is the origin O of coordinates. The affine transformation

T_{- E} \circ 2 I

is also a homothety of ratio 2, whose only fixed point is the point E

A metric in the hypercube

ℤ_{2}^{6}

The Hamming Norm and the Hamming Distance defined in

ℤ_{2}^{6}

The Hamming Norm: The Hamming Norm |u| of a sextuple u = (a₁,a₂,a₃,a₄,a₅,a₆) is defined as the sum

Σ a_{i}

ℤ

of its components

a_{i} .

It is equal to the number of ones it has. The only unitary sextuples, that is, of norm equal to 1, are those of the canonical basis.

The Hamming distance. The Hamming distance H(u,v) between two sextuples u = (a₁,a₂,a₃,a₄,a₅,a₆) and v = (b₁,b₂,b₃,b₄,b₅,b₆) is defined as the norm

| u \oplus_{2} v |

of their module 2 addition. It is equal to the number of places where they differ. It is not difficult to prove that the distance so defined is actually a distance, in the mathematical sense. It means that it has the following properties:

D1) For all

u, v,

H (u, v) \geq 0,

H (u, v) = 0 \Leftrightarrow u = v

(positivity of the distance between two different sextuples

u

and

v

), and nullity of the distance of a sextuple to itself.

D2) For all

u, v,

H (u, v) = H (v, u)

(Symmetry)

D3) For

u, v, w,

H (u, w) \leq H (u, v) + H (v, w)

(Triangle inequality)

Figure 6. The 6D representation of the Standard Genetic Code.

Discussion

We have determined the type of symmetries of aaRSs in each of the 4 subcodes of the Extended RNA code type II. We used the 4D representation of each subcode. The RNY subcode has the dihedral group, with 8 symmetries, 4 rotations and 4 reflections. The YNY subcode has the

ℤ_{2}

symmetry, with 2 symmetries; The YNR subcode exhibits an octahedral amplified symmetry, with 48 elements, with 24 rotations and 24 roto-reflections (the octahedral classic group contains only 24 rotations); The RNR subcode display the symmetry of the binary group

ℤ_{2} .

In each subcode, symmetrical distributions of both Classes of aaRSs were found. Indeed, we proved that for each hypercube, the group of symmetries of Class 1 is the same as the group of symmetries of Class 2. This theorem holds for both 5D- hypercubes and for the whole 6D representation of the SGC.

The consideration of stop codons in the determination of the type of symmetry of the subcode is not fortuitous. Mitochondrial codes present variations principally in the codons for the stop signals and unicoded amino acids. The mitochondrial genetic codes of yeast, invertebrates, and vertebrates present variations principally in the codons for the stop signals and unicoded amino acids https://www.ncbi.nlm.nih.gov/Taxonomy/Utils/wprintgc.cgi?chapter=tgencodes#SG24 (accessed on July 31 2023).The stop codons are tricodonic in SGC, tetracodonic in vertebrate mitochondria, and dicodonic in invertebrate and yeast mitochondria.

In computer science, a byte is an octet of 0´s and 1’s, where each bit represents 0 or 1. Hence, in the genetic code a byte would correspond to a sextuple of 0´s and 1’s, where each of them represents a triplet or codon of the nucleotides

{C, U, A, G} .

The presence of stop codons converts the genetic code into an algorithm that carries out the protein synthesis. This means that the whole process of protein synthesis is carried out by a Turing machine, i.e., by a recursive function. Unlike the Turing machine the genetic code has the additional property of heritability. In a forthcoming work we will develop these concepts.

Our work can be regarded as a possible pathway of the distribution of the 2 Classes of aRSs during the formation of the SGC. According to the model of Rodin-Ohno {15 -18], there was a single gene encoding for 2 synthetases: They proposed a single anti-parallel complementary strands of a single base-paired nucleic acid molecule. The Rodin–Ohno model divides the table of the genetic code into two classes of aminoacyl-tRNA synthetases (Classes 1 and 2) with recognition from the minor or major groove sides of the tRNA acceptor stem [15,16,17,18]. According to the table of the genetic code, the RO model is almost symmetric. It turns out that the RO model is symmetric in a six-dimensional (6D) hypercube (José et al. 2017). Conversely, using the same automorphisms, the RO-model can lead to the SGC. Class aaRS 1 (Class aaRS 2) can be converted into Class aaRS II (Class aaRS I) by means of isometric algebraic functions [19]. Notably, the 6D algebraic model is compatible with both the SGC (based upon the primeval RNY code) and the RO model [19].

Author Contributions

Conceptualization, MVJ and ERM; methodology, MVJ and ERM; formal analysis, ERM and MVJ.; investigation, MVJ and ERM; writing—original draft preparation, ERM and MVJ; writing—review and editing, MVJ and ERM; visualization, JRB.; Figures JRB; funding acquisition, MVJ. All authors have read and agreed to the published version of the manuscript.

Funding

M.V.J. was funded by Dirección General de Asuntos del Personal Académico (DGAPA), Universidad Nacional Autónoma de México, UNAM (PAPIIT-IN224015).

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Mathematical background

The Euclidean n-dimensional

ℝ

−space, (

ℝ^{n}

, +, *) being

(ℝ, +, x),

the field of real numbers, has a basis

(e_{1}, e_{2}, \dots, e_{n}),

the so-called canonical basis, where, for each

i \in (1, 2, \dots, n)

e_{i} = (0, 0, ...1, \dots, 0),

with 1 in the place

i,

and 0 in the remainders.

A remarkable observation: The n-dimensional vector space (

ℝ^{n}

, +, *) is a generalization of the ordinary 3-dimensional

ℝ

−space, (

ℝ^{3}

, +, *) where every triplet

(x_{1}, x_{2}, x {}_{3})

represents a point

P

of the space, endowed with a system of axis

X, Y

and

Z,

pairwise orthogonal or perpendicular, intercepted in a common point denoted as O and called the origin of coordinates, represented by the triplet (0,0,0). Usually, every point P is identified with the triplet

(x_{1}, x_{2}, x {}_{3})

that represents it, as they were the same object. So, the equality

P = (x_{1}, x_{2}, x {}_{3})

is admitted. The axis are right lines defined as

X = ℝ e_{1} = {(x_{1}, 0, 0 x_{1} \in ℝ},

Y = ℝ e_{2} = {(0, x_{2}, 0 x_{2} \in ℝ},

Z = ℝ e_{3} = {(0, 0, x_{3} x_{3} \in ℝ} .

The addition of two points

P = (x_{1}, x_{2}, x {}_{3})

and

Q = (y_{1}, y_{2}, y {}_{3})

is defined as

P + Q = (x_{1} + y_{1}, x_{2} + y_{2}, x_{3} + y_{3})

. This operation, so defined, is associative, has a neutral element,

O,

and for every point

P = (x_{1}, x_{2}, x {}_{3})

its additive inverse

- P = (- x_{1}, - x_{2}, - x {}_{3})

exists, such that P + (−P) = O. Then, the ordered pair (

ℝ^{3}

, +) is a group. As the addition + is also commutative, it is an Abelian group. The product of a real number

α \in ℝ

by a point

P = (x_{1}, x_{2}, x {}_{3})

is defined as

α * P = (α x_{1}, α x_{2}, α x_{3})

. This external operation, of a real number by a point, has the following algebraic properties:

α * (β * P) = (α * β) * P

for

α, β \in ℝ, P \in ℝ^{3}

(Mixed associativity).

2. 1 * P = P, for every

P \in ℝ^{3}

(Existence of an external neutral element).

α * (P + Q) = α * P + α * Q,

for all

α \in ℝ, P, Q \in ℝ^{3}

(Distributivity of the product with respect to the addition of points, also called distributivity at the left).

(α + β) * P = α * P + β * P

for all

α, β \in ℝ, P \in ℝ^{3}

(Distributivity of the product with respect to the addition of numbers, also called distributivity at the right.)

The condition of Abelian group for the addition and the four properties of the external operation, completes the structure of a vector space over the field (

ℝ

, +, ×) of the real numbers, in the set

ℝ^{3}

of all the points of the space.

The concept of vector: Given two different points

P, Q \in ℝ^{3}

we call the vector of origin

P

and extreme

Q

to the oriented segment of right line that joins

P

with

Q

It is denoted as

\bar{P Q}

We define the addition of two vectors

\bar{P Q}

and

\bar{P R}

with common origin P as the vector

\bar{P S}

such that S = R + Q − P If the points

R, Q

and

P

are not collinear the four points are the vertexes of a plane parallelogram. It means that the lines

r (P, Q)

and

r (R, S)

are parallel. If

P = O,

the null point

{0, 0, 0},

the function:

f : P \to \vec{PO},

where for

P = O,

\vec{OO} = 0

is defined as a vector whose initial and final points coincide, is a bijective function between the set

ℝ^{3}

of all the triplets or points of the space, and the set

V

of all the vectors with origin

O .

This correspondence induces over the set

V

the operations + and * of addition and product of numbers by vectors and

V

is endowed the structure of a vector space over the field

{ℝ, +, \times}

of the real numbers.

Euclidean norm

The Euclidean norm, module, or length, of a vector v = (x_1,x_2,…,x_n) is defined as

| v | = \sqrt{x_{1}^{2}}, x_{2}^{2}, \dots, x_{n}^{2}

the non-negative square root of the sum of the squares of its

n

components.

Main properties of the Euclidean norm

N1) For every v,

| v | \geq 0

and it is =0 if, and only if, v = 0 the null vector O = (0, 0, 0, …, 0) (Positivity of the norms for all the non-null vectors)

N2) For

v \in ℝ^{n}

and

α \in ℝ

| α * | v = | α | | v |

(The norm

| α |,

module, or absolute value, of the real number

α \neq 0

is the positive of the couple

{α, - α},

and, for

α = 0, | α | = 0 .

From N₂ we have that

| - v | = | v |

for every

v \in ℝ^{n}

N3) For all

u, v \in ℝ^{n},

| u + v | \leq | u | + | v |

(Triangle inequality).

The Euclidean Distance between vectors

For

u, v \in ℝ^{n},

the Euclidean distance

d (u, v)

between their extremes, is defined as

| u - v |

Main properties of the Euclidean distance

D1) For every v,

d (v, O) = | v | \geq 0

being

O

the null vector

O

= (0, 0, …, 0) (Positivity of the distance to the origin for all the final points of the non-null vectors).

D2) For all

u, v \in ℝ^{n},

d (u, v) = d (v, u)

(Symmetry).

D3) For all

u, v \in ℝ^{n},

d (u, w) \leq d (u, v) + d (v, w)

(Triangle inequality).

With this distance the set

ℝ^{n}

of vectors, is a metric space and the vector space

(ℝ^{n}, +, *)

is called the n-dimensional Euclidean Vector Space.

Linear transformations

A function f:

ℝ^{n} \to ℝ^{n}

is called a linear transformation, or linear endomorphism, if it has the following property:

For all

u, v \in ℝ^{n}

and

α, β \in ℝ

, the equality

f (α * u + β * v) = α * f (u) + β * f (v)

holds.

Note: The latter condition is equivalent to the two conditions:

L1) f(u+v) = f(u) + f(v), for all

u, v \in ℝ^{n}

. (This means that f is a group homomorphism of the additive group (

ℝ^{n}

, +) onto itself).

L2) f(α*u) = α*f(u) for all

u \in ℝ^{n}

and

α \in ℝ .

If the function f is bijective, the linear transformation is a linear isomorphism, and it is called a linear automorphism of the vector space.

Matrix representation of a linear transformation

For every endomorphism f there is a unique square matrix

A = (a_{ij}),

such that for every j,

f (e_{j}) = a_{1}_{j}, a_{2}_{j}, \dots, a_{n j}

being

(\begin{matrix} a_{1 j} \\ a_{2 j} \\ \dots \\ a_{n j} \end{matrix})

the j-th column of

A .

Then,

A

is a matrix whose columns are the column matrixes associated of the vector images of the canonical unitary vectors. It is called the matrix of f with respect to the canonical basis. It will be denoted as A = [f] In the case of an automorphism the matrix

A

is a non-singular or invertible matrix, hence, its determinant is different from 0.

For every vector v = (x₁,x₂,…,x_n)

\in ℝ^{n}

the column matrix

[V] = [\begin{array}{l} x_{1} \\ x_{2} \\ . \\ . \\ x_{n} \end{array}]

is taken as the matrix representation of

V .

It is well known that the matrix representation of the image vector

f (V)

is the matrix product

[f] [V] .

Conversely, every square

n \times n

matrix

A

defines an endomorphism f, whose matrix representation [f] is

A .

Translations

For any vector

u

the translation defined by

u,

is the function

T_{u} : ℝ^{n} \to ℝ^{n}

such that, for all

v,

T_{u} (v) = v + u .

For every u,

T_{u}

is a bijective function that preserves the norm of each vector and the distance between different vectors of the space. Hence, it is an isometry of the Euclidean vector space. For two translations

T_{u}

and

T_{v}

the composition

T_{u} \circ T_{v}

is equal to the translations

T_{u + v} .

The correspondence

u \leftrightarrow T_{u}

between

ℝ^{n}

and the set T, of all the translations, is a bijective function, that induces over T the structure of a n-dimensional vector space, isomorphic to the Euclidean n-space (

ℝ^{n}

, +, *)

The concept of affine transformation

An affine transformation is a function that is a composition

T_{u} \circ f_{}

of a linear endomorphism f, followed by a translation

T_{u} .

It acts over every vector

v

(T_{u} \circ f) (v) = f (v) + u .

The affine transformation

T_{u} \circ f_{}

is bijective if, and only if, its linear part f is an automorphism. The set of all the affine transformations of the vector space (

ℝ^{n}

, +, *) will be denoted as

A_{f f} (ℝ^{n})

. The composition

(T_{u} \circ f) \circ (T_{v} \circ g)

of two affine transformations

T_{u} \circ f_{}

and

T_{v} \circ g_{}

acts over a vector

w

in the form:

Then, the composition is the affine transformation

T_{f (v) + u} \circ (f \circ g)

. Hence, we have the equality

(T_{u} \circ f) \circ (T_{v} \circ g) =

T_{f (v) + u} \circ (f \circ g)

We see that the composition of two affine transformations is an affine transformation. Then, the composition is an inner operation in the set

A_{f f} (ℝ^{n})

. As the operation is associative and its neutral element, the identity function I, is the affine transformation

T_{o} \circ I_{}

the ordered pair (

A_{f f} (ℝ^{n}), \circ

) is a monoid, or semigroup with neutral element.

Matrix representation

The matrix representation of the affine transformation

T_{u} \circ f_{}

is given by the composition

T_{[u]} \circ A,

being

A

the matrix of

f,

which acts over the matrix

[v]

of a vector

v

[v] \to A [v] + [u] .

The conjugated of a translation by a linear automorphism

The conjugated

f \circ T_{v} \circ f^{- 1}

acts over any vector

w

w \to (f \circ T_{v} \circ f^{- 1}) (w) = f (f^{- 1} (w) + v) = w + f (v) = T_{_{} (v)} (w) .

Then

f \circ T_{v} \circ f^{- 1} = T_{f (v)}

The latter means that the group of translations (

T, \circ

) is a normal subgroup of the group

(A (ℝ^{n}), \circ)

being

A (ℝ^{n}) = T \circ Aut (ℝ^{n})

the set of all the invertible affine transformations, and

(Aut (ℝ^{n}), \circ)

the group of all the linear automorphisms of the space (

ℝ^{n}

, +, *) The group

(A (ℝ^{n}), \circ)

that is called the affine group of the space (

ℝ^{n}

, +, *) is a subgroup of the group of all the bijective transformation of the set

ℝ^{n}

It contains as a normal subgroup, the group (

T, \circ

) of all the translations. In fact, it is the semidirect product of the group (

T, \circ

) with the group

(Aut (ℝ^{n}), \circ)

of all the linear automorphisms. (A group

(G, *)

is semidirect product of its subgroups

(K, *)

and

(H, *)

G = K * H

and

(K, *)

is a normal subgroup of

(G, *)) .

The semidirect product will be denoted as

(K ⊲ H, *)

Then,

(A (ℝ^{n}), \circ) = (T ⊲ Aut (ℝ^{n}), \circ)

The affine group

(A (ℝ^{n}), \circ)

is the group of invertible elements of the monoid (

A_{f f} (ℝ^{n}), \circ

The n-dimensional binary hypercube.

The binary vector space

(ℤ_{2}^{n}, \oplus_{2}, *),

vector space over the binary field

(ℤ_{2}, \oplus_{2}, \otimes_{2}),

is also called the n-dimensional binary hypercube. Its set of vertexes coincides with the set {0,1}ⁿ of the

2^{n}

n-tuples of zeros and ones. This set is a subset of the set

ℤ^{n}

of all the n-tuples of the whole numbers. The set

ℤ^{n}

determines the Abelian group (

ℤ^{n}

, +) subgroup of the additive group

(ℝ^{n}, +)

of the n-dimensional Euclidean n-space

(ℝ^{n}, +, *)

The n-dimensional hypercube, whose vertexes are the elements of the set {0,1}ⁿ is defined as the convex closure [0,1]ⁿ of the set

{0, 1}^{n} .

Here,

[0, 1]

denotes the closed interval of the real numbers between 0 and 1. The convex closure of a set is the minimal convex set that contains it.

A convex set is a set

C \subseteq ℝ^{n}

that, for two different elements a and

b

C,

the segment that joins them is entirely contained in C.

The center of the hypercube [0,1]ⁿ is the point

C = {\frac{1}{2} . \frac{1}{2}, \dots, \frac{1}{2}}

obtained by the sum of the 2ⁿ vertexes divided by 2ⁿ. That is so because, for every place i of the n-tuples, 2ⁿ⁻¹ of them, that is, the half, have 1, and the other 2ⁿ⁻¹ have 0. Then, for each place i, the quotient is

\frac{2^{n - 1}}{2^{n}} = \frac{1}{2} .

Figure A1. Five-dimensional hypercube NNR Figure 5. The five-dimensional hypercube of triplets

NNR,

which is the union of the 4-dimensional hypercubes

YNR

and

RNR .

Figure A1. Five-dimensional hypercube NNR Figure 5. The five-dimensional hypercube of triplets

NNR,

which is the union of the 4-dimensional hypercubes

YNR

and

RNR .

References

Ibba M, SÖll D (2000) Aminoacyl-tRNA synthesis. Annu Rev Biochem 69:617–650. [CrossRef]
Cusack S, Berthet-Colominas C, Hartlein M, Nassar N, Leberman R (1990) A second class of synthetase structure revealed by X-ray analysis of Escherichia coli seryl-tRNA synthetase at 2.5 A. Nature 347:249–255. [CrossRef]
Eriani G, Delarue M, Poch O, Gangloff J, Moras D (1990) Partition of aminoacyl-tRNA synthetases into two classes based on mutually exclusive sets of sequence motifs. Nature 347:203–206. [CrossRef]
Burbaum JJ, Schimmel P (1991) Structural relationships and the classification of aminoacyl-tRNA synthetases. J Biol Chem 266:16965–16968.
Ribas de Pouplana L, Schimmel P (2001a) Two classes of tRNA synthetases suggested by sterically compatible dockings on tRNA acceptor stem. Cell 104:191–193. [CrossRef]
Ribas De Pouplana L, Schimmel P (2001b) Operational RNA code for amino acids in relation to genetic code in evolution. J Biol Chem 276:6881–6884. [CrossRef]
Ribas de Pouplana L (2020) The evolution of aminoacyl-tRNA synthetases: From dawn to LUCA. In Enzymes 48, 11–37, Academic Press.
Schimmel P, Giege R, Moras D, Yokoyama S (1993) An operational RNA code for amino acids and possible relation to genetic code. Proc Nat Acad Sci USA 90(19):8763–8768. [CrossRef]
José M.V., Román J.R., Zamudio G.S., Farías S.T. Symmetrical Distributions of Aminoacyl-tRNA Synthetases during the evolution of the Genetic Code. Theory in Biosciences (2023). [CrossRef]
José MV, Morgado ER, Govezensky T. (2007) An extended RNA code and its relationship to the standard genetic code: an algebraic and geometrical approach. Bull. Math. Biol. (2007). 69:215–243. [CrossRef]
José M.V., Morgado E.R., Govezensky T. Genetic Hotels for the Standard Genetic Code: Evolutionary Analysis based upon Novel Three-dimensional Algebraic Models. Bull. Math. Biol. (2011). 73: 1443-1476. [CrossRef]
Nirenberg MW, Matthaei JH. (1961) The dependance of cell-free protein synthesis in E. coli upon naturally occurring or synthetic polyribonucleotides. Proc. Natl Acad. Sci. USA 47, 1588–1602. [CrossRef]
Nagel GM, Doolittle RF (1995) Phylogenetic analysis of the aminoacyl-tRNA synthetases. J Mol Evol 40:487–498. [CrossRef]
Woese CR, Olsen GJ, Ibba M, SÖll D (2000) Aminoacyl-tRNA synthetases, the genetic code, and the evolutionary process. Microbiol Mol Biol Rev 64:202–236. [CrossRef]
Rodin SN, Ohno S (1995) Two types of aminoacyl-tRNA synthetases originally encoded by complementary strands of the same nucleic acid. Orig Life Evol Biosph 25:565–589. [CrossRef]
Rodin SN, Rodin AS (2008) On the origin of the genetic code: signatures of its primordial complementarity in tRNAs and Aminoacyl tRNA synthetases. Heredity 100:341–355. [CrossRef]
Rodin AS, Rodin SN, Carter CW (2009) On primordial sense–antisense coding. J Mol Evol 69(5):555–567. [CrossRef]
Carter CW Jr et al (2014) The Rodin-Ohno hypothesis that two enzyme superfamilies descended from one ancestral gene: an unlikely scenario for the origins of translation that will not be dismissed. Biol Direct 9:11. [CrossRef]
José MV, Zamudio GS, Morgado ER (2017) A unified model of the standard genetic code. R Soc Open Sci. 4:160908. [CrossRef]

Figure 1. aaRSs distribution in code

RNY .

Class 1 (red, 2 amino acids) and Class 2 (blue, 6 amino acids). Graphic representation of the subsets

RYY

and

RRY .

First 4-dimensional hypercube of the

RNY

code:

RNY = RYY \cup RYY

Figure 1. aaRSs distribution in code

RNY .

Class 1 (red, 2 amino acids) and Class 2 (blue, 6 amino acids). Graphic representation of the subsets

RYY

and

RRY .

First 4-dimensional hypercube of the

RNY

code:

RNY = RYY \cup RYY

Table 1. Genetic code: Triplets and amino acids in each of the 4-, 5-, and 6-dimensional hypercubes. aaRS Class 1, red *; aaRS Class 2, blue **.

Table 2. The Cayley tables of sum and multiplication of the binary set

ℤ_{2}

Table 2. The Cayley tables of sum and multiplication of the binary set

ℤ_{2}

Table 3. Sum module 2 of nucleotide bases.

Table 4. Classes and subclasses of aminoacyl tRNA synthetases.

Table 5. Summary of symmetry groups of aaRSs for each subcode.

Hypercube	Group of symmetries
RNY	$D_{4}$
YNY	$ℤ_{2}$
YNR	$O_{h}$
RNR	$ℤ_{2}$

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.

MDPI Initiatives

Important Links

Choose an area of interest and we will send you notifications of new preprints at your preferred frequency.

Disclaimer

Groups of Symmetries of the Two Classes of Synthetases in the Four-Dimensional Hypercubes of the Extended Code Type II

Abstract

1. Introduction

1.1. Basic Mathematics of the SGC

1.2. Arithmetization of the genetic code

3. Results

3.1. Group of symmetries of the classes of synthetases in the hypercube RNY .

3.2. Theorem I. The group of symmetries of Class 1 are the same as that of Class 2.

3.3. Group of symmetries of the classes of synthetases in the hypercube YNY

3.4. Group of symmetries of the synthetases in the hypercube YNR

3.5. Group of symmetries of the synthetases in the hypercube RNR

3.6. Conclusions

3.7. The Genetic 5-dimensional hypercube

Discussion

Author Contributions

Funding

Conflicts of Interest

Appendix A

References

MDPI Initiatives

Important Links

Subscribe

3.1. Group of symmetries of the classes of synthetases in the hypercube $RNY .$

3.3. Group of symmetries of the classes of synthetases in the hypercube $YNY$

3.4. Group of symmetries of the synthetases in the hypercube $YNR$

3.5. Group of symmetries of the synthetases in the hypercube $RNR$