Browse Prior Art Database

DNA Precursor Code

IP.com Disclosure Number: IPCOM000052952D
Original Publication Date: 1981-Aug-01
Included in the Prior Art Database: 2005-Feb-12
Document File: 2 page(s) / 14K

Publishing Venue

IBM

Related People

Kennedy, JJ: AUTHOR

Abstract

The Deoxyribonucleic Acid (DNA) Precursor Code provides a method, by means of computer programming, to generate any desired DNA nucleotide sequence or to simulate point mutation effects on a DNA nucleotide chain. This code has been found to be most valuable for use in programs relating to DNA synthesis.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 53% of the total text.

Page 1 of 2

DNA Precursor Code

The Deoxyribonucleic Acid (DNA) Precursor Code provides a method, by means of computer programming, to generate any desired DNA nucleotide sequence or to simulate point mutation effects on a DNA nucleotide chain. This code has been found to be most valuable for use in programs relating to DNA synthesis.

Four algorithms have been discovered, each of which have the capability of generating the genetic code table. In each case the sixty four codons of the genetic code table are divided into six independent chains. In addition, the codons are set down in a preferred order of sequence in each chain.

The preferred nucleotide sequences associated with these codons can be mutated by numerical procedures to produce any desired DNA nucleotide sequence order. Each nucleotide in a DNA sequence is represented by a four- digit code number. There are sixty four different precursor code number combinations. Each code number is used to compute the next nucleotide precursor code number which will occur in a preferred sequence order of nucleotides.

The four algorithms, any one of which may be used to generate the genetic code table, are represented as follows:

A precursor code number is comprised of a row of four digits designated as nw, nx, ny and nz. The next code number in a sequence, designated as nw', nx', ny' and nz', is computed from the previous code number as shown in the four algorithms represented above.

The following mathematical rules must be observed for computer programming or for manual calculation of the sequential four-digit precursor codes when an algorithm is employed: (1) the second and third numbers of each four-digit precursor code must be complements of 3. (2) If any digit in a precursor code results in a negative number, it is subtracted from 4. (3) If any digit in a precursor code is greater than 3, it is subtracted by 4.

The four DNA bases Guanine, Thymine, Adenine, and Cytosine represented by the letters G, T, A and C are assigned to the numbers O, 1, 2 and 3 such that the combination of G and C or A and T will add up to the number 3. By this method of assignment, the complement bases G and C or A and T will always interface each other when represented by the second and third digits of the precursor code. The above rules allow for eight different assignments of the letters G, T, A and C to the nu...