AUTOMATA ON GENETIC STRUCTURE

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Dutta Mridul; Kalita Sanjoy; Saikia Helen K.

Educational Videos and Scientific Workshops

Scientific Information Database

ISSN: 2588-4824

Journal Paper

Paper Information

Journal: Algebraic structures and their applications Year:2022 | Volume:9 | Issue:1 Page(s): 109-119

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

AUTOMATA ON GENETIC STRUCTURE

Author(s)

Dutta Mridul | Kalita Sanjoy | Saikia Helen K. | Issue Writer Certificate

Keywords

Automata

Transition function

Monoid

Near-ring

Genetic code

Codons

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 Σ,= (CG, P, AM, F, G) where P is the set of the four bases A, C, G, U as a set of alphabets or inputs, CG is the set of all 64 Codons, obtained from the ordering of the elements of P, as the set of states, AM 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(Σ, ) = ({fa: a ∈,P}, ◦, ) defined on the Automata Σ,where fa(q) = F(q, a) = qa, q ∈,CG, a ∈,P is a Monoid called the syntactic Monoid of Σ, , with fa ◦,fb = fba ∀, a, b ∈,P. Studying the structure defined in terms of Automata it is also observed that the algebraic structure (M(CG), +, ·, ) forms a Near-ring with respect to the two operations ′,+ ′,and ′, ·, ′,where M(CG) = {f|f: CG →,CG}.

Cites

No record.

References

No record.

Cite

APA: Copy

Dutta, Mridul, Kalita, Sanjoy, & Saikia, Helen K.. (2022). AUTOMATA ON GENETIC STRUCTURE. ALGEBRAIC STRUCTURES AND THEIR APPLICATIONS, 9(1), 109-119. SID. https://sid.ir/paper/1059372/en

Vancouver: Copy

Dutta Mridul, Kalita Sanjoy, Saikia Helen K.. AUTOMATA ON GENETIC STRUCTURE. ALGEBRAIC STRUCTURES AND THEIR APPLICATIONS[Internet]. 2022;9(1):109-119. Available from: https://sid.ir/paper/1059372/en

IEEE: Copy

Mridul Dutta, Sanjoy Kalita, and Helen K. Saikia, “AUTOMATA ON GENETIC STRUCTURE,” ALGEBRAIC STRUCTURES AND THEIR APPLICATIONS, vol. 9, no. 1, pp. 109–119, 2022, [Online]. Available: https://sid.ir/paper/1059372/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops

Download

Move to top

وبگردی