An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata...

33
An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1, Paul W. K. Rothemund, and Erik Winfree2

Transcript of An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata...

Page 1: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

An information-bearing seed for nucleating algorithmic self-assembly

Presented by : Venkata Chaitanya Goli

651366318

Robert D. Barish1, Rebecca Schulman1, Paul W. K. Rothemund, and Erik Winfree2

Page 2: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Outline

• Overview

• Preparation

• Experiments

• Techniques used and Results

• Principles for Success

• Future research topics

Page 3: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

OverviewExplaining the Title

Information – bearing Seed Information in a seed molecule can determine which form is grown as well as where and when.

Self- assemblySelf-assembly creates natural mineral, chemical, and biological structures of great complexity.

This phenomena can be exploited to program the growth of complex structures, as demonstrated by the algorithmic self-assembly of DNA tiles.

Page 4: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Overview• What is a seed ?

Controlled growth using Nucleation Barrier

Mineral and chemical compounds Simplest form seeded growth

Multicellular development, where genomic information in the zygote directs the algorithmic construction of the entire organism

Page 5: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

PreparationKey features to be present for a seed :

• Sufficiently well-formed • Capable of being synthesized with arbitrary information• Straightforward to implement experimentally.

high error rates, high spontaneous nucleation rates and low yields of well-formed structures.

Single-stranded DNA Finite-sized tile assemblies

Self-assembled ribbon-like crystals

incorporating significant amounts of specific information into such seeds remains prohibitive

Problems

Problems

Page 6: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Preparation

Each DNA tile consists of multiple strands folded into a rigid unit typically displaying 4 single-stranded ‘‘sticky ends’’ that direct the tile’s binding interactions with other tiles.

DNA Tile

Sticky ends

Page 7: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

PreparationOrigami DNA seed Tile

Adapters

Scaffold strand 192 Staple strands32 Adapter strands

Consists

Page 8: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

PreparationTiling theory

A tile is a geometrical shape, such as a jigsaw puzzle piece, that may be assembled with other tiles based on local matching rules.

Problems :

• Go beyond familiar fixed size

• random arrangements like fractals, binary trees, cellular automata

That’s where I come in

Page 9: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Preparation

The self-assembly process begins with an initial seed tile to which additional tiles can attach if they make sufficiently many

Program - The starting materials, i.e. a set of available tiles.

.

‘matching contacts’

So to summarize in simple terms

Input - The seed

Output - The structure produced by self-assembly is the output.

Page 10: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Experiment 1 (Temperature-dependent ):To test the growth

Steps :1) All strands for the seed and for the tile set are

mixed together in buffer

2) Heated to 90 °C

3) Annealed slowly to room temperature.

4) The process of self assembly is observed

Page 11: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

At temperature 90 °C - 60 °C

• At these temperatures, the DNA double helix is unstable and dissociates into its single- stranded form

• All the stick ends are inert and don’t show any binding properties.

Page 12: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

At temperature 60 °C - 40 °C

• At these temperatures, the seed and individual tiles become stable because of extensive contacts between strands• Tiles do not attach to the seed

nor to each other because the two additional sticky-end contacts formed by each tile attachment are not thermodynamically favorable at these temperatures and concentrations.

Page 13: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

At temperature 40 °C - 20 °C

• At slightly lower temperatures, below the crystal melting temperature, slightly supersaturated conditions are achieved.• The attachment of a tile by two matching sticky ends becomes favorable, but attachment by a single matching sticky end remains unfavorable• Consequently, tiles now attach to the origami seed and then attach to each other to grow a crystal

Page 14: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Experiment 2 (Width - Dependent ):

• Used a DNA tile set

Page 15: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Experiment 2 (Width - Dependent ):

• This tile set is added a nucleation barrier under some controlled conditions

Page 16: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Experiment 2 (Width - Dependent ):

• This tile set is added a nucleation barrier under some controlled conditions • A sample Zig-Zag pair

Page 17: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Experiment 2 (Width - Dependent ):

The sequence formed from the tile formation

Page 18: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Experiment 2 (Width - Dependent ):

A copy tile Set is created to maintain the bonding in a desired manner.

Page 19: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Experiment 2 (Width - Dependent ):

• Additional tiles for the Copy tile set. Inset shows how correct copying of information at bit boundaries depends on preferred attachment of tiles matching two sticky ends over tiles matching just one.

1*

1*1

1

5*

5*

4

4

Page 20: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Experiment 2 (Width - Dependent ):

Binary counter Tile sets

Page 21: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Experiment 2 (Width - Dependent ):

• ‘‘Carry Bit 1-Block’’ and ‘‘Carry Bit 0-Block’’ are added to the Copy tile set

• The gray double tile is replaced by the beige one, whose sticky end provides the initial carry bit for each new COUNT layer.

1*

1*

1

2*Gray Tile Replacement

Page 22: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Observations from the experiment:

• The rate of spontaneous nucleation decreases dramatically with width, and so, when the tiles are annealed without a seed, we expect the majority of crystals to be just 4 tiles wide.

• when annealed in the presence of seeds whose adapter tiles specify a particular width ribbon, we expect crystals of the specified width will grow off the seed— even before 4-wide ribbons nucleate spontaneously.

Page 23: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Observations with 8 width Origami:

Experiment 3 (Origami seed size):Magnified image of at the ribbon

Page 24: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Observations with 10 width Origami:

Experiment 3 (Origami seed size):Magnified image of at the ribbon

Page 25: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Experiments

Observations with 12 width Origami:

Experiment 3 (Origami seed size):Magnified image of at the ribbon

Page 26: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Observations from the experiment:

• Within ribbons, information was copied with an error rate of 0.13% per tile.• The most significant errors were those that changed the

width of the ribbon, either by an internal lattice defect or by a double tile attaching too early, causing a premature reversal of the zig-zag path.• Examination of errors on the first layer of the ribbon, where

tiles attach directly to tile adapters, revealed that nucleation is not perfect

• The copying error rate increased to 8% per tile and width-changing errors increased to 6% per layer.

Page 27: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Observations from the experiment:

• ‘‘0-Block’’ tiles appear gray• ‘‘1-Block’’ tiles appear white

Page 28: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Observations from the experiment:

• Fig F shows that the 1 block tiles are stopped

Page 29: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Observations from the experiment:

• The yellow part shows the error

Page 30: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

Principles behind the success:

• Each tile set was capable of generating an infinite variety of distinct structures, a precondition for programmability

• A designed nucleation barrier prevented the spontaneous assembly of tiles in slightly supersaturated conditions, clearing the way for high-yield seeded growth with low error rates.

• Information contained in the seed was propagated, and sometimes processed, during crystal growth, enacting a simple developmental program.

Page 31: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

The problems observed

• The rate of copying errors that changed 1 to 0 was 5–10 times higher than errors changing 0 to 1

• Premature reversal errors and spurious nucleation errors could be reduced by adding an independent nucleation barrier on the other edge of the ribbon

• Aggregation of crystals must be reduced.

• Implementing improved proofreading techniques (39) should further reduce logical error rates and larger block sizes may reduce internal lattice defects.

Page 32: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,

The Future Research topics

• The More efficient algorithm whose error rate is minimum that can compute the algorithmic complex structure of the seeded growth.

• More efficient tiles like origami rectangles which can be used to develop the structure or of even more complex organism.

• Getting the knowledge of combining the nanoparticles with the DNA can further help in developing new products in the field of nanotechnology

Page 33: An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli 651366318 Robert D. Barish1, Rebecca Schulman1,