Referenced Items are not available for this document.
The existence DNA computing models can solve most hard NP problems in theory. The graph isomorphism problem is a classical NP-hard problem. In this paper we proposed a DNA-based sticker algorithm, which uses the concept of incidence degree sequence to solve the graph isomorphism problem. The proposed algorithm is simplicity of operation and only O(2n) DNA strands is required in the worst case, where n is the vertex number of a graph.
Published in:
Biomedical Engineering and Informatics, 2009. BMEI '09. 2nd International Conference on
Date of Conference: 17-19 Oct. 2009
- Page(s):
- 1 - 5
- E-ISBN :
- 978-1-4244-4134-1
- Print ISBN:
- 978-1-4244-4132-7
- INSPEC Accession Number:
- 10956576
- Conference Location :
- Tianjin
- Digital Object Identifier :
- 10.1109/BMEI.2009.5302914
- 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.
