Algorithmic self-assembly of DNA Sierpinski triangles

PLoS Biology

Volumn 2, Issue 12, 2004, Pages

  Rothemund, Paul W K ^a   Papadakis, Nick ^a   Winfree, Erik ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

ALGORITHM; ARTICLE; ATOMIC FORCE MICROSCOPY; AUTOMATION; CELL FUNCTION; CRYSTAL STRUCTURE; DNA SEQUENCE; DNA STRUCTURE; GEL ELECTROPHORESIS; GENETIC ENGINEERING AND GENE TECHNOLOGY; MOLECULAR DYNAMICS; PROTEIN MOTIF; THEORETICAL MODEL; BIOLOGICAL MODEL; BIOLOGY; BIOPHYSICS; CHEMISTRY; COMPUTER SIMULATION; GENETIC ENGINEERING; METHODOLOGY; MOLECULAR COMPUTER; NUCLEOTIDE SEQUENCE; REPRODUCIBILITY; ULTRAVIOLET RADIATION;

ALGORITHMS; BASE SEQUENCE; BIOPHYSICS; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; COMPUTERS, MOLECULAR; DNA; GENETIC ENGINEERING; MICROSCOPY, ATOMIC FORCE; MODELS, GENETIC; REPRODUCIBILITY OF RESULTS; SEQUENCE ANALYSIS, DNA; ULTRAVIOLET RAYS;

EID: 14044251445     PISSN: 15449173     EISSN: None     Source Type: Journal    
DOI: 10.1371/journal.pbio.0020424     Document Type: Article

References (58)

1. Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 266: 1021-1024.
2. Adleman LM, Cheng Q, Goel A, Huang MDA (2001) Running time and program size for self-assembled squares. Symposium on Theory of Computing (STOC). New York: Association for Computing Machinery. pp. 740-748.
3. Adleman L, Kari J, Kari L, Reishus D (2002) On the decidability of self-assembly of infinite ribbons. Symposium on Foundations of Computer Science (FOCS). New York: Association for Computing Machinery. pp 530-537.
4. Bennett CH (1995) Logical depth and physical complexity. In: Herken R, editor The universal Turing machine: A half-century survey Vienna: Springer-Verlag. pp 207-235.
5. Bloomfield VA, Crothers DM, Tinoco I (2000) Nucleic acids: Structures, properties, and functions. Sausalito, California: University Science Books. 672 p.
6. Bondarenko BA (1993) Generalized Pascal triangles and pyramids, their fractals, graphs and applications. Bollinger RC, translator and editor. Santa Clara, California: The Fibonacci Association. 190 pp.
7. Bowden N, Terfort A, Carbeck J, Whitesides G (1997) Self-assembly of mesoscale objects into ordered two-dimensional arrays. Science 276: 233-235.
8. Braun E, Eichen Y, Sivan U, Ben-Yoseph G (1998) DNA-templated assembly and electrode attachment of a conducting silver wire. Nature 391: 775-778.
9. Cairns-Smith AG (1971) The life puzzle: On crystals and organisms and on the possibility of a crystal as an ancestor. New York: Oliver and Boyd. 165 p.
10. Chen HL, Goel A (2005) Error free self-assembly using error prone tiles. DNA computing 10:. In press.
11. Cook M, Rothemund PWK, Winfree E (2004) Self-assembled circuit patterns. In: Chen J, Reif J, editors DNA computing 9: Berlin: Springer-Verlag. pp 91-107.
12. Davey R, Garside J (2000) From molecules to crystallizers. Oxford: Oxford University Press. 96 p.
13. Egan G (1995) Wang's carpets. In: Bear G, Greenberg MH, editors New legends New York: Tor Books. pp 349-378.
14. Fu TJ, Seeman NC (1993) DNA double-crossover molecules. Biochemistry 32: 3211-3220.
15. Jen E (1990) Aperiodicity in one-dimensional cellular automata. Physica D 45: 3-18.
16. Knuth DE (1997) The art of computer programming, volume 2: Seminumerical algorithms, 3rd ed. Reading, Massachusetts: Addison-Wesley Professional. 784 p.
17. Kolmogorov AN (1965) Three approaches to the quantitative definition of information. Problems Inform Transmission 1: 1-7.
18. LaBean TH, Winfree E, Reif JH (2000a) Experimental progress in computational by self-assembly of DNA tilings. In: Winfree E, Gifford DK, editors DNA-based computers V Providence, Rhode Island: American Mathematical Society. pp 123-140.
19. LaBean TH, Yan H, Kopatsch J, Liu F, Winfree E, et al. (2000b) Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes. J Am Chem Soc 122: 1848-1860.
20. Levin L (1984) Randomness conservation inequalities: Information and independence in mathematical theories. Inform Control 61: 15-37.
21. Li X, Yang X, Qi J, Seeman NC (1996) Antiparallel DNA double crossover molecules as components for nanoconstruction. J Am Chem Soc 118: 6131-6140.
22. Lindgren K, Nordahl M (1990) Universal computation in simple onedimensional cellular automata. Complex Sys 4: 299-318.
23. Mackay A (1975) Generalised crystallography. Izvj Jugosl Centr Krist Zagreb 10: 15-36.
24. Mao C, Sun W, Seeman NC (1999) Designed two-dimensional DNA Holliday junction arrays visualized by atomic force microscopy. J Am Chem Soc 121: 5437-5443.
25. Mao C, LaBean TH, Reif JH, Seeman NC (2000) Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407: 493-496.
26. Ouporov IV, Leontis NB (1995) Refinement of the solution structure of a branched DNA three-way junction. Biophys J 68: 266-274.
27. Penrose LS, Penrose R (1957) A self-reproducing analogue. Nature 179: 1183.
28. Radin C (1985) Tiling, periodicity, and crystals. J Math Phys 26: 1342-1344.
29. Reif J (1999) Local parallel biomolecular computing. In: Rubin H, Wood DH, editors DNA-based computers III Providence, Rhode Island: American Mathematical Society. pp 217-254.
30. Reif JH, Sahu S, Yin P (2005) Compact error-resilient computational DNA tiling assemblies. DNA computing 10:. In press.
31. Rhodes D, Klug A (1980) Helical periodicity of DNA determined by enzyme digestion. Nature 286: 573-578.
32. Rogozhin Y (1996) Small universal Turing machines. Theor Comput Sci 168: 215-240.
33. Rothemund PWK (2000) Using lateral capillary forces to compute by self-assembly. Proc Natl Acad Sci U S A 97: 984-989.
34. Rothemund PWK, Winfree E (2000) The program-size complexity of self-assembled squares. Symposium on Theory of Computing (STOC). New York: Association for Computing Machinery. pp 459-468.
35. Rothemund PWK, Ekani-Nkodo A, Papadakis N, Kumar A, Fygenson DK, et al. (2004) Design and characterization of programmable DNA nanotubes. J Am Chem Soc. In press.
36. Schulman R, Winfree E (2005) Controlling nucleation rates in algorithmic self-assembly. DNA computing 10:. In press.
37. Schulman R, Lee S, Papadakis N, Winfree E (2004) One dimensional boundaries for DNA tile assembly. In: Chen J, Reif J, editors DNA computing 9 Berlin: Springer-Verlag. pp 108-125.
38. Seeman NC (1982) Nucleic-acid junctions and lattices. J Theor Biol 99: 237-247.
39. Seeman NC (1990) De novo design of sequences for nucleic acid structural engineering. J Biomol Struct Dyn 8: 573-581.
40. Seeman NC (2003) Biochemistry and structural DNA nanotechnology: An evolving symbiotic relationship. Biochemistry 42: 7259-7269.
41. Senechal M (1995) Quasicrystals and geometry. Cambridge: Cambridge University Press. 302 p.
42. Soloveichik D, Winfree E (2005) Complexity of self-assembled scale-invariant shapes. DNA computing 10:. In press.
43. Stemmer WPC, Crameri A, Ha KD, Brennan TM, Heyneker HL (1995) Single-step assembly of a gene and entire plasmid from large numbers of oligodeoxyribonucleotides. Gene 164: 49-53.
44. Turing A (1936) On computable numbers, with an application to the Entscheidungsproblem. Proc Lond Math Soc 42: 230-265.
45. von Neumann J (1966) Theory of self-reproducing automata. Edited and completed by AW Burks. Urbana, Illinois: University of Illinois Press. 388 p.
46. Wang H (1961) Proving theorems by pattern recognition II. Bell System Tech J 40: 1-42.
47. Wang H (1962) An unsolvable problem on dominoes. Technical report BL-30 (II-15) Cambridge, Massachusetts: Harvard Computation Laboratory.
48. Wang JC (1979) Helical repeat of DNA in solution. Proc Natl Acad Sci U S A 76: 200-203.
49. Whitesides GM, Mathias JP, Seto CT (1991) Molecular self-assembly and nanochemistry: A chemical strategy for the synthesis of nanostructures. Science 254: 1312-1319.
50. Winfree E (1996) On the computational power of DNA annealing and ligation. In: Lipton RJ, Baum EB, editors DNA-based computers Providence, Rhode Island: American Mathematical Society. pp 199-221.
51. Winfree E (1998a) Simulations of computing by self-assembly. Technical report CS-TR:1998.22 Pasadena, California: California Institute of Technology.
52. Winfree E (1998b) Whiplash PCR for O(1) computing. Technical report CS-TR:1998.23 Pasadena, California: California Institute of Technology.
53. Winfree E, Bekbolatov R (2004) Proofreading tile sets: Error-correction for algorithmic self-assembly. In: Chen J, Reif J, editors DNA computing 9 Berlin: Springer-Verlag. pp 126-144.
54. Winfree E, Liu F, Wenzler LA, Seeman NC (1998a) Design and self-assembly of two-dimensional DNA crystals. Nature 394: 539-544.
55. Winfree E, Yang X, Seeman NC (1998b) Universal computation via self-assembly of DNA: Some theory and experiments. In: Landweber LF, Baum EB, editors DNA-based computers II Providence, Rhode Island: American Mathematical Society. pp 191-213.
56. Wolfram S (1986) Random sequence generation by cellular automata. Adv Appl Math 7: 123.
57. Yan H, LaBean TH, Feng L, Reif JH (2003a) Directed nucleation assembly of DNA tile complexes for barcode-patterned lattices. Proc Natl Acad Sci U S A 100: 8103-8108.
58. Yan H, Park SH, Finkelstein G, Reif JH, LaBean TH (2003b) DNA-templated self-assembly of protein arrays and highly conductive nanowires. Science 301: 1882-1884.