JSW 2010 Vol.5(6): 662-670 ISSN: 1796-217X
doi: 10.4304/jsw.5.6.662-670
doi: 10.4304/jsw.5.6.662-670
A New Approach for the Dominating-Set Problem by DNA-Based Supercomputing
Xu Zhou1, GuangXue Yue1, ZhiBang Yang2, KenLi Li2
1College of Mathematics and Information Engineering, JiaXing University, JiaXing, P.R.China
2School of Computer and Communications,Hunan University, Changsha, C P.R.hina
Abstract—DNA computing has been applied to many different decision or combinatorial problems when being proved of its feasibility in experimental demonstration. In this paper, for the objective to reduce the DNA volume of the dominating set problem which belongs to the NP- complete problem, the pruning strategy is introduced into the DNA supercomputing and a new DNA algorithm is advanced. The new algorithm consists of a donimating set searcher, a donimating set generator, a parallel searcher and a minimum dominating set searcher. In a computer simulation, the new algorithm is testified to be highly spaceefficient and error-tolerant compared to conventional bruteforce searching.
Index Terms—DNA-based supercomputing, dominating set problem, pruning strategy, NP- complete problem.
2School of Computer and Communications,Hunan University, Changsha, C P.R.hina
Abstract—DNA computing has been applied to many different decision or combinatorial problems when being proved of its feasibility in experimental demonstration. In this paper, for the objective to reduce the DNA volume of the dominating set problem which belongs to the NP- complete problem, the pruning strategy is introduced into the DNA supercomputing and a new DNA algorithm is advanced. The new algorithm consists of a donimating set searcher, a donimating set generator, a parallel searcher and a minimum dominating set searcher. In a computer simulation, the new algorithm is testified to be highly spaceefficient and error-tolerant compared to conventional bruteforce searching.
Index Terms—DNA-based supercomputing, dominating set problem, pruning strategy, NP- complete problem.
Cite: Xu Zhou, GuangXue Yue, ZhiBang Yang, KenLi Li, "A New Approach for the Dominating-Set Problem by DNA-Based Supercomputing," Journal of Software vol. 5, no. 6, pp. 662-670, 2010.
General Information
ISSN: 1796-217X (Online)
Frequency: Quarterly
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, CNKI, Google Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsw@iap.org
-
Apr 26, 2021 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Nov 18, 2021 News!
Papers published in JSW Vol 16, No 1- Vol 16, No 6 have been indexed by DBLP [Click]
-
Dec 24, 2021 News!
Vol 15, No 1- Vol 15, No 6 has been indexed by IET-(Inspec) [Click]
-
Nov 18, 2021 News!
[CFP] 2022 the annual meeting of JSW Editorial Board, ICCSM 2022, will be held in Rome, Italy, July 21-23, 2022 [Click]
-
May 04, 2023 News!
Vol 18, No 2 has been published with online version [Click]