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

Article ID

UN56W

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

Prashanthi Govindarajan
Prashanthi Govindarajan
Sathya Govindarajan
Sathya Govindarajan
Ethirajan Govindarajan
Ethirajan Govindarajan
DOI

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 0’s and 1’s where 1’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.

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

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 0’s and 1’s where 1’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.

Prashanthi Govindarajan
Prashanthi Govindarajan
Sathya Govindarajan
Sathya Govindarajan
Ethirajan Govindarajan
Ethirajan Govindarajan

No Figures found in article.

ethirajan_govindarajan. 2020. “. Global Journal of Computer Science and Technology – G: Interdisciplinary GJCST-G Volume 20 (GJCST Volume 20 Issue G1): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Issue Cover
GJCST Volume 20 Issue G1
Pg. 23- 32
Classification
GJCST-G Classification: J.3
Keywords
Article Matrices
Total Views: 4480
Total Downloads: 1139
2026 Trends
Research Identity (RIN)
Related Research
Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

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

Prashanthi Govindarajan
Prashanthi Govindarajan
Sathya Govindarajan
Sathya Govindarajan
Ethirajan Govindarajan
Ethirajan Govindarajan

Research Journals