Algorithmic self-assembly of DNA Sierpinski triangles.

Rothemund PW, Papadakis N, Winfree E. · 2004

Read Algorithmic self-assembly of DNA Sierpinski triangles. by Rothemund PW, Papadakis N, Winfree E. (2004) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/europmc-pmc534809.txt.

Description

Paul W. K. Rothemund, Nick Papadakis, and Erik Winfree made DNA compute a pattern in PLoS Biology in 2004. Algorithms guide shape in both machines and living things. Their aim was to build a fractal by rule: a Sierpinski triangle, the sieve-like pattern of nested triangles. The rule at its heart is a simple either-or logic step called XOR.

DNA tiles, small crossed pieces of DNA, stood in for the tiles of a cell game. Long starter strands seeded the growth, and the tiles then clicked in place by rule as the crystal grew. Under a fine microscope, clear Sierpinski patterns showed, with one to two hundred tiles in right spots. Slips ran between one and ten per hundred tiles. Faults aside, the growth proved that DNA assembly can run any cell game rule, and in time any set program.

Catalog record

CREATORRothemund PW, Papadakis N, Winfree E.
YEAR2004
COLLECTIONPAPERS
FORMATTXT
FILE SIZE71 KB
LICENSECC BY 4.0
RIGHTSCC BY
SOURCEEurope PMC

Source: https://europepmc.org/articles/PMC534809

Browse the full library · About the Tower of Babel