Some possible codes for encrypting data in DNA
Some possible codes for encrypting data in DNA
复制标题
DOI：
10.1023/a:1024539608706
复制
发表时间：
2003-07-01
影响因子：
2.7
通讯作者：
Cox, JPL
中科院分区：
文献类型：
--
作者：
Smith, GC;Fiddes, CC;Cox, JPL
据报道，有三种代码用于在DNA中存储书面信息。我们把这些代码称为霍夫曼代码、逗号代码和交替代码。利用构造经济码的霍夫曼算法设计了霍夫曼码。逗号代码使用单个碱基来标点信息，创建自动阅读框架和DNA，这显然是人工的。交替密码由嘌呤和嘧啶的交替序列组成，同样创造出了明显是人造的DNA。假设--并非不现实地--能够开发出非常快速的方法来组装和测序大片段DNA，那么霍夫曼代码将有助于常规的短期存储目的。另外两个代码更适合于长期（数百至数千年）的数据存档。
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).