Automata on genetic structure

Document Type : Research Paper

Authors

1 Department of Mathematics, Dudhnoi College, Dudhnoi-783124, Goalpara, Assam, India.

2 Department of Mathematics, School of Fundamental and Applied Sciences, Assam Don Bosco University, Tepesia-782402, Kamrup, Assam India.

3 Department of Mathematics, University of Gauhati, Guwahati-781014, Assam India.

10.29252/as.2021.2468

Abstract

In this paper, the authors have represented the genetic structures in terms of automata. With the algebraic structure defined on the genetic code authors defined an automaton on those codons as $\Sigma = (C_G, P, A_M, F, G)$ where $P$ is the set of the four bases $A, C, G, U$ as a set of alphabets or inputs, $C_G$ is the set of all 64 codons, obtained from the ordering of the elements of $P$, as the set of states, $A_M$ is the set of the 20 amino acids as the set of outputs that produce during the process. $F$ and $G$ are transition function and output function respectively. Authors observed that $M(\Sigma) = (\lbrace f_a : a \in P \rbrace, \circ)$ defined on the automata $\Sigma$ where $f_a(q) = F(q, a) = qa,\ \ q \in C_G, a \in P$ is a monoid called the syntactic monoid of $\Sigma$, with $f_a \circ f_b = f_{ba}$ $\forall a, b \in P$. Studying the structure defined in terms of automata it is also observed that the algebraic structure $(M(C_G),\ +,\ \cdot)$ forms a Near-Ring with respect to the two operations $' + '$ and $'\cdot '$ where $M(C_G) = \lbrace f \vert f : C_G \rightarrow C_G \rbrace$.

Keywords


[1] T. Ali and C. K. Phukan, Topology in genetic code algebra, Math. sci. int. res. j., 2 (2013) 179
[2] F. Antoneli, L. Braggion, M. Forger and JEM Hornos, Extending the search for symmetries in the genetic code, Int. J. Mod. Phys. B, 17 No. 17 (2003) 3135-3204.
[3] J. A. N. A. K. I. Balakrishnan, Symmetry scheme for amino acid codons, Phys. Rev. E, 65 No. 2 (2002) 021912.
[4] I. S. S. A. C. Barjis, J. W. Yeol and Y. S. Ryu, Modeling of protein production process by Finite Automata (FA), In Proceedings of 2005 WSEAS International Conference on: Mathematical Biology and Ecology (MABE'05) (2005).
[5] J. D. Bashford and P. D. Jarvis, The genetic code as a periodic table: algebraic aspects, Biosystems, 57 No. 3 (2000) 147-161.
[6] A. Nowzari-Dalini, E. Elahi, H. Ahrabian and M. Ronaghi, A New DNA Implementation of Finite State Machines, Int. J. Comput. Sci. Appl., 3 No. 1 (2006) 51-60.
[7] N. Gohain, T. Ali and A. Akhatar, Reducing Redundancy of Codons through Total Graph, Am. j. bioinform., 4 No. 1 (2015) 1.
[8] N. Gohain, T. Ali and A. Akhatar, Lattice structure and distance matrix of genetic code, J. Biol. Syst., 23 No. 03 (2015) 485-504.
[9] G. Hofer, Left ideals and reachability in machines, Theor. Comput. Sci., 68 No. 1 (1989) 49-56.  
[10] J. E. Hopcroft, R. Motwani and J. D. Ullman, Introduction to automata theory, languages, and computation, Language and Computations, Acm Sigact News, 32 No. 1 (2001) 60-65.
[11] C. Musili, Introduction to rings and modules, 2nd Rev. Edition, Narosa Publishing House, 1994.
[12] Qura-Tul-Ein, Y. Saeed, S. Naseem, F. Ahmad, T. Alyas, N. Tabassum, DNA pattern analysis using finite automata, International Research Journal of Computer Science (IRJCS), 1 No. 2 (2014) 1-4.
[13] R. Snchez, E. Morgado and R. Grau, Gene algebra from a genetic code algebraic structure, J. Math. Biol., 51 No. 4 (2005) 431-457
[14] R. Selvakumar, M. Rashith Muhammad and G. Poornima Devi, Computational model for the extraction of human erythropoietin, Int. J. ChemTech. Res., 5 (2013) 2623-2629.