LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Graph Computation Using Algorithmic Self-Assembly of DNA Molecules.

Photo from wikipedia

DNA molecules have been used as novel computing tools, by which Synthetic DNA was designed to execute computing processes with a programmable sequence. Here, we proposed a parallel computing method… Click to show full abstract

DNA molecules have been used as novel computing tools, by which Synthetic DNA was designed to execute computing processes with a programmable sequence. Here, we proposed a parallel computing method using DNA origamis as agents to solve the three-color problem, an example of the graph problem. Each agent was fabricated with a DNA origami of ∼50 nm diameter and contained DNA probes with programmable sticky ends that execute preset computing processes. With the interaction of different nanoagents, DNA molecules self-assemble into spatial nanostructures, which embody the computation results of the three-color problem with polynomial numbers of computing nanoagents in a one-pot annealing step. The computing results were confirmed by atomic force microscopy. Our method is completely different from existing DNA computing methods in its computing algorithm, and it has an advantage in terms of computational complexity and results detection for solving graph problems.

Keywords: dna; computation using; using algorithmic; graph computation; dna molecules

Journal Title: ACS synthetic biology
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.