Algorithm for Graph’s Connectivity Problem Based on DNA Origami
-
Published:2021-02-01
Issue:2
Volume:16
Page:333-336
-
ISSN:1555-130X
-
Container-title:Journal of Nanoelectronics and Optoelectronics
-
language:en
-
Short-container-title:Journal of Nanoelectronics and Optoelectronics
Affiliation:
1. School of Statistics, Shanxi University of Finance and Economics, Taiyuan, Shanxi, 030000, China
Abstract
Based on DNA origami, an algorithm is proposed for Graph’s Connectivity problem via the self-assembly of DNA origami structures. The desired DNA origami structures can be constructed. These structures can encode the information of Graph’s vertices and edges, because these
structures have sticky ends, so they can assemble to advanced structures representing the information of a graph via specific hybridization. Via strand displacement reaction and agarose gel electrophoresis, the vertices can be deleted and the graph’s connectivity can be tested one by
one. This is a highly parallel method, and can reduce the complexity of Graph’s Connectivity problem greatly.
Publisher
American Scientific Publishers
Subject
Electrical and Electronic Engineering,Electronic, Optical and Magnetic Materials