Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
394731 | Information Sciences | 2011 | 20 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Mohammadreza Razzazi, Mehdy Roayaei,