Evans, Constantine G. and Winfree, Erik (2013) DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly. In: DNA Computing and Molecular Programming. Lecture Notes in Computer Science . No.8141. Springer , Cham, Switzerland, pp. 61-75. ISBN 978-3-319-01927-7. https://resolver.caltech.edu/CaltechAUTHORS:20140530-150254025
|
PDF
- Accepted Version
See Usage Policy. 821kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20140530-150254025
Abstract
A major challenge in practical DNA tile self-assembly is the minimization of errors. Using the kinetic Tile Assembly Model, a theoretical model of self-assembly, it has been shown that errors can be reduced through abstract tile set design. In this paper, we instead investigate the effects of “sticky end” sequence choices in systems using the kinetic model along with the nearest-neighbor model of DNA interactions. We show that both the sticky end sequences present in a system and their positions in the system can significantly affect error rates, and propose algorithms for sequence design and assignment.
| Item Type: | Book Section | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Related URLs: |
| |||||||||
| ORCID: |
| |||||||||
| Additional Information: | © 2013 Springer International Publishing Switzerland. | |||||||||
| Series Name: | Lecture Notes in Computer Science | |||||||||
| Issue or Number: | 8141 | |||||||||
| DOI: | 10.1007/978-3-319-01928-4_5 | |||||||||
| Record Number: | CaltechAUTHORS:20140530-150254025 | |||||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20140530-150254025 | |||||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
| ID Code: | 46019 | |||||||||
| Collection: | CaltechAUTHORS | |||||||||
| Deposited By: | Tony Diaz | |||||||||
| Deposited On: | 30 May 2014 22:54 | |||||||||
| Last Modified: | 10 Nov 2021 17:19 |
Repository Staff Only: item control page
