A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem
Single-strand DNA can match with homologous double-stranded into a triple-stranded structure mediated by RecA protein. The paper provides a triple-stranded DNA computing model for minimum spanning tree problem. DNA fragments corresponding to edges are coded by double-stranded DNA, wrong
hybridization does not take place and hairpin structure does not form. The single-strand DNA probe is bond with RecA protein, so the rate of wrong solution will reduce. And in this way, encoding complexity and the errors in computation will be decreased.
Keywords: ANTIGEN INTERMEDIARY; MINIMUM SPANNING TREE PROBLEM; TRIPLE-STRANDED DNA
Document Type: Research Article
Publication date: 01 July 2015
- 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