# Symmetries in Genetic Systems and the Concept of Geno-Logical Coding

^{*}

## Abstract

**:**

## 1. Introduction

## 2. Results of Analysis of Symmetries in Genetic Alphabets

- (1)
- Two letters are purines (A and G), and the other two are pyrimidines (C and T). From the standpoint of these binary-oppositional traits one can denote C = T = 0, A = G = 1. From the standpoint of these traits, any of the DNA-sequences are represented by a corresponding binary sequence. For example, GCATGAAGT is represented by 101011110;
- (2)
- Two letters are amino-molecules (A and C) and the other two are keto-molecules (G and T). From the standpoint of these traits one can designate A = C = 0, G = T = 1. Correspondingly, the same sequence, GCATGAAGT, is represented by another binary sequence, 100110011;
- (3)
- The pairs of complementary letters, A-T and C-G, are linked by 2 and 3 hydrogen bonds, respectively. From the standpoint of these binary traits, one can designate C = G = 0, A = T = 1. Correspondingly, the same sequence, GCATGAAGT, is read as 001101101.

^{n}members. The distance in these groups is known as the Hamming distance. Since the Hamming distance satisfies the conditions of a metric group, any dyadic group is a metric group. The expression (1) shows an example of the dyadic group of 3-bit binary numbers:

^{T}= n*E, where H

^{T}—transposed matrix, E—identity matrix. Tensor (or Kronecker) exponentiation of Hadamard (2*2)-matrix H generates a tensor family of Hadamard (2

^{n}*2

^{n})-matrices H

^{(n)}(Figure 2), rows and columns of which are Walsh functions [7].

^{n}*2

^{n})-matrices in Figure 2 consist of 4, 16, and 64 entries. The DNA-alphabets also consist of 4 nitrogenous bases, 16 doublets and 64 triplets. By analogy, we represent the system of these alphabets in a form of the tensor family of square genetic matrices [C, A; T, G]

^{(n)}in Figure 3, with additional binary numerations of their rows and columns on the basis of the following principle [2]. Entries of each column are numerated in accordance with the first sub-alphabet in Figure 1 (for example, the triplet CAG and all other triplets in its column are the combinations, “pyrimidine-purin-purin”, and so this column is correspondingly numerated 011). By contrast, entries of each row are numerated in accordance with the second sub-alphabet (for example, the same triplet CAG and all other triplets in its row are the combinations, “amino-amino-keto”, and so this row is correspondingly numerated 001).

^{(2)}and [C, A; T, G]

^{(3)}in Figure 3 reflect the known phenomenon of segregation of the set of 64 triplets into two equal sub-sets on the basis of strong and weak roots, i.e., the first two positions in triplets [10]: (a) black cells contain 32 triplets with strong roots, i.e., with 8 “strong” doublets AC, CC, CG, CT, GC, GG, GT, TC; (b) white cells contain 32 triplets with weak roots, i.e., with 8 “weak” doublets AA, AG, AT, GA, TA, TG, TT. Code meanings of triplets with strong roots do not depend on the letters in their third position; code meanings of triplets with weak roots depend on their third letter (see details in [11]).

^{(3)}, which was constructed formally without any mention about strong and weak roots, amino acids, and the degeneracy of the genetic code:

- (1)
- The left and right halves of the matrix mosaic are mirror-anti-symmetric each to the other in its colors: any pair of cells, disposed by a mirror-symmetrical manner in the halves, possesses the opposite colors;
- (2)
- Both quadrants along each diagonal are identical from the standpoint of their mosaic;
- (3)
- The mosaics of all rows have meander configurations (each row has black and white fragments of equal lengths) and they are identical to mosaics of some Walsh functions, which coincide with Rademacher functions as the particular cases of Walsh functions;
- (4)
- Each pair of adjacent rows of decimal numeration 0–1, 2–3, 4–5, 6–7 has an identical mosaic (the realization of the principle “even-odd”).

^{89}, of variants exists for locations of 64 triplets in a separate (8*8)-matrix. For comparison, modern physics estimates time of existence of the Universe in 10

^{17}s. It is obvious that an accidental disposition of black and white triplets (and corresponding amino acids) in an (8*8)-matrix will almost never give symmetries. However, in our approach, this matrix of 64 triplets (Figure 3) is not a separate matrix, but is one of members of the tensor family of matrices of genetic alphabets, and, in this case, wonderful symmetries are revealed in the location of black and white triplets. These symmetries testify that the location of black and white triplets in the set of 64 triplets is not accidental. Below, additional facts of symmetries also indicate that this is a regular distribution.

^{k}, k—positive integer. It is defined by decimal indexing the elements of the sequence by the numbers from 0 to n − 1 and then reversing the binary representation of each of these decimal numbers (each of these binary numbers has a length of exactly k). Each item is then mapped to the new position given by this reversed value. For example, consider the sequence of eight letters, abcdefgh. Their indexes are the binary numbers, 000, 001, 010, 011, 100, 101, 110, and 111 (in decimal notation, 0, 1, …, 7), which when bit-reversed become 000, 100, 010, 110, 001, 101, 011, and 111 (in decimal notation, 0, 4, 2, 6, 1, 5, 3, 7, where the first half of the series contains even numbers and the second half contains odd numbers). This permutation of indexes transforms the initial sequence, abcdefgh, into the new sequence, aecgbfdh. Repeating the same permutation on this new sequence returns to the starting sequence. In particular, bit-reverse permutations are applied to (2

^{n}*2

^{n})-matrices, which represent visual images in tasks of noise-immunity coding these images. In these cases, bit-reverse permutations are applied to binary numerations of columns and rows of such matrices. Illustrations of results of bit-reverse permutations in such tasks are given in [15,16].

^{(2)}and [C, A; T, G]

^{(3)}, in Figure 3. This action leads to new matrices of 16 doublets and 64 triplets, whose mosaics are interrelated (Figure 4).

- Mosaics of all 4 quadrants of the (8*8)-matrix of 64 triplets are identical;
- The mosaic of each of the (4*4)-quadrants of the (8*8)-matrix of 64 triplets is identical to the mosaic of the (4*4)-matrix of 16 doublets. From the point of view of the black-and-white mosaics, the (8*8)-matrix of 64 triplets can be considered as a tetra-reproduction of the (4*4)-matrix of 16 doublets. This phenomenological relation between the molecular alphabets reminds one of the tetra-reproduction of biological cells in meiosis, that is, at the molecular genetic level, there is a structural analog of reproduction at the cellular level;
- The mosaics of all rows have, again, meander configurations and they are identical to meander mosaics of some Walsh functions;
- The mosaics of the left and right halves of the matrices are mirror-antisymmetric.

## 3. Mosaics of Genetic Matrices and Hypercomplex Numbers

_{2}and R

_{3}, of the matrices [C, A; T, G]

^{(2)}and [C, A; T, G]

^{(3)}from Figure 3.

_{2}from Figure 6 is a sum of 4 sparse matrices: R

_{2}= r

_{0}+ r

_{1}+ r

_{2}+ r

_{3}. The set of these matrices, r

_{0}, r

_{1}, r

_{2}, r

_{3}, is closed in relation to multiplication, unexpectedly: multiplication of any two matrices from this set gives a matrix from the same set. The corresponding multiplication table of these 4 matrices (Figure 7, right) is identical to the multiplication table of the algebra of 4-dimensional hypercomplex numbers that are termed split-quaternions of James Cockle and are well known in mathematics and physics [23]. From this point of view, the matrix R

_{2}is split-quaternion with unit coordinates. One can additionally note that such kinds of decomposition of matrices are called dyadic-shift decompositions [6,8]. The discovery of communications of genetic matrices with basic elements of hypercomplex numbers—via the dyadic-shift decompositions of matrices—gives additional evidence of the useful role of modulo-2 addition for modeling of molecular-genetic systems.

_{3}of the mosaic matrix of 64 triplets from Figure 6 is a sum of 8 sparse matrices, which appear via the dyadic-shift decomposition of R

_{3}: R

_{3}= v

_{0}+ v

_{1}+ v

_{2}+ v

_{3}+ v

_{4}+ v

_{5}+ v

_{6}+ v

_{7}, where v

_{0}is the identity matrix. The set of matrices, v

_{0}, v

_{1}, v

_{2}, v

_{3}, v

_{4}, v

_{5}, v

_{6}, v

_{7}, is closed in relation to multiplication and it defines the multiplication table (Figure 9, bottom), which is identical to the multiplication table of bi-split-quaternions of James Cockle.

## 4. About Hadamard Matrices, Genetic Alphabets, and Logical Holography

- Only thymine T is replaced by another molecule, U (uracil), in transferring from DNA to RNA;
- Only thymine T does not have the functionally important amino group NH
_{2}.

^{(2)}and [C, A; T, G]

^{(3)}, in Figure 3 become Hadamard matrices, H

^{(2)}and H

^{(3)}, in Figure 2, which represent matrices of 16 doublets and 64 triplets from the tensor family of genetic matrices. The sets of rows in H

^{(2)}and H

^{(3)}contain complete orthogonal systems of Walsh function for 4-dimensional and 8-dimensional spaces correspondingly. The term “complete” means here that any numeric vector of 4-dimensional or 8-dimensional spaces can be represented in a form of a superposition of these Walsh functions.

^{n}-dimensional vectors. Each component of these vectors corresponds to one of 2

^{n}input channels of appropriate electric circuits; the same is true for 2

^{n}output channels, which are related with components of resulting vectors. Examples of electrical circuits for th logic holography are shown in the works [29,36]. Due to application of Walsh transformation, information about such vector is written in each component of the appropriate hologram, which is also a 2

^{n}-dimensional vector, to provide nonlocal character of storing information.

## 5. The Concept of Geno-Logical Coding

## 6. Geno-Logical Coding and Questions of Modern Genetics

^{10}–10

^{14}times [59] (p. 5). We believe that such ultra-efficiency of enzymes in biological bodies is defined not only by laws of physics, but also by algebra-logical algorithms of geno-logic coding, and therefore—in accordance with Schrödinger—this ultra-efficiency cannot be reduced to the ordinary laws of physics. Concerning enzymes, one should note that reading of genetic information of DNA is closely related with biological catalysis; encoding of the protein by the polynucleotide can be interpreted as catalysis of the protein by the polynucleotide [1].

## Acknowledgments

## Author Contributions

## Conflicts of Interest

## References

- Chernavskiy, D.S. The problem of origin of life and thought from the viewpoint of the modern physics. Usp. Phizicheskih Nauk
**2000**, 170, 157–183. (In Russian) [Google Scholar] [CrossRef] - Petoukhov, S.V. Matrix Genetics, Algebras of the Genetic Code, Noise-Immunity; Regular and Chaotic Dynamics: Moscow, Russia, 2008. (In Russian) [Google Scholar]
- Petoukhov, S. Symmetrical Analysis Techniques for Genetic Systems and Bioinformatics: Advanced Patterns and Applications; IGI Global: Hershey, PA, USA, 2009. [Google Scholar]
- Stewart, I. Life’s Other Secret: The New Mathematics of the Living World; Penguin: New York, NY, USA, 1999. [Google Scholar]
- Stambuk, N. Circular coding properties of gene and protein sequences. Croat. Chem. Acta
**1999**, 72, 999–1008. [Google Scholar] - Fimmel, E.; Danielli, A.; Strüngmann, L. On dichotomic classes and bijections of the genetic code. J. Theor. Biol.
**2013**, 336, 221–230. [Google Scholar] [CrossRef] [PubMed] - Ahmed, N.U.; Rao, K.R. Orthogonal Transforms for Digital Signal Processing; Springer: New York, NY, USA, 1975. [Google Scholar]
- Harmuth, H.F. Information Theory Applied to Space-Time Physics; The Catholic University of America: Washington, DC, USA, 1989. [Google Scholar]
- Petoukhov, S.V. The Genetic Code, 8-Dimensional Hypercomplex Numbers and Dyadic Shifts. 11th Version of the Article. Available online: http://arxiv.org/abs/1102.3596 (accessed on 15 July 2016).
- Rumer, I.B. Codon systematization in the genetic code. Dokl. Akad. Nauk SSSR
**1968**, 183, 225–226. [Google Scholar] [PubMed] - Petoukhov, S.V. The system-resonance approach in modeling genetic structures. Biosystems
**2016**, 139, 1–11. [Google Scholar] [CrossRef] [PubMed] - Yang, Q.; Ellis, J.; Mamakani, K.; Ruskey, F. In-place permuting and perfect shuffling using involutions. Inf. Process. Lett.
**2013**, 113, 386–391. [Google Scholar] [CrossRef] - Gold, B.; Rader, C.M. Digital Processing of Signals; McGraw-Hill: New York, NY, USA, 1969. [Google Scholar]
- Karp, A.H. Bit reversal on uniprocessors. SIAM Rev.
**1996**, 38, 1–26. [Google Scholar] [CrossRef] - Shiman, D.V.; Patsei, N.V. Application of Methods of Interleaving for Handling Graphic Information; Physics-Mathematical Science and Informatics; Belarusian State Technological University: Minsk, Belarus, 2013; pp. 108–110. (In Russian) [Google Scholar]
- Shishmintsev, S. Holographic Properties of a Bit-Reversal Permutation. Available online: https://habrahabr.ru/post/155471/ (accessed on 22 October 2012). (In Russian)
- Arquès, D.G.; Michel, C.J. A complementary circular code in the protein coding genes. J. Theor. Biol.
**1996**, 182, 45–58. [Google Scholar] [CrossRef] [PubMed] - Michel, C.J. Circular code motifs in transfer and 16S ribosomal RNAs: A possible translation code in genes. Comput. Biol. Chem.
**2012**, 37, 24–37. [Google Scholar] [CrossRef] [PubMed] - Fimmel, E.; Giannerini, S.; Gonzalez, D.; Strüngmann, L. Circular codes, symmetries and transformations. J. Math. Biol.
**2014**, 70, 1623–1644. [Google Scholar] [CrossRef] [PubMed] - Fimmel, E.; Giannerini, S.; Gonzalez, D.; Strüngmann, L. Dinucleotide circular codes and bijective transformations. J. Theor. Biol.
**2015**, 386, 159–165. [Google Scholar] [CrossRef] [PubMed] - Fimmel, E.; Strüngmann, L. On the hierarchy of trinucleotide n-circular codes and their corresponding amino acids. J. Theor. Biol.
**2015**, 364, 113–120. [Google Scholar] [CrossRef] [PubMed] - Fimmel, E.; Michel, C.J.; Strüngmann, L. n-Nucleotide circular codes in graph theory. Phil. Trans. R. Soc. A
**2016**, 374, 20150058. [Google Scholar] [CrossRef] [PubMed] - Cockle, J. Split-Quaternion. Available online: https://en.wikipedia.org/wiki/Split-quaternion (accessed on 9 July 2016).
- Poincare Disk Model. Available online: https://en.wikipedia.org/wiki/Poincar%C3%A9_disk_model (accessed on 15 September 2016).
- Luneburg, R. The metric of binocular visual space. J. Opt. Soc. Am.
**1950**, 40, 627–642. [Google Scholar] [CrossRef] - Kienle, G. Experiments concerning the non-Euclidean structure of visual space. In Bioastronautics; Pergamon Pree: New York, NY, USA, 1964; pp. 386–400. [Google Scholar]
- Seberry, J.; Wysocki, B.J.; Wysocki, T.A. On some applications of Hadamard matrices. Metrica
**2005**, 62, 221–239. [Google Scholar] [CrossRef] - Harmuth, H.F. Sequency Theory. Foundations and Applications; Academic Press: New York, NY, USA, 1977. [Google Scholar]
- Morita, Y.; Sakurai, Y. Holography by Walsh Waves. In Proceedings of the IV Symposium “Applications of Walsh functions”, Catholic University of America, Washington, DC, USA, 16–18 April 1973; pp. 122–126.
- Karpovsky, M.G.; Stankovic, R.S.; Astola, J.T. Spectral Logic and Its Applications for the Design of Digital Devices; John Wiley & Sons, Inc.: Hoboken, NJ, USA, 2008. [Google Scholar]
- Belousov, L. Morphomechanics of Development; Springer: New York, NY, USA, 2015. [Google Scholar]
- Driesch, H. Philosophie des Organischen; Engelmann: Leipzig, Germany, 1921. [Google Scholar]
- Greguss, P. Bioholography: A new model of information processing. Nature
**1968**, 219, 482. [Google Scholar] [CrossRef] [PubMed] - Pribram, K. Languages of the Brain; Experimental Paradoxes and Principles in Neuropsychology; Prentice-Hall: Englewood Cliffs, NJ, USA, 1971. [Google Scholar]
- Soroko, L.M. Holography and Coherent Optics; Plenum Press: New York, NY, USA, 1980. [Google Scholar]
- Soroko, L.M. “Experience” of Young-Walsh and Logical Holography. In Proceedings of the 6th National Conference on Holography, Yerevan, Armenia, 11–17 February 1974; Leningrad Institute of Nuclear Physics: Leningrad, Russia, 1974. (In Russian)[Google Scholar]
- Fine, N.J. On the Walsh functions. Trans. Am. Soc.
**1949**, 3, 372–414. [Google Scholar] [CrossRef] - Derzhypolskyy, A.; Melenevskyy, D.; Gnatovskyy, A. A Comparative Analysis of Associative Properties of Fourier versus Walsh Digital Holograms. Acta Phys. Pol. A
**2007**, 112, 1101–1106. [Google Scholar] [CrossRef] - Golubov, B.I.; Efimov, A.V.; Skvortsov, V.A. Series and Fourier Transforms; Nauka: Moscow, Russia, 1987. (In Russian) [Google Scholar]
- Petoukhov, S.V. Symmetries of the genetic code, Walsh functions and the theory of genetic logical holography. Symmetry Cult. Sci.
**2016**, 27, 95–98. [Google Scholar] - Histone Code. Available online: https://en.wikipedia.org/wiki/Histone_code#cite_note-Jenuwein-1 (accessed on 14 November 2016).
- Jenuwein, T.; Allis, C.D. Translating the histone code. Science
**2001**, 293, 1074–1080. [Google Scholar] [CrossRef] [PubMed] - All-or-None Law. Available online: https://en.wikipedia.org/wiki/All-or-none_law (accessed on 30 September 2016).
- Kaczmarek, L.K.; Levitan, I.B. Neuromodulation: The Biochemical Control of Neuronal Excitability; Oxford University Press: New York, NY, USA, 1987. [Google Scholar]
- Martini, F.H. Anatomy and Physiology; Prentice Hall: New York, NY, USA, 2005. [Google Scholar]
- Penrose, R. Shadows of the Mind: A Search for the Missing Science of Consciousness; Oxford University Press: Oxford, UK, 1996. [Google Scholar]
- Liberman, E.A. Cell as a molecular computer. Biofizika
**1972**, 17, 932–943. [Google Scholar] [PubMed] - Hameroff, S.R.; Penrose, R. Conscious events as orchestrated spacetime selections. J. Conscious. Stud.
**1996**, 3, 36–53. [Google Scholar] - Hameroff, S.; Penrose, R. Consciousness in the universe: A review of the “Orch OR” theory. Phys. Life Rev.
**2014**, 11, 39–78. [Google Scholar] [CrossRef] [PubMed] - Igamberdiev, A.U.; Shklovskiy-Kordi, N.E. Computational power and generative capacity of genetic systems. Biosystems
**2016**, 142–143, 1–8. [Google Scholar] [CrossRef] [PubMed] - Ji, S. Molecular Theory of the Living Cell: Concepts, Molecular Mechanisms, and Biomedical Applications; Springer: New York, NY, USA, 2012. [Google Scholar]
- Yaglom, I.M. The Boolean Structure and Its Models; Sovetskoye Radio: Moscow, Russia, 1980. (In Russian) [Google Scholar]
- McClintock, B. The origin and behavior of mutable loci in maize. Proc. Natl. Acad. Sci. USA
**1950**, 36, 344–355. [Google Scholar] [CrossRef] [PubMed] - Stankovic, R.; Astola, J. Spectral Interpretation of Decision Diagrams; Springer: New York, NY, USA, 2003. [Google Scholar]
- Zalmanzon, L.A. Transforms of Fourier, Walsh, Haar and Their Application in Management, Communications and Other Fields; Nauka, PhysMatLit: Moscow, Russia, 1989. (In Russian) [Google Scholar]
- Sawa, K.; Igamberdiev, A. The Double Homunculus model of self-reflective systems. Biosystems
**2016**, 144, 1–7. [Google Scholar] [CrossRef] [PubMed] - Sawa, K.; Gunji, Y.-P. An emergence of formal logic induced by an internal agent. Biosystems
**2014**, 124, 39–45. [Google Scholar] [CrossRef] [PubMed] - Schrödinger, E. What Is Life? The Physical Aspect of the Living Cell; University Press: Cambridge, UK, 1955. [Google Scholar]
- Varfolomeev, S.D. Chemical Enzymology; Akademia: Moscow, Russia, 2005. (In Russian) [Google Scholar]
- Hamilton, A. Invention of the year. The retail DNA test. Time, 29 October; 2008.
- Boole, G. An Investigation of the Laws of Thought; Macmillan. Reprinted with Corrections; Dover Publications: New York, NY, USA, 1958; (reissued by Cambridge University Press, 2009). [Google Scholar]
- Petukhov, S.V. Non-Euclidean geometries and algorithms of living bodies. Comput. Math. Appl.
**1989**, 17, 505–534. [Google Scholar] [CrossRef] - Petoukhov, S.V. Biomechanics, Bionica and Symmetry; Nauka: Moscow, Russia, 1981. (In Russian) [Google Scholar]
- Petoukhov, S.V. Symmetries of the genetic code, hypercomplex numbers and genetic matrices with internal complementarities. Symmetry Cult. Sci.
**2012**, 23, 275–301. [Google Scholar] - Hu, Z.B.; Petoukhov, S.V. Generalized crystallography, the genetic system and biochemical aesthetics. Struct. Chem.
**2017**. [Google Scholar] [CrossRef]

**Figure 1.**The four nitrogenous bases of DNA: adenine A, guanine G, cytosine C, and thymine T. Right: three binary sub-alphabets of the genetic alphabet on the basis of three pairs of binary-oppositional traits.

**Figure 2.**The first members of the tensor (or Kronecker) family of Hadamard matrices H

^{(n)}, where (n) means a tensor power. Black cells correspond to components “+1”, white cells correspond to “−1”.

**Figure 3.**The tensor family of genetic matrices [C, A; T, G]

^{(n)}(n = 1, 2, 3). Columns and rows of these matrices have binary numerations (see the explanation in text). Black cells of the matrices contain 32 triplets with strong roots and also 8 doublets, which play the role of those strong roots.

**Figure 5.**The mosaics of 6 matrices of 64 triplets on the base of the matrix [C, A; T, G]

^{(3)}(Figure 3) in cases of different orders of positions in triplets: 1-2-3, 2-3-1, 3-1-2, 3-2-1, 1-3-2, 2-1-3. Numbers over each matrix show a relevant order of positions. Black (white) cells correspond to triplets with strong (weak) roots.

**Figure 6.**Walsh-representations R

_{2}and R

_{3}of the mosaic matrices [C, A; T, G]

^{(2)}and [C, A; T, G]

^{(3)}from Figure 3, where each row is one of Walsh functions.

**Figure 7.**Above: the matrix R

_{2}from Figure 6 is a sum of 4 sparse matrices, r

_{0}, r

_{1}, r

_{2}, r

_{3}. Bottom: the multiplication table of the matrices r

_{0}, r

_{1}, r

_{2}, r

_{3}, where r

_{0}is the identity matrix.

**Figure 9.**Upper rows: the decomposition of the matrix R

_{3}(from Figure 6) as sum of 8 matrices: R

_{3}= v

_{0}+ v

_{1}+ v

_{2}+ v

_{3}+ v

_{4}+ v

_{5}+ v

_{6}+ v

_{7}, where v

_{0}is the identity matrix. Bottom row: the multiplication table of these 8 matrices, which is identical to the multiplication table of bi-split-quaternions by James Cockle. The symbol “*” means multiplication.

**Table 1.**Three binary sub-alphabets of the genetic alphabet on the basis of three pairs of binary-oppositional traits.

№ | Binary Symbols | C | A | G | T/U |
---|---|---|---|---|---|

1 | 0 — pyrimidines_{1}1 — purines _{1} | 0_{1} | 1_{1} | 1_{1} | 0_{1} |

2 | 0 — amino_{2}1 — keto_{2} | 0_{2} | 0_{2} | 1_{2} | 1_{2} |

3 | 0 — three hydrogen bonds;_{3}1 — two hydrogen bonds_{3} | 0_{3} | 1_{3} | 0_{3} | 1_{3} |

© 2016 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/).

## Share and Cite

**MDPI and ACS Style**

Petoukhov, S.V.; Petukhova, E.S.
Symmetries in Genetic Systems and the Concept of Geno-Logical Coding. *Information* **2017**, *8*, 2.
https://doi.org/10.3390/info8010002

**AMA Style**

Petoukhov SV, Petukhova ES.
Symmetries in Genetic Systems and the Concept of Geno-Logical Coding. *Information*. 2017; 8(1):2.
https://doi.org/10.3390/info8010002

**Chicago/Turabian Style**

Petoukhov, Sergey V., and Elena S. Petukhova.
2017. "Symmetries in Genetic Systems and the Concept of Geno-Logical Coding" *Information* 8, no. 1: 2.
https://doi.org/10.3390/info8010002