Improving the Single Template Method in DNA Computing

WANG Xiang-hong; LIU Wen-bin; ZHU Xiang-ou; ZHANG Lin-xi

您当前的位置：

首页 >

文章列表页 >

Improving the Single Template Method in DNA Computing

更新时间：2025-07-16

- Improving the Single Template Method in DNA Computing
- Acta Electronica Sinica Vol. 37, Issue 12, Pages: 2720-2724(2009)
- 作者机构：
  
  1. 温州职业技术学院,浙江,温州,325035
  2. 浙江大学物理系,浙江,杭州,310027
  3. 温州大学物理与电子工程学院,浙江,温州,325035
  4. 温州职业技术学院浙江温州,325035
  5. 浙江大学物理系浙江杭州,310027
  6. 温州大学物理与电子工程学院浙江温州,325035
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP18
- Published：2009
- 稿件说明：
移动端阅览
WANG Xiang-hong, LIU Wen-bin, ZHU Xiang-ou, et al. Improving the Single Template Method in DNA Computing[J]. Acta Electronica Sinica, 2009, 37(12): 2720-2724.
DOI：

WANG Xiang-hong, LIU Wen-bin, ZHU Xiang-ou, et al. Improving the Single Template Method in DNA Computing[J]. Acta Electronica Sinica, 2009, 37(12): 2720-2724. DOI：

摘要

如何避免各种不期望的杂交是DNA计算以及微阵列技术中的一个关键问题.为了得到稳定可靠的杂交

必须探索一种可靠的、鲁棒性的编码方法.单模板编码方法是Arita提出的另一种模板编码方法

它能够保证编码间的移位距离约为l/3.其缺点是仅仅使用众多满足条件模板中的一个

因而编码数量有限.本文对单模板编码方法作了进一步的研究

提出来了另外一种模板框的结构

在基本保持移位距离约为l/3的情况下

将单模板方法扩展为多模板方法.这一研究大大提高了该方法的应用规模.

Abstract

How to avoid the various undesired hybridizations is a crucial problem in DNA based computing and other microarray applications.In order to achieve reliable hybridization

we should explore reliable and robust encoding methods.The single template method proposed by Arita can achieve a promising shift distance with l/3 between DNA strands.However

the limited codes produced by it cann’t meet the requirement of any practical application because only one possible template is employed.We extend it to multiple templates case so that the final codes can be linearly increased with the number of the templates while still keeping a shift distance close to l/3.Thus

the improved method can be applied to larger applications.

关键词

Keywords

references

Views

1082

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A New DNA Computing's Algorithm for 3-Dimensional Matching Problem Based on Divide and Conquer Strategy

Progress in the Research of DNA Computing

Analysis for Directed Hamilton Path Problems Based on Splicing Systems

Using DNA to Solve the Maximum Weight Clique of Graphs

A Survey of DNA Computing

Related Author

YANG Zhi-bang

YUE Guang-xue

LI Ken-li

ZHOU Xu

CHEN Li-chun

WANG Xiang-hong

ZHU Xiang-ou

LIU Wen-bin

Related Institution

School of Computer and CommunicationsHunan UniversityChangshaHunan 410082China

College of Mathematics and Information EngineeringJiaxing UniversityJiaxingZhejiang 314001China

School of Computer and Communications,Hunan University

College of Mathematics and Information Engineering,Jiaxing University

华中科技大学控制科学与工程系湖北武汉

⁰