Some possible codes for encrypting data in DNA

Biotechnology Letters

Volumn 25, Issue 14, 2003, Pages 1125-1130

  Smith, Geoff C ^a   Fiddes, Ceridwyn C ^a   Hawkins, Jonathan P ^b   Cox, Jonathan P L ^b  

^a University of Bath   (United Kingdom)

^b University of Bath Claverton Down   (United Kingdom)

Author keywords

Artificial DNA; Data storage; DNA codes; Error protection; Huffman code

Indexed keywords

DNA;

ALGORITHM; ARTICLE; AUTOMATED PATTERN RECOGNITION; BIOLOGICAL MODEL; GENETIC CODE; HUMAN; INFORMATION RETRIEVAL; INFORMATION SCIENCE; METHODOLOGY;

ALGORITHMS; DNA; GENETIC CODE; HUMANS; INFORMATION STORAGE AND RETRIEVAL; INFORMATION THEORY; MODELS, GENETIC; PATTERN RECOGNITION, AUTOMATED;

HESPERIA COMMA BOREALIS;

EID: 0042130068     PISSN: 01415492     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024539608706     Document Type: Article

References (16)

1. Abramson N (1963) Information Theory and Coding. New York: McGraw-Hill, pp. 77-81.
2. Anonymous (2000) A Y3K bug. Nat. Biotechnol. 18: 1.
3. Bancroft C, Bowler T. Bloom B, Clelland CT (2001) Long-term storage of information in DNA. Science 293: 1763-1765.
4. Brenner S, Williams SR, Vermaas EH, Storck T, Moon K, McCollum C, Mao J-I, Luo S, Kirchner JJ, Eletr S, DuBridge RB, Burcham T, Albrecht G (2000) In vitro cloning of complex mixtures of DNA on microbeads: physical separation of differentially expressed cDNAs. Proc. Natl. Acad. Sci. USA 97: 1665-1670.
5. Cello J, Paul AV, Wimmer E (2002) Chemical synthesis of poliovirus cDNA: generation of infectious virus in the absence of natural template. Science 297: 1016-1018.
6. Cox JPL (2001) Long-term data storage in DNA. Trends Biotechnol. 19: 247-250.
7. Crick FHC, Griffith JS, Orgel LE (1957) Codes without commas. Proc. Natl. Acad. Sci. USA 43: 416-421.
8. Doig AJ (1997) Improving the efficiency of the genetic code by varying the codon length - the perfect genetic code. J. Theor. Biol. 188: 355-360.
9. Gehani A, LaBean TH, Reif JH (2000) DNA-based cryptography. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 54: 233-249.
10. Golomb SW (1962) Efficient coding for the desoxyribonucleic channel. Proceedings of the Fifteenth Symposium for Applied Mathematics 14: 87-100.
11. Huffman DA (1952) A method for the construction of minimum-redundancy codes. Proceedings of the I.R.E. 40: 1098-1101.
12. Sauer B (1996) Multiplex Crellox recombination permits selective site-specific DNA targeting to both a natural and an engineered site in the yeast genome. Nucl. Acids Res. 24: 4608-4613.
13. Singh S (1999) The Code Book. London: Fourth Estate, p. 19.
14. Stemmer WPC, Crameri A, Ha KD, Brennan TM, Heyneker HL (1995) Single-step assembly of a gene and entire plasmid from large numbers of oligodeoxyribonucleotides. Gene 164: 49-53.
15. Withers-Martinez C, Carpenter EP, Hackett F, Ely B, Sajid M, Grainger M, Blackman MJ (1999) PCR-based gene synthesis as an efficient approach for expression of the A+T-rich malaria genome. Prot. Eng. 12: 1113-1120.
16. Wong PC, Wong KK, Foote H (2003) Organic data memory using the DNA approach. Commun. ACM 46: 95-98.