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

Ming-Yang Kao; Vijay Ramachandran

doi:10.1007/3-540-45678-3_37

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

Ming-Yang Kao^*, Vijay Ramachandran

^*Corresponding author for this work

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

14 Scopus citations

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 language	English (US)
Title of host publication	Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
Pages	429-441
Number of pages	13
DOIs	https://doi.org/10.1007/3-540-45678-3_37
State	Published - Dec 1 2001
Event	12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, New Zealand Duration: Dec 19 2001 → Dec 21 2001

Publication series

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

Other

Other	12th International Symposium on Algorithms and Computation, ISAAC 2001
Country	New Zealand
City	Christchurch
Period	12/19/01 → 12/21/01

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-45678-3_37

Fingerprint Dive into the research topics of 'DNA self-assembly for constructing 3D boxes (Extended Abstract)'. Together they form a unique fingerprint.

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

@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 = dec,

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",

note = "12th International Symposium on Algorithms and Computation, ISAAC 2001 ; Conference date: 19-12-2001 Through 21-12-2001",

}

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 proceeding › Conference 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

T2 - 12th International Symposium on Algorithms and Computation, ISAAC 2001

Y2 - 19 December 2001 through 21 December 2001

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