Synthesizing minimal tile sets for patterned DNA self-assembly

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6518 LNCS, Issue , 2011, Pages 71-82

  Göös, Mika ^a   Orponen, Pekka ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; CARDINALITIES; DNA SELF-ASSEMBLY; EMPIRICAL DATA; HEURISTIC SOLUTIONS; RECTANGULAR GRIDS; SEARCH TREES; SELF-ASSEMBLE;

ALGORITHMS; CALCULATIONS; DNA; SELF ASSEMBLY;

TREES (MATHEMATICS);

EID: 79251555290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18305-8_7     Document Type: Conference Paper

References (13)

1. Adleman, L., Cheng, Q., Goel, A., Huang, M.-D., Kempe, D., de Espanés, P.M., Rothemund, P.W.K.: Combinatorial optimization problems in self-assembly. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 23-32. ACM, New York (2002)
2. Göös, M., Orponen, P.: Synthesizing minimal tile sets for patterned DNA selfassembly. A detailed version, arXiv:0911.2924
3. Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. Theoretical Computer Science 410(4-5), 384-405 (2009)
4. Lin, C., Liu, Y., Rinker, S., Yan, H.: DNA tile based self-assembly: building complex nanoarchitectures. Chem. Phys. Chem. 7(8), 1641-1647 (2006)
5. Ma, X., Lombardi, F.: Synthesis of tile sets for DNA self-assembly. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27(5), 963-967 (2008) (Pubitemid 351596177)
6. Ma, X., Lombardi, F.: On the computational complexity of tile set synthesis for DNA self-assembly. IEEE Transactions on Circuits and Systems II: Express Briefs 56(1), 31-35 (2009)
7. Park, S.H., Pistol, C., Ahn, S.J., Reif, J.H., Lebeck, A.R., Dwyer, C., LaBean, T.H.: Finite-size, fully addressable DNA tile lattices formed by hierarchical assembly procedures. Angewandte Chemie International Edition 45(5), 735-739 (2006) (Pubitemid 43151387)
8. Park, S.H., Yan, H., Reif, J.H., LaBean, T.H., Finkelstein, G.: Electronic nanostructures templated on self-assembled DNA scaffolds. Nanotechnology 15, S525-S527 (2004)
9. Rothemund, P.W.K.: Theory and Experiments in Algorithmic Self-assembly. PhD thesis, University of Southern California (2001)
10. Rothemund, P.W.K.: Folding DNA to create nanoscale shapes and patterns. Nature 440, 297-302 (2006)
11. Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the 32nd Annual ACMSymposium on Theory of Computing (STOC 2000), pp. 459-468. ACM, New York (2000)
12. Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology (1998)
13. Yan, H., Park, S.H., Finkelstein, G., Reif, J.H., LaBean, T.H.: DNA-templated self-assembly of protein arrays and highly conducive nanowires. Science 301, 1882-1884 (2003) (Pubitemid 37221388)