Direct-Proportional Length-Based DNA Computing for Shortest Path Problem
Direct-Proportional Length-Based DNA Computing for Shortest Path Problem
复制标题
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Z. Ibrahim;Y. Tsuboi;O. Ono;M. Khalid
中科院分区：
文献类型：
--
作者：
Z. Ibrahim;Y. Tsuboi;O. Ono;M. Khalid
脱氧核糖核酸或DNA计算已经成为一个跨学科的领域，汇集了化学，分子生物学，计算机科学和数学。从DNA计算的角度来看，已经证明可以通过利用DNA的一些特性（如长度、浓度和解链温度）来解决加权图问题。在本文中，我们提出了一种替代的直接成比例的基于长度的DNA计算方法，其中每个路径的成本是由寡核苷酸的长度成比例的方式编码。其优点在于，在杂交和连接反应之后，可以进行凝胶电泳以根据其长度分离相应的DNA双链体，其直接解码结果。除了这个优点之外，所提出的方法的可靠性可以被增强，因为在计算期间仅采用一般和众所周知的生物分子实验室操作。
Deoxyribonucleic Acid or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science, and mathematics. From the DNA computing point of view, it has been proven that it is possible to solve weighted graph problems by exploiting some characteristics of DNA such as length, concentration, and melting temperature. In this paper, we present an alternative direct-proportional length-based DNA computing approach whereby the cost of each path is encoded by the length of the oligonucleotides in a proportional way. The advantage is such that, after the hybridization and ligation reactions, gel electrophoresis can be performed to separate the respective DNA duplex according to their length which directly decodes the results. In addition to this advantage, the reliability of the proposed approach can be enhanced as only the general and well-known bio-molecular laboratory operations are employed during the computation.