To read this content please select one of the options below:

(excl. tax) 30 days to view and download

DNA computing for a dominating set problem based on sticker models

Zhixiang Yin, Jianzhong Cui, Yan Yang, Yin Ma, Wei Wang, Jin Yang, Xia Sun

Kybernetes

ISSN: 0368-492X

Article publication date: 12 October 2012

392

Abstract

Purpose

The bottleneck of current DNA computing paradigms based on brute‐force search strategy is that initial solution space grows exponentially with problem size, thus only trivial instances of NP‐complete problem can be solved. The purpose of this paper is to present a novel molecular program based on sticker models for solving dominating set problems.

Design/methodology/approach

The authors do not synthesize the initial solution pool containing every possible candidate solution as previously reported algorithm. Instead, solutions DNA molecules to the problem of interest are constructed during the course of computation.

Findings

It is shown that “exponential explosions” inherent in current DNA computing paradigms may be overcome in this way.

Originality/value

The paper proposes an error‐resistant DNA algorithm based on sticker model for solving minimum dominating problems.

Keywords

Citation

Yin, Z., Cui, J., Yang, Y., Ma, Y., Wang, W., Yang, J. and Sun, X. (2012), "DNA computing for a dominating set problem based on sticker models", Kybernetes, Vol. 41 No. 9, pp. 1343-1350. https://doi.org/10.1108/03684921211275397

Publisher

:

Emerald Group Publishing Limited

Copyright © 2012, Emerald Group Publishing Limited

Related articles