DNA self-assembly for constructing 3D boxes (Extended Abstract)

Ming-Yang Kao*, Vijay Ramachandran

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

We propose a mathematical model of DNA self-assembly using 2D tiles to form 3D nanostructures. This is the first work to combine studies in self-assembly and nanotechnology in 3D, just as Rothemund and Winfree did in the 2D case. Our model is a more precise superset of their Tile Assembly Model that facilitates building scalable 3D molecules. Under our model, we present algorithms to build a hollow cube, which is intuitively one of the simplest 3D structures to construct. We also introduce five basic measures of complexity to analyze these algorithms. Our model and algorithmic techniques are applicable to more complex 2D and 3D nanostructures.

Original languageEnglish (US)
Title of host publicationAlgorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
Pages429-441
Number of pages13
DOIs
StatePublished - Dec 1 2001
Event12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, New Zealand
Duration: Dec 19 2001Dec 21 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2223 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Symposium on Algorithms and Computation, ISAAC 2001
CountryNew Zealand
CityChristchurch
Period12/19/0112/21/01

Fingerprint

Self-assembly
Self assembly
DNA
Tile
Nanostructures
Nanotechnology
Model
Regular hexahedron
Molecules
Mathematical Model
Mathematical models

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kao, M-Y., & Ramachandran, V. (2001). DNA self-assembly for constructing 3D boxes (Extended Abstract). In Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings (pp. 429-441). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2223 LNCS). https://doi.org/10.1007/3-540-45678-3_37
Kao, Ming-Yang ; Ramachandran, Vijay. / DNA self-assembly for constructing 3D boxes (Extended Abstract). Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. 2001. pp. 429-441 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bb74cbfc9a7942c08e7291646437d692,
title = "DNA self-assembly for constructing 3D boxes (Extended Abstract)",
abstract = "We propose a mathematical model of DNA self-assembly using 2D tiles to form 3D nanostructures. This is the first work to combine studies in self-assembly and nanotechnology in 3D, just as Rothemund and Winfree did in the 2D case. Our model is a more precise superset of their Tile Assembly Model that facilitates building scalable 3D molecules. Under our model, we present algorithms to build a hollow cube, which is intuitively one of the simplest 3D structures to construct. We also introduce five basic measures of complexity to analyze these algorithms. Our model and algorithmic techniques are applicable to more complex 2D and 3D nanostructures.",
author = "Ming-Yang Kao and Vijay Ramachandran",
year = "2001",
month = "12",
day = "1",
doi = "10.1007/3-540-45678-3_37",
language = "English (US)",
isbn = "3540429859",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "429--441",
booktitle = "Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings",

}

Kao, M-Y & Ramachandran, V 2001, DNA self-assembly for constructing 3D boxes (Extended Abstract). in Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2223 LNCS, pp. 429-441, 12th International Symposium on Algorithms and Computation, ISAAC 2001, Christchurch, New Zealand, 12/19/01. https://doi.org/10.1007/3-540-45678-3_37

DNA self-assembly for constructing 3D boxes (Extended Abstract). / Kao, Ming-Yang; Ramachandran, Vijay.

Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. 2001. p. 429-441 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2223 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - DNA self-assembly for constructing 3D boxes (Extended Abstract)

AU - Kao, Ming-Yang

AU - Ramachandran, Vijay

PY - 2001/12/1

Y1 - 2001/12/1

N2 - We propose a mathematical model of DNA self-assembly using 2D tiles to form 3D nanostructures. This is the first work to combine studies in self-assembly and nanotechnology in 3D, just as Rothemund and Winfree did in the 2D case. Our model is a more precise superset of their Tile Assembly Model that facilitates building scalable 3D molecules. Under our model, we present algorithms to build a hollow cube, which is intuitively one of the simplest 3D structures to construct. We also introduce five basic measures of complexity to analyze these algorithms. Our model and algorithmic techniques are applicable to more complex 2D and 3D nanostructures.

AB - We propose a mathematical model of DNA self-assembly using 2D tiles to form 3D nanostructures. This is the first work to combine studies in self-assembly and nanotechnology in 3D, just as Rothemund and Winfree did in the 2D case. Our model is a more precise superset of their Tile Assembly Model that facilitates building scalable 3D molecules. Under our model, we present algorithms to build a hollow cube, which is intuitively one of the simplest 3D structures to construct. We also introduce five basic measures of complexity to analyze these algorithms. Our model and algorithmic techniques are applicable to more complex 2D and 3D nanostructures.

UR - http://www.scopus.com/inward/record.url?scp=71049184062&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71049184062&partnerID=8YFLogxK

U2 - 10.1007/3-540-45678-3_37

DO - 10.1007/3-540-45678-3_37

M3 - Conference contribution

AN - SCOPUS:71049184062

SN - 3540429859

SN - 9783540429852

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

SP - 429

EP - 441

BT - Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings

ER -

Kao M-Y, Ramachandran V. DNA self-assembly for constructing 3D boxes (Extended Abstract). In Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. 2001. p. 429-441. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-45678-3_37