Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Know When to Fold ’Em: Self-assembly of Shapes by Folding in Oritatami

Know When to Fold ’Em: Self-assembly of Shapes by Folding in Oritatami

Thumbnail Image
Download
Name

1807.04682.pdf

Description
Submitted version
Size

18.21 MB

Format

Adobe PDF

Checksum (MD5)

e1a5f73bd03bacbd009ec5b613976588

sword-2019-06-11T11:46:39.original.xml (130 B)
Original SWORD entry document
Author(s)
Demaine, Erik D.
•
Hendricks, Jacob
•
Olsen, Meagan
•
Patitz, Matthew J.
•
Rogers, Trent A.
•
Schabanel, Nicolas
•
Seki, Shinnosuke
•
Thomas, Hadley
Date Issued
2018
Publisher
Springer International Publishing
Citation
Demaine, Erik D., Hendricks, Jacob, Olsen, Meagan, Patitz, Matthew J., Rogers, Trent A. et al. 2018. "Know When to Fold ’Em: Self-assembly of Shapes by Folding in Oritatami."
Version
Original manuscript
Abstract
© Springer Nature Switzerland AG 2018. An oritatami system (OS) is a theoretical model of self-assembly via co-transcriptional folding. It consists of a growing chain of beads which can form bonds with each other as they are transcribed. During the transcription process, the δ most recently produced beads dynamically fold so as to maximize the number of bonds formed, self-assemblying into a shape incrementally. The parameter δ is called the delay and is related to the transcription rate in nature. This article initiates the study of shape self-assembly using oritatami. A shape is a connected set of points in the triangular lattice. We first show that oritatami systems differ fundamentally from tile-assembly systems by exhibiting a family of infinite shapes that can be tile-assembled but cannot be folded by any OS. As it is NP-hard in general to determine whether there is an OS that folds into (self-assembles) a given finite shape, we explore the folding of upscaled versions of finite shapes. We show that any shape can be folded from a constant size seed, at any scale n≥ 3, by an OS with delay 1. We also show that any shape can be folded at the smaller scale 2 by an OS with unbounded delay. This leads us to investigate the influence of delay and to prove that, for all δ>2, there are shapes that can be folded (at scale 1) with delay δ but not with delay δ′>δ. These results serve as a foundation for the study of shape-building in this new model of self-assembly, and have the potential to provide better understanding of cotranscriptional folding in biology, as well as improved abilities of experimentalists to design artificial systems that self-assemble via this complex dynamical process.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/137771
DOI of Published Version
https://doi.org/10.1007/978-3-030-00030-1_2
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.