Solving the set-splitting problem in sticker-based model and the lipton-adelmann model

Authors:
Weng-Long Chang;Minyi Guo;Michael Ho
Affiliations:
Department of Information Management, Southern Taiwan University of Technology, Tainan, Taiwan, R.O.C.;Department of Computer Software, The University of Aizu, Aizu-Wakamatsu City, Fukushima, Japan;Department of Information Management, Southern Taiwan University of Technology, Tainan, Taiwan, R.O.C.
Venue:
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Year:
2003

Citing 6
Cited 0

Molecular computation of solutions to combinatorial problems

Science
On the computational power of DNA

Discrete Applied Mathematics - Special volume on computational molecular biology
Introduction to Algorithms

Introduction to Algorithms
Solving Knapsack Problems in a Sticker Based Model

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Volume bounded molecular computation

Volume bounded molecular computation
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adleman wrote the first paper in which it was demonstrated that DNA (DeoxyriboNucleic Acid) strands could be applied for dealing with solutions to an instance of the NP complete Hamiltonian path problem (HPP). Lipton wrote the second paper in which it was shown that the Adleman teclmiques could also be used to solving the NP complete satisfiability (SAT) problem (the first NP-complete problem). Adleman and his co authors proposed sticker for enhancing the Adleman Lipton model. In the paper, it is proved how to apply sticker in the sticker based model for constructing solution space of DNA for the set splitting problem and how to apply DNA operations in the Adleman Lipton model to solve that problem from solution space of sticker.