A Molecular Computing Model for 0-1 Programming Problem Using DNA Nanoparticles
In this paper, a small problem of 0-1 programming was solved based on a computing model using DNA/AuNP (gold nanoparticle). DNA/AuNP branch migration plays a key role in computing. In the course of computing, an effective DNA strand displacement and specific sequence recognitions ensure
the accuracy of computing. By taking several steps of reactions, the solution of the 0-1 programming problem is obtained after computing processes. In this computing model, there are two characteristics such as DNA/AuNP conjugates and low experimental complexity. Moreover, this work demonstrates
DNA may have more applications in the areas computer science and nano-technology.
Keywords: 3-COLORING PROBLEM; BRANCH MIGRATION; DNA COMPUTING; DNA/AUNP
Document Type: Research Article
Publication date: 01 October 2013
- Journal of Computational and Theoretical Nanoscience is an international peer-reviewed journal with a wide-ranging coverage, consolidates research activities in all aspects of computational and theoretical nanoscience into a single reference source. This journal offers scientists and engineers peer-reviewed research papers in all aspects of computational and theoretical nanoscience and nanotechnology in chemistry, physics, materials science, engineering and biology to publish original full papers and timely state-of-the-art reviews and short communications encompassing the fundamental and applied research.
- Editorial Board
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Terms & Conditions
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content