A Novel Approach to Genome Editing Using Cellular Automata Evolutions of Adjoints Sequences

Authors

  • Prashanthi Govindarajan

  • Sathya Govindarajan

  • Ethirajan Govindarajan

Keywords:

genome editing, cellular automata, evolutions of adjoints, linear boolean functions

Abstract

This paper proposes a novel method for genome editing using cellular automata evolutions of adjoints of Adenine, Thymine, Guanine, and Cytosine. The adjoints of the given a genome sequence are the characteristic binary string sequences. For example, the adjoint of Adenine of a given genome sequence is a binary string consisting of 02019;s and 12019;s where 12019;s corresponds to the presence of Adenine in the genome sequence. So, one can have four adjoint sequences of Adenine, Thymine, Guanine, and Cytosine corresponding to a given genome sequence. One-dimensional three neighborhood binary value cellular automata rules can be applied to an adjoint sequence and the desired number of evolutions could be obtained. This rule is defined by a linear Boolean function and one can have 256 such linear Boolean functions. Genome editing is carried out by superimposing the evolved adjoint sequence on the original genome sequence or on its successive evolutions. In this manner, one can have four ways of genome editing using four adjoint sequences and evolutions.

How to Cite

Prashanthi Govindarajan, Sathya Govindarajan, & Ethirajan Govindarajan. (2020). A Novel Approach to Genome Editing Using Cellular Automata Evolutions of Adjoints Sequences. Global Journal of Computer Science and Technology, 20(G1), 23–32. Retrieved from https://computerresearch.org/index.php/computer/article/view/1908

A Novel Approach to Genome Editing Using Cellular Automata Evolutions of Adjoints Sequences

Published

2020-01-15