Linear Prediction of Overlapping Codons in a Genome Sequence
Venkateswarlu Pedakolmi1, E.G. Rajan2
1Venkateswarlu Pedakolmi*, Research Scholar, Dept. of Computer Science, MG-NIRSA, Affiliated to University of Mysore, Manasagangotri, Mysore, Karnataka, India.
2Prof. E.G. Rajan, Director, MG-NIRSA; Director, PRC Global Technologies Inc., Ontario, Canada.
Manuscript received on January 15, 2020. | Revised Manuscript received on January 22, 2020. | Manuscript published on February 10, 2020. | PP: 1177-1182 | Volume-9 Issue-4, February 2020. | Retrieval Number: D1585029420/2020©BEIESP | DOI: 10.35940/ijitee.D1585.029420
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The concept of overlapping n-ary codons was proposed in this paper as a novel approach to the study of genome sequences in the framework of theoretical computer science. Given a genome sequence of length N, one can have (N/n) non-overlapping n-ary codons with 0 or 1 or up to n-1 unused nucleotides left out in the sequence. Unused nucleotides are not considered in the scheme of genetic code. Alternatively, one can have (N-n+1) overlapping n-ary codons with no unused nucleotide left out in the sequence.
Keywords: Linear Perdition, Codons, Linear Boolean Functions, Genome Sequences
Scope of the Article: Logic, Functional Programming and Microcontrollers for IoT