Abstract
We demonstrate a computing method in which a DNA nano-object representing the solution of a problem emerges as a result of self-assembly. We report an experiment in which three-vertex colorability for a six-vertex graph with nine edges is solved by constructing a DNA molecule representing the colored graph itself. Our findings show that computation based on "shape processing" is a viable alternative to symbol processing when computing by molecular self-assembly.
Original language | English (US) |
---|---|
Pages (from-to) | 80-84 |
Number of pages | 5 |
Journal | BioSystems |
Volume | 98 |
Issue number | 2 |
DOIs | |
State | Published - Nov 2009 |
Keywords
- Algorithmic DNA self-assembly
- Three-colorability
- Three-dimensional DNA graph structures
ASJC Scopus subject areas
- Statistics and Probability
- Modeling and Simulation
- General Biochemistry, Genetics and Molecular Biology
- Applied Mathematics