Referenced Items are not available for this document.
The volume's exponential explosion problem has been the critical factor that constraints the development of the DNA computing. For the objective to decrease the DNA volume complex of the vertex cover problem which is a famous NP-complete problem, a new DNA algorithm is advanced. The new algorithm consists of a parallel reducer, a solution generator, a dense parallel searcher, a sparse parallel searcher and a vertex cover searcher. In a computer simulation, the DNA strands of maximum number required is O(√3n) on the condition of not varying the time complexity. Besides, this algorithm is highly space-efficient and error-tolerant compared to conventional brute-force searching, and thus can be scaled-up to solve large and hard minimum vertex cover problems.
Published in:
Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010 IEEE Fifth International Conference on
Date of Conference: 23-26 Sept. 2010
- Page(s):
- 190 - 194
- Print ISBN:
- 978-1-4244-6437-1
- INSPEC Accession Number:
- 11684562
- Conference Location :
- Changsha
- Digital Object Identifier :
- 10.1109/BICTA.2010.5645330
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
