用于分子计算的基于DNA的快速并行算法：集合划分问题。

Fast parallel DNA-based algorithms for molecular computation: the set-partition problem.

作者信息

Chang Weng-Long

机构信息

Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung 807, Taiwan, R.O.C.

出版信息

IEEE Trans Nanobioscience. 2007 Dec;6(4):346-53. doi: 10.1109/tnb.2007.909012.

DOI:10.1109/tnb.2007.909012

PMID:18217628

Abstract

This paper demonstrates that basic biological operations can be used to solve the set-partition problem. In order to achieve this, we propose three DNA-based algorithms, a signed parallel adder, a signed parallel subtractor and a signed parallel comparator, that formally verify our designed molecular solutions for solving the set-partition problem.

摘要

本文证明了基本的生物操作可用于解决集合划分问题。为实现这一点，我们提出了三种基于DNA的算法，即带符号并行加法器、带符号并行减法器和带符号并行比较器，它们正式验证了我们为解决集合划分问题而设计的分子解决方案。