 |
To the left we can see one of the simple representations of a DNA Wang Tile. These Tiles fit together in a specific pattern and (A-T, and C-G). |
Dr. Winfree |
| Do you remember the game where you were given cutout shapes with numbers on each on the sides of the shape and you could only place two pieces together at the same number? If you do, you are being reminded of a game known as Wang Tiles. This simple game lays the foundation behind what Erik Winfree believes is the key to DNA computing. The idea is to use the cubes, rings, and octahedrons formed by Nadrian Seeman from the DNA double helix as "DNA Wang Tiles." Winfree believes that these "programmed" molecules could eradicate the extra lab work needed to separate the numerous answers retrieved by DNA (roughly 100 trillion answers in a drop of DNA, mostly incorrect and repeats). Theoretically, the tiles can only attach via specific pattern rules therefore only the right answers will come out. Thus, this tile method could harness the raw computational power of DNA with efficiency. If all goes well a single test tube of DNA tiles is predicted to perform at a rate almost 1 million times faster than an electronic computer or about 10 trillion additions per second. |
Click here to see what the future holds for DNA computing
|
To the left we can see one of the simple representations of a DNA Wang Tile. These Tiles fit together in a specific pattern and (A-T, and C-G). |
| Another look at the DNA Wang Tile approach. Notice how certain pieces will only connect to certain other pieces. This allows for high speed and high efficiency when forming the "correct" strands. |  |
 |
Created as part of a term project
for SCEN103
at the University of Delaware
Comments, suggestions, or requests to vverruto@udel.edu "http://www.udel.edu/physics/scen103/CGZ/DNAcomp2.html" Last updated May 14, 2000. Copyright Jen Franchino, Vinnie Verruto, Allison Zuckerbrow, Jeff May, Univ. of Delaware, 2000 |