< Biomod | 2011 | Caltech/DeoxyriboNucleicAwesome
Our project is to develop a system that autonomously sorts DNA tagged structures as shown below. Our system involves randomly placed DNA tagged cargo on rectangular DNA origami, which is a 2D nano-scale surface . One edge of the origami is tagged with goal strands, and the rest of the origami is filled with track strands. The origami is then populated with random walkers that traverse the origami, picking up cargo and dropping them off at the goal. The motion of the walker and cargos will be examined by atomic force microscopy imaging. Bulk behavior of the system, kinetics of walking, and mechanisms of cargo picking up, and cargo dropping off will be analyzed by SPEX experiment.
DNA, which encodes most organisms in nature, is considered as an effective medium for representing and storing information. Noting that a computer can be modeled as a device that can carry out computation to produce desired output data for the given input data, we conclude that finding a way of processing data represented by DNA will lead to establishment of a new computational model, or a DNA computer. In this process, we tried to imitate and recreate nature’s precise and intricate engineering unmatched by the most sophisticated engineering of the mankind.
In fact, many different approaches for DNA computing have been studied in the last decade. One example would be Georg Seelig’s implementation of logic gates using Watson-Crick base pairing and strand displacement between DNA segments that represent different data . Another example is David Soloveichik’s work on chemical reaction networks, where it was shown that chemical reactions can be implemented by a cascade of DNA reactions and that such chemical reaction networks are actually Turing-universal [2,3]. Since all such computation (or data processing) takes place on the molecular scale, this research makes a promising approach to nanotechnology. Recently a group of researchers turned their attention to implementing the visible and intuitive mechanisms, such as robots, using DNA molecules. State of art of such molecular robots includes ones that can traverse a predetermined path in two dimensions , and one that can traverse a path and at the same time collect up to three gold nanoparticle cargos .
Project Overview: Ultimate goal
Caltech’s 2011 BIOMOD team is pursuing a topic in the former of those fields, seeking to demonstrate a mechanism for the sorting of cargo particles, each tagged with an identifying DNA strand, scattered across a 100x70nm playing field. Our mechanism is based on the cooperation of a number of independent DNA “walkers” that gradually wander around the playing field in a random walk, and specially positioned, cargo-specific goals. When a walker encounters a cargo, it picks it up by binding to its identifying DNA strand, and carries it around as it continues its exploration. The goals associated with a particular cargo retrieve that cargo from courier walkers by binding to the identifying strand in a way that frees the walker to collect more cargo, and prevents the cargo from being picked up again. Over time, this system will sort initially randomly strewn cargos to destinations predetermined by goal placement.a mechanism of simple directed transport potentially useful in many complex systems constructed on origami, such as molecular assembly lines. Our walker design is significant and novel on its own, due to its simplicity and ability to perform a 2-dimensional random walk, and should prove valuable on its own to future DNA robotics projects. More importantly, this project’s overarching principle of a useful result emerging from very simple and independently less useful elements working together is without a doubt vital to the eventual development larger scale DNA robotic systems.
Why is this useful to us? We see this technology being used effectively in a number of practical applications. The ability to sort on its own has plenty of uses. Additionally, when coupled with other mechanisms, the ability to sort has the possibility to lead to systems that automatically collect and remove byproducts from a reaction, purify a system and condense products into specified locations, and aid in controlled and detailed nanoscale assembly machines. Additionally, our specific implementation of a solution to this problem is universal enough that it can be applied to not only DNA, but anything that can be tagged with a DNA identifier.
Furthermore, our molecular robot is not limited to reorganizing molecules. Since the random walking mechanism domain is separated from the picking up or dropping off mechanism domain, our random walking robot can easily be modified for many tasks that require continuous exploration and information recognition on 2D surface.