In 1996, a trinucleotide circular code which is maximum, self-complementary, and , called , was identified statistically on a large gene population of eukaryotes and prokaryotes (Arquès and Michel (1996)). Transition and transversions I and II are classical molecular evolution processes. A comprehensive computer analysis of these three evolution processes in the code shows some new results; in particular (i) transversion I on the 2nd position of any subset of trinucleotides of generates trinucleotide circular codes which are always and (ii) transversion II on the three positions of any subset of trinucleotides of yields no trinucleotide circular codes. These new results extend our theory of circular code in genes to its evolution under transition and transversion. 1. Introduction We continue our study of properties of trinucleotide circular codes [1–5], trinucleotide comma-free codes [1, 6], strong trinucleotide circular codes [7], and the common trinucleotide circular code identified in genes [8] (see also the recent statistical analysis by [9]) which could be a translation code [10]. A trinucleotide is a word of three letters (triletter) on the genetic alphabet . The set of trinucleotides is a code (called genetic code), more precisely a uniform code but not a circular code (see Remark 2). In the past years, codes, comma-free codes, and circular codes have been mathematical objects studied in theoretical biology, mainly to understand the structure and the origin of the genetic code as well as the reading frame (construction) of genes, for example, [11–13]. In order to have an intuitive meaning of these notions, codes are written on a straight line while comma-free codes and circular codes are written on a circle, but in both cases, unique decipherability is required. Circular codes only belong to some subsets of the trinucleotide set while comma-free codes are even more constrained subsets of circular codes [1]. Before the discovery of the genetic code, Crick et al. [11] proposed a maximum comma-free code of trinucleotides for coding the amino acids. This comma-free code turned out to be invalid (see, e.g., [14]). In , a maximum circular code of trinucleotides was identified statistically on a large gene population of eukaryotes and also on a large gene population of prokaryotes [8] This code has remarkable mathematical properties as it is a self-complementary maximum circular code (see the following). Since , its properties have been studied in detail by different authors, for example, [9, 15–21]. Transition and transversions I and II are classical
References
[1]
C. J. Michel, G. Pirillo, and M. A. Pirillo, “A relation between trinucleotide comma-free codes and trinucleotide circular codes,” Theoretical Computer Science, vol. 401, no. 1–3, pp. 17–26, 2008.
[2]
C. J. Michel and G. Pirillo, “Identification of all trinucleotide circular codes,” Computational Biology and Chemistry, vol. 34, no. 2, pp. 122–125, 2010.
[3]
L. Bussoli, C. J. Michel, and G. Pirillo, “On some forbidden configurations for self-complementary trinucleotide circular codes,” Journal for Algebra and Number Theory Academia, vol. 2, pp. 223–232, 2011.
[4]
L. Bussoli, C. J. Michel, and G. Pirillo, “On conjugation partitions of sets of trinucleotides,” Applied Mathematics, vol. 3, pp. 107–112, 2012.
[5]
C. J. Michel, G. Pirillo, and M. A. Pirillo, “A classiffication of 20-trinucleotide circular codes,” Information and Computation, vol. 212, pp. 55–63, 2012.
[6]
C. J. Michel, G. Pirillo, and M. A. Pirillo, “Varieties of comma-free codes,” Computers and Mathematics with Applications, vol. 55, no. 5, pp. 989–996, 2008.
[7]
C. J. Michel and G. Pirillo, “Strong trinucleotide circular codes,” International Journal of Combinatorics, vol. 2011, Article ID 659567, 14 pages, 2011.
[8]
D. G. Arquès and C. J. Michel, “A complementary circular code in the protein coding genes,” Journal of Theoretical Biology, vol. 182, no. 1, pp. 45–58, 1996.
[9]
D. L. Gonzalez, S. Giannerini, and R. Rosa, “Circular codes revisited: a statistical approach,” Journal of Theoretical Biology, vol. 275, pp. 21–28, 2011.
[10]
C. J. Michel, “Circular code motifs in transfer and 16S ribosomal RNAs: a possible translation code in genes,” Computational Biology and Chemistry, vol. 37, pp. 24–37, 2012.
[11]
F. H. C. Crick, J. S. Griffith, and L. E. Orgel, “Codes without commas,” Proceedings of the National Academy of Sciences, vol. 43, pp. 416–421, 1957.
[12]
S. W. Golomb, B. Gordon, and L. R. Welch, “Comma-free codes,” Canadian Journal of Mathematics, vol. 10, pp. 202–209, 1958.
[13]
S. W. Golomb, L. R. Welch, and M. Delbrück, “Construction and properties of comma-free codes,” in Biologiske Meddelelser, vol. 23, Det Kongelige Danske Videnskabernes Selskab, 1958.
[14]
B. Hayes, “The Invention of the Genetic Code,” American Scientist, vol. 86, no. 1, pp. 8–14, 1998.
[15]
A. J. Koch and J. Lehmann, “About a symmetry of the genetic code,” Journal of Theoretical Biology, vol. 189, no. 2, pp. 171–174, 1997.
[16]
R. Jolivet and F. Rothen, “Peculiar symmetry of DNA sequences and evidence suggesting its evolutionary origin in a primeval genetic code,” in Proceedings of the 1st European Workshop Exo-/Astrobiology, P. Ehrenfreund, O. Angerer, and B. Battrick, Eds., ESA SP-496, pp. 173–176, May 2001.
[17]
C. Nikolaou and Y. Almirantis, “Mutually symmetric and complementary triplets: differences in their use distinguish systematically between coding and non-coding genomic sequences,” Journal of Theoretical Biology, vol. 223, no. 4, pp. 477–487, 2003.
[18]
G. Pirillo, “A characterization for a set of trinucleotides to be a circular code,” in Determinism, Holism, and Complexity, C. Pellegrini, P. Cerrai, P. Freguglia, V. Benci, and G. Israel, Eds., Kluwer, 2003.
[19]
G. Pirillo and M. A. Pirillo, “Growth function of self-complementary circular codes,” Rivista di Biologia, vol. 98, no. 1, pp. 97–110, 2005.
[20]
J. L. Lassez, R. A. Rossi, and A. E. Bernal, “Crick's hypothesis revisited: the existence of a universal coding frame,” in Proceedings of the IEEE 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW '07), May 2007.
[21]
G. Pirillo, “A hierarchy for circular codes,” RAIRO: Theoretical Informatics and Applications, vol. 42, no. 4, pp. 717–728, 2008.
[22]
M. Kimura, “Estimation of evolutionary distances between homologous nucleotide sequences,” Proceedings of the National Academy of Sciences of the United States of America, vol. 78, no. 1, pp. 454–458, 1981.
[23]
J. Berstel and D. Perrin, Theory of Codes, Academic Press, London, UK, 1985.
[24]
J. L. Lassez, “Circular codes and synchronization,” International Journal of Computer and Information Sciences, vol. 5, no. 2, pp. 201–208, 1976.