Solving Vertex Cover Problem Using DNA Tile Assembly Model
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 computati...
Saved in:
Main Authors: | Zhihua Chen, Tao Song, Yufang Huang, Xiaolong Shi |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/407816 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Vertex Covering Transversal Domination Number of Regular Graphs
by: R. Vasanthi, et al.
Published: (2016-01-01) -
The Referenced Vertex Ordering Problem: Theory, Applications, and Solution Methods
by: Omer, Jérémy, et al.
Published: (2021-08-01) -
Tilings in topological spaces
by: F. G. Arenas
Published: (1999-01-01) -
CNN Accelerator Performance Dependence on Loop Tiling and the Optimum Resource-Constrained Loop Tiling
by: Chester Sungchung Park, et al.
Published: (2025-01-01) -
A Novel Computational Method to Reduce Leaky Reaction in DNA Strand Displacement
by: Xin Li, et al.
Published: (2015-01-01)