Biomolecular implementation of computing devices with unbounded memory

Lecture Notes in Computer Science

Volumn 3384, Issue , 2005, Pages 35-49

  Cavaliere, Matteo ^a   Jonoska, Nataša ^b   Yogev, Sivan ^c   Piran, Ron ^c   Keinan, Ehud ^c,d   Seeman, Nadrian C ^e  

^a UNIVERSITY OF SEVILLE   (Spain)

^b UNIVERSITY OF SOUTH FLORIDA   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d SCRIPPS RESEARCH INSTITUTE   (United States)

^e NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; ENZYMES; MOLECULES;

BIMOLECULES; COMPUTING DEVICES; STACK MEMORY; UNBOUNDED MEMORY;

DNA;

EID: 24144490012     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11493785_4     Document Type: Conference Paper

References (17)

1. Y. Benenson, T. Paz-Elizur, R. Adar, Eh. Keinan, Z. Livneh, Eh. Shapiro, Programmable and autonomous computing machine made of biomolecules, Nature, 414 (2001), 430-434.
2. Y. Benenson, R. Adar, T. Paz-Elizur, Z. Livneh, Eh. Shapiro, DNA molecule provides a computing machine with both data and fuel, Proc. Nat. Acad. Sci. (PNAS) 100 5 (2003), 2191-2196.
3. J. Goldstine, J.K. Price, D. Wotschke, On reducing the number of stack symbols in a PDA, Math. Systems Theory 26 4 (1993), 313-326.
4. T. Head, Splicing schemes and DNA, in Lindenmayer Systems: Impact on Theoretical Computer Science and Developmental Biology (G. Rozenberg, A. Salomaa, eds.), Springer, Berlin, 1992, 371-383.
5. T. Head et.al, Computing with DNA by operating on plasmids, BioSystems 57 (2000), 87-93.
6. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
7. T. LaBean, H. Yan, J. Kopatsch, F. Liu, E. Winfree, J.H. Reif, N.C. Seeman, The construction, analysis, ligation and self-assembly of DNA triple crossover complexes, J. Am. Chem. Soc. 122 (2000), 1848-1860.
8. Liu Q. et al. DNA computing on surfaces, Nature 403 (2000), 175-179.
9. Gh. Pǎun, G. Rozenberg, A. Salomaa, DNA Computing - New Computing Paradigms, Springer-Verlag, Berlin, 1998.
10. P.W.K. Rothemund, A DNA and restriction enzyme implementation of Turing machines, DNA Based Computers AMS DIMACS series 27 (1998), 75-119.
11. P. Rothemund, N. Papadakis, E. Winfree, Algorithmic Self-assembly of DNA Sierpinski Triangles, Preproceedings of 9th DNA Based Computers, Madison, Wiscon-sin June 1-4 (2003), 125.
12. J. Sakamoto et al., State transitions by molecules, Biosystems 52 (1999), 81-91.
13. Y. Sakakibara, H. Imai, A DNA-based Computational Model Using a Specific Type of Restriction Enzyme, Proceedings of the 8th DNA Based Computer, (M. Hagiya, A. Ohuchi eds.), LNCS 2568, 315-325.
14. E. Winfree, F. Liu, L.A. Wenzler, N.C. Seeman, Design and self-assembly of two-dimensional DNA crystals, Nature 394 (1998), 539-544.
15. E. Winfree, X. Yang, N.C. Seeman, Universal computation via self-assembly of DNA: some theory and experiments, DNA computers II, (L. Landweber, E. Baum eds.), AMS DIMACS series 44 (1998), 191-214.
16. H. Yan, T.H. LaBean, L. Feng, J.H. Reif, Directed Nucleation Assembly of Barcode Patterned DNA Lattices, Proc. Nat. Acad. Sci. (PNAS) 100 No. 14 (2003), 8103-8108.
17. http://rebase.neb.com/rebase/rebase.html.