Using sticker model of DNA computing to solve domatic partition, kernel and induced path problems

Authors:
Mohammadreza Razzazi;Mehdy Roayaei
Affiliations:
Software Systems R&D Lab, Department of Computer Engineering & IT, AmirKabir University of Technology, Iran;Software Systems R&D Lab, Department of Computer Engineering & IT, AmirKabir University of Technology, Iran
Venue:
Information Sciences: an International Journal
Year:
2011

Citing 8
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Approximating the Domatic Number

SIAM Journal on Computing
Solution of a Satisfiability Problem on a Gel-Based DNA Computer

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Solving Knapsack Problems in a Sticker Based Model

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Theoretical and Experimental DNA Computation (Natural Computing Series)

Theoretical and Experimental DNA Computation (Natural Computing Series)
DNA Computing Models

DNA Computing Models
Strand Algebras for DNA Computing

DNA Computing and Molecular Programming
Construction of AND Gate for RTRACS with the Capacity of Extension to NAND Gate

DNA Computing and Molecular Programming

Quantified Score

Hi-index	0.08

Visualization

Abstract

DNA computing as a powerful interdisciplinary field has been found to be very useful and applicable for solving NP-complete and intractable problems because of its huge power in parallel processing. In recent years many efforts have been done to solve NP-complete and time consuming problems with the help of DNA computing. In this paper, we use sticker model (one of the most well-known models of DNA computing) to present three DNA algorithms for solving three different NP-complete graph-based problems for the first time: domatic partition, kernel and induced path. Also we have simulated these algorithms to show their correctness.