Home > Table of Contents


Proceedings of 2009 International Symposium on Computer Science and Computational Technology (ISCSCT 2009)

Huangshan, China, December 26-28, 2009

Editors: Fei Yu, Guangxue Yue, Jian Shu, Yun Liu

AP Catalog Number: AP-PROC-CS-09CN005

ISBN: 978-952-5726-07-7 (Print), 978-952-5726-08-4 (CD-ROM)

Page(s): 514-516

A New Approach for the Dominating-Set Problem by DNA-Based Supercomputing

Xu Zhou, GuangXue Yue, ZhiBang Yang, and Kenli Li

Full text: PDF


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 dominating set searcher, a dominating set generator, a parallel searcher and a minimum dominating set searcher. In a computer simulation, the new algorithm is testified to be highly space- efficient and error-tolerant compared to conventional bruteforce searching.

Index Terms

DNA-based supercomputing; dominating set problem; pruning strategy; NP- complete problem

Copyright @ 2009 ACADEMY PUBLISHER All rights reserved