Fast parallel bio-molecular solutions: the set-basis problem

Authors:
Weng-Long Chang;Michael Ho;Minyi Guo;Chengfei Liu
Affiliations:
Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, 415 Chien Kung Road, 807 Kaohsiung, Taiwan, ROC.;Department of Information Management, School of Information Technology, Ming Chuan University, 5, Teh-Ming Rd., Gwei-Shan, 333 Taoyuan, Taiwan, ROC.;School of Computer Science and Engineering, University of Aizu, Aizu Wakamatsu City, 965 8580 Fukushima, Japan.;Faculty of Information and Communication Technologies, Swinburne University of Technology, Melbourne, 3122 VIC, Australia
Venue:
International Journal of Computational Science and Engineering
Year:
2006

Citing 7
Cited 1

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 to the dominating-set problem on massively parallel bio-computing

Parallel Computing - Special issue: High-performance parallel bio-computing
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)

A molecular solution to the hitting-set problem in DNA-based supercomputing

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, it is demonstrated how to apply sticker in the sticker-based model for constructing solution space of DNA for the set-basis problem and how to apply DNA operations in the Adleman-Lipton model to solve that problem from solution space of sticker. Furthermore, this work shows the ability of DNA-based computing for resolving the NP-complete problems.