DNA计算机中基于顺序存储方式的二叉树数据结构  

Binary tree data structure based on sequential storage model in DNA computer

作　　者：朱雅莉[1] 李肯立[2] 

机构地区：[1]衡阳师范学院计算机科学系,湖南衡阳421008 [2]湖南大学计算机与通信学院,长沙410082

出　　处：《计算机应用》2008年第6期1591-1594,共4页journal of Computer Applications

基　　金：国家自然科学基金项目(60603053,60403002)

摘　　要：数据结构的设计对DNA计算机的具体实现有重要研究价值。提出了DNA计算机中基于顺序存储方式的二叉树数据结构的设计方法,该方法利用DNA分子和限制性内切酶的生物特性,完成二叉树的顺序存储结构和基本操作。其中用到的生物技术在实验室中都能实现。为了验证方法的可行性,给出了一个二叉树的DNA编码及仿真实例,仿真结果表明该二叉树设计方法在DNA计算机中切实可行。Design of data structure is valuable to the concrete realization of DNA computer. Therefore, a method of designing a binary tree based on sequential storage model in DNA computer was proposed, which utilized the biological characteristics of DNA molecules and restriction endonucleases to complete sequential storage structure and basic operations of the binary tree. All the biological technology mentioned here could be practically implemented in the laboratory. To prove the feasibility of this method, an actual binary tree with detailed nucleotide encodings and an instance of algorithm were given. The process of an algorithm implemented on this binary tree was demonstrated.

关 键 词：DNA计算机 二叉树 数据结构 顺序存储结构 

分 类 号：TP384[自动化与计算机技术—计算机系统结构]