- Poster presentation
- Open Access
Set theoretical and algebraic model for redundancies in the genetic code
© Heuer; licensee BioMed Central Ltd. 2007
- Published: 8 May 2007
- Cellular Automaton
- Genetic Code
- Algebraic Model
- Bijective Mapping
Codons are similar to syllogisms. Each codon has a complement – an anticodon – and syllogisms have such too. Another point is that codons and syllogisms consist of 3 of 4 possible building blocks. So 64 syllogisms should exist, but only 19 make sense. Each syllogism is a set operation, which I can represent with Shegalkin-Polynomials . This needs a continuous view, which is ordinary in biological systems. It accrues matrices with special properties. They are self-similar, that means they can be generated with a tensor product of their own. Other methods work with power sets or multidimensional tetrahedral numbers. Because of these different generation methods it can be shown, that the matrices can be generated with a cellular automaton. Each cellular automaton is producible with a linear automaton [2–7], so there is an other aspect of dependence of the this model and decoding of amino acids. The decoding of amino acids follows the rules of a linear automaton. In order to combine the fields of syllogisms and amino acids a different representation for them is used – a tetrahedral grid. This is possible, because the number of syllogisms and amino acids is not only a square number, it is also a triangle number. Prof. Dr. Franke's matrices  let me construct such a grid, because of their structure of a Pascal triangle.
The bijective mapping could explain Prof. Dr. Freeland's presumption , that fewer amino acids existed in the past. Mathematical invalid syllogisms are very interesting here. But the further work is also going to aim on a more intensive test of the position of the amino acids and syllogisms. The positions seem to have something in common with chemical properties. This would help to explain that amino acids, which drift from the genetic code, have similar chemical properties i.e. hydrophobia. Prof. Dr. Freeland wrote about this  too. Shegalkin-Polynomials shall be used here.
- Shegalkin II: Die Arithmetisierung der symbolischen Logik. Mat co. 1928, 311-377.Google Scholar
- Wolfram S, Farmer JD, Toffoli T: Cellular Automata. Proceedings of an Interdisciplinary Workshop. Physica D. 1984, 10D (1 and 2):Google Scholar
- Dewdney AK: The Planiverse. 1984, Poseidon PressGoogle Scholar
- Hayes B: Tabellenkalkulation. Spektrum der Wissenschaft. 1988, 46-52. Sonderheft Computer-Kurzweil IIGoogle Scholar
- Hayes B: Endliche Automaten. Spektrum der Wissenschaft. 1988, 53-59. Sonderheft Computer-Kurzweil IIGoogle Scholar
- Hayes B: Zelluläre Automaten. Spektrum der Wissenschaft. 1988, 60-67. Sonderheft Computer-Kurzweil IIGoogle Scholar
- Dewdney AK: Lineare Automaten. Spektrum der Wissenschaft. 1988, 68-73. Sonderheft Computer-Kurzweil IIGoogle Scholar
- Franke D: Sequentielle Systeme. 1994, Vieweg VerlagView ArticleGoogle Scholar
- Osawa S, Jukes TH, Watanabe K, Muto A: Microbiol Rev. 1992, 56: 229-264.PubMedPubMed CentralGoogle Scholar
- Osawa S: Evolution of the Genetic Code. 1995, Oxford: Oxford University PressGoogle Scholar
- Magini M, Hornos JEM: A Dynamical System for the Algebraic Approach to the Genetic Code. Brazilian Journal of Physics. 2003, 33 (4):Google Scholar
- Freeland SJ, Hurst LD: Der raffinierte Code des Lebens. Spektrum der Wissenschaft. 2006, 18-25. Dossier Das neue GenomGoogle Scholar
This article is published under license to BioMed Central Ltd.