Towards solution of the set-splitting problem on gel-based DNA computing

Authors:
Weng-Long Chang;Minyi Guo;Michael Ho
Affiliations:
Department of Information Management, Southern Taiwan University of Technology, Tainan 701, Taiwan, ROC;Department of Computer Software, The University of Aizu, Aizu-Wakamatsu City, Fukushima 965-8580, Japan;Department of Information Management, Southern Taiwan University of Technology, Tainan 701, Taiwan, ROC
Venue:
Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
Year:
2004

Citing 5
Cited 5

Introduction to algorithms

Introduction to algorithms
Molecular computation of solutions to combinatorial problems

Science
On the computational power of DNA

Discrete Applied Mathematics - Special volume on computational molecular biology
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

Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
A molecular solution to the hitting-set problem in DNA-based supercomputing

Information Sciences: an International Journal
Fast parallel DNA-based algorithms for molecular computation: discrete logarithm

The Journal of Supercomputing
A new light-based solution to the Hamiltonian path problem

Future Generation Computer Systems
A Molecular Solution to the Three-Partition Problem

Journal of Information Technology Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adleman wrote the first paper that demonstrated that DNA (DeoxyriboNucleic Acid) strands could be applied for dealing with solutions of the NP-complete Hamiltonian path problem (HPP). Lipton wrote the second paper that showed that the Adleman techniques could also be used to solve 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 this paper, it proves how to apply sticker in the sticker-based model to construct solution space of DNA in the set-splitting problem and how to apply DNA operations in the Adleman-Lipton model to solve that problem from the solution space of sticker.