Open Access
Translator Disclaimer
2013 Solving Vertex Cover Problem Using DNA Tile Assembly Model
Zhihua Chen, Tao Song, Yufang Huang, Xiaolong Shi
J. Appl. Math. 2013: 1-7 (2013). DOI: 10.1155/2013/407816

Abstract

DNA tile assembly models are a class of mathematically distributed and parallel biocomputing models in DNA tiles. In previous works, tile assembly models have been proved be Turing-universal; that is, the system can do what Turing machine can do. In this paper, we use tile systems to solve computational hard problem. Mathematically, we construct three tile subsystems, which can be combined together to solve vertex cover problem. As a result, each of the proposed tile subsystems consists of Θ(1) types of tiles, and the assembly process is executed in a parallel way (like DNA’s biological function in cells); thus the systems can generate the solution of the problem in linear time with respect to the size of the graph.

Citation

Download Citation

Zhihua Chen. Tao Song. Yufang Huang. Xiaolong Shi. "Solving Vertex Cover Problem Using DNA Tile Assembly Model." J. Appl. Math. 2013 1 - 7, 2013. https://doi.org/10.1155/2013/407816

Information

Published: 2013
First available in Project Euclid: 14 March 2014

zbMATH: 06950654
MathSciNet: MR3142564
Digital Object Identifier: 10.1155/2013/407816

Rights: Copyright © 2013 Hindawi

JOURNAL ARTICLE
7 PAGES


SHARE
Vol.2013 • 2013
Back to Top