CaltechTHESIS
  A Caltech Library Service

Synthetic Molecular Machines for Active Self-Assembly: Prototype Algorithms, Designs, and Experimental Study

Citation

Dabby, Nadine L. (2013) Synthetic Molecular Machines for Active Self-Assembly: Prototype Algorithms, Designs, and Experimental Study. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/T0ZG-PA07. https://resolver.caltech.edu/CaltechTHESIS:05122013-221658522

Abstract

Computer science and electrical engineering have been the great success story of the twentieth century. The neat modularity and mapping of a language onto circuits has led to robots on Mars, desktop computers and smartphones. But these devices are not yet able to do some of the things that life takes for granted: repair a scratch, reproduce, regenerate, or grow exponentially fast–all while remaining functional.

This thesis explores and develops algorithms, molecular implementations, and theoretical proofs in the context of “active self-assembly” of molecular systems. The long-term vision of active self-assembly is the theoretical and physical implementation of materials that are composed of reconfigurable units with the programmability and adaptability of biology’s numerous molecular machines. En route to this goal, we must first find a way to overcome the memory limitations of molecular systems, and to discover the limits of complexity that can be achieved with individual molecules.

One of the main thrusts in molecular programming is to use computer science as a tool for figuring out what can be achieved. While molecular systems that are Turing-complete have been demonstrated [Winfree, 1996], these systems still cannot achieve some of the feats biology has achieved.

One might think that because a system is Turing-complete, capable of computing “anything,” that it can do any arbitrary task. But while it can simulate any digital computational problem, there are many behaviors that are not “computations” in a classical sense, and cannot be directly implemented. Examples include exponential growth and molecular motion relative to a surface.

Passive self-assembly systems cannot implement these behaviors because (a) molecular motion relative to a surface requires a source of fuel that is external to the system, and (b) passive systems are too slow to assemble exponentially-fast-growing structures. We call these behaviors “energetically incomplete” programmable behaviors. This class of behaviors includes any behavior where a passive physical system simply does not have enough physical energy to perform the specified tasks in the requisite amount of time.

As we will demonstrate and prove, a sufficiently expressive implementation of an “active” molecular self-assembly approach can achieve these behaviors. Using an external source of fuel solves part of the the problem, so the system is not “energetically incomplete.” But the programmable system also needs to have sufficient expressive power to achieve the specified behaviors. Perhaps surprisingly, some of these systems do not even require Turing completeness to be sufficiently expressive.

Building on a large variety of work by other scientists in the fields of DNA nanotechnology, chemistry and reconfigurable robotics, this thesis introduces several research contributions in the context of active self-assembly.

We show that simple primitives such as insertion and deletion are able to generate complex and interesting results such as the growth of a linear polymer in logarithmic time and the ability of a linear polymer to treadmill. To this end we developed a formal model for active-self assembly that is directly implementable with DNA molecules. We show that this model is computationally equivalent to a machine capable of producing strings that are stronger than regular languages and, at most, as strong as context-free grammars. This is a great advance in the theory of active self- assembly as prior models were either entirely theoretical or only implementable in the context of macro-scale robotics.

We developed a chain reaction method for the autonomous exponential growth of a linear DNA polymer. Our method is based on the insertion of molecules into the assembly, which generates two new insertion sites for every initial one employed. The building of a line in logarithmic time is a first step toward building a shape in logarithmic time. We demonstrate the first construction of a synthetic linear polymer that grows exponentially fast via insertion. We show that monomer molecules are converted into the polymer in logarithmic time via spectrofluorimetry and gel electrophoresis experiments. We also demonstrate the division of these polymers via the addition of a single DNA complex that competes with the insertion mechanism. This shows the growth of a population of polymers in logarithmic time. We characterize the DNA insertion mechanism that we utilize in Chapter 4. We experimentally demonstrate that we can control the kinetics of this re- action over at least seven orders of magnitude, by programming the sequences of DNA that initiate the reaction.

In addition, we review co-authored work on programming molecular robots using prescriptive landscapes of DNA origami; this was the first microscopic demonstration of programming a molec- ular robot to walk on a 2-dimensional surface. We developed a snapshot method for imaging these random walking molecular robots and a CAPTCHA-like analysis method for difficult-to-interpret imaging data.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:molecular robotics; molecular computing; nanotechnology; self-assembly
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Computation and Neural Systems
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Murray, Richard M.
Thesis Committee:
  • Barr, Alan H. (chair)
  • Pierce, Niles A.
  • Shimojo, Shinsuke
  • Stojanovic, Milan N.
  • Fygenson, Deborah K.
  • Murray, Richard M.
Defense Date:4 February 2013
Non-Caltech Author Email:ndabby (AT) gmail.com
Record Number:CaltechTHESIS:05122013-221658522
Persistent URL:https://resolver.caltech.edu/CaltechTHESIS:05122013-221658522
DOI:10.7907/T0ZG-PA07
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:7700
Collection:CaltechTHESIS
Deposited By: Nadine Dabby
Deposited On:17 May 2013 22:48
Last Modified:04 Oct 2019 00:00

Thesis Files

[img]
Preview
PDF (Complete_thesis) - Final Version
See Usage Policy.

41MB
[img]
Preview
PDF (Ch. 1) - Final Version
See Usage Policy.

2MB
[img]
Preview
PDF (Ch. 2) - Final Version
See Usage Policy.

6MB
[img]
Preview
PDF (Ch. 3) - Final Version
See Usage Policy.

987kB
[img]
Preview
PDF (Ch. 4) - Final Version
See Usage Policy.

14MB
[img]
Preview
PDF (Ch. 5) - Final Version
See Usage Policy.

1MB
[img]
Preview
PDF (Ch. 6) - Final Version
See Usage Policy.

68kB
[img]
Preview
PDF (Appendix A) - Final Version
See Usage Policy.

128kB
[img]
Preview
PDF (Appendix B) - Final Version
See Usage Policy.

21MB
[img]
Preview
PDF (Appendix C) - Final Version
See Usage Policy.

2MB
[img]
Preview
PDF (Bibliography) - Final Version
See Usage Policy.

98kB

Repository Staff Only: item control page