在DNA计算机上建立生物分子数据库
Constructing Bio-molecular Databases on a DNA-based Computer
摘要：
Codd [Codd 1970]写了第一篇论文，其中提出了关系数据库的模型。阿德勒曼[阿德勒曼1994年]写的第一篇论文中，DNA链在试管中被用来解决一个例子的哈密尔顿路径问题。从[Adleman 1994]中，明显地表明，在DNA分子中存储信息允许大约1比特每立方纳米（纳米）的信息密度，并且相对于现有的存储介质（例如以大约1比特每1012立方纳米的密度存储信息的录像带）有显著的改进。本文证明了生物操作可以应用于构建生物分子数据库，其中关系表中的数据记录被编码为DNA链。为了实现这一目标，提出了在生物分子关系数据库上进行8种关系代数（演算）运算的DNA算法，包括笛卡尔积、并、集差、选择、投影、交、联、除。此外，这项工作提供了分子计算在生物分子关系数据库上执行数据检索操作的能力的明确证据。
英文摘要：
Codd [Codd 1970] wrote the first paper in which the model of a relational database was proposed. Adleman [Adleman 1994] wrote the first paper in which DNA strands in a test tube were used to solve an instance of the Hamiltonian path problem. From [Adleman 1994], it is obviously indicated that for storing information in molecules of DNA allows for an information density of approximately 1 bit per cubic nm (nanometer) and a dramatic improvement over existing storage media such as video tape which store information at a density of approximately 1 bit per 1012 cubic nanometers. This paper demonstrates that biological operations can be applied to construct bio-molecular databases where data records in relational tables are encoded as DNA strands. In order to achieve the goal, DNA algorithms are proposed to perform eight operations of relational algebra (calculus) on bio-molecular relational databases, which include Cartesian product, union, set difference, selection, projection, intersection, join and division. Furthermore, this work presents clear evidence of the ability of molecular computing to perform data retrieval operations on bio-molecular relational databases.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
