title: Some possible codes for encrypting data in DNA.
abstract: Three codes are reported for storing written information in DNA. We refer to these codes as the Huffman code, the comma code and the alternating code. The Huffman code was devised using Huffman's algorithm for constructing economical codes. The comma code uses a single base to punctuate the message, creating an automatic reading frame and DNA which is obviously artificial. The alternating code comprises an alternating sequence of purines and pyrimidines, again creating DNA that is clearly artificial. The Huffman code would be useful for routine, short-term storage purposes, supposing--not unrealistically--that very fast methods for assembling and sequencing large pieces of DNA can be developed. The other two codes would be better suited to archiving data over long periods of time (hundreds to thousands of years).
authors.affiliation: Department of Mathematics, University of Bath, Bath BA2 7AY, UK.
authors.forename: Geoff C
authors.initials: GC
authors.lastname: Smith
authors.forename: Ceridwyn C
authors.initials: CC
authors.lastname: Fiddes
authors.forename: Jonathan P
authors.initials: JP
authors.lastname: Hawkins
authors.forename: Jonathan P L
authors.initials: JP
authors.lastname: Cox
mesh_terms: D000465:Algorithms; D004247:DNA; D005815:Genetic Code; D006801:Humans; D016247:Information Storage and Retrieval / Q000379:methods; D007257:Information Theory; D008957:Models, Genetic; D010363:Pattern Recognition, Automated
chemical_list: D004247:DNA