Abstract
The staged Tile Assembly Model has been introduced by Demaine et al. 2008 as an enhancement of the previous tile self-assembly model of Winfree. In this framework, the assembly is allowed to be performed in parallel in different test-tubes, and the obtained products are stored and mixed in subsequent assembly stages. Using elegant combinatorial constructions, in has been shown that staged assembly systems possess remarkable advantage in comparison to their abstract counterparts. Because of their parallel nature, one can choose from a multitude of staged assembly strategies for assembling a given target structure. In the current work we analyze these assembly variations from a kinetic perspective, in order to determine and possibly maximize, their final assembly yield. As a pre-requirement for this task, we provide a procedure for associating an analytically tractable mathematical model to a given staged assembly experiment, based on which we can predict the yield concentration of the final assembly product. As a case study, we consider various assembly strategies as well as optimized and non-optimized assembly protocols for generating a size-10 tile assembly.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cook, M., Fu, Y., Schweller, R.: Temperature 1 self-assembly: deterministic assembly in 3d and probabilistic assembly in 2d. In: Proc. of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 570–589. SIAM (2011)
Demaine, E.D., et al.: Staged self-assembly: nanomanufacture of arbitrary shapes with o(1) glues. Natural Computing 7(3), 347–370 (2008)
Demaine, E.D., Eisenstat, S., Ishaque, M., Winslow, A.: One-dimensional staged self-assembly. Natural Computing 12(2), 247–258 (2013)
Doty, D.: Theory of algorithmic self-assembly. Commun. ACM 55(12), 78–88 (2012)
Guldberg, C.M., Waage, P.: Studies concerning affinity. C. M. Forhandlinger: Videnskabs-Selskabet i Christiana (Norwegian Academy of Science and Letters)Â 35 (1864)
Guldberg, C., Waage, P.: Concerning chemical affinity. Erdmanns Journal fr Practische Chemie 127 (1879)
Hoops, S., et al.: Copasi - a complex pathway simulator. Bioinformatics 22(24), 3067–3074 (2006)
Padilla, J.E., Patitz, M.J., Pena, R., Schweller, R.T., Seeman, N.C., Sheline, R., Summers, S.M., Zhong, X.: Asynchronous signal passing for tile self-assembly: Fuel efficient computation and efficient assembly of shapes. In: Mauri, G., Dennunzio, A., Manzoni, L., Porreca, A.E. (eds.) UCNC 2013. LNCS, vol. 7956, pp. 174–185. Springer, Heidelberg (2013)
Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares. In: Proc. 32nd Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 459–468. ACM, New York (2000)
Schulman, R., Winfree, E.: Synthesis of crystals with a programmable kinetic barrier to nucleation. Proceedings of the National Academy of Sciences 104(39), 15236–15241 (2007)
Schulman, R., Yurke, B., Winfree, E.: Robust self-replication of combinatorial information via crystal growth and scission. Proceedings of the National Academy of Sciences 109(17), 6405–6410 (2012)
Winfree, E.: Simulations of computing by self-assembly. Technical Report CaltechCSTR:1998.22, California Institute of Technology (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czeizler, E., Orponen, P. (2013). Yield Optimization Strategies for (DNA) Staged Tile Assembly Systems. In: Dediu, AH., MartÃn-Vide, C., Truthe, B., Vega-RodrÃguez, M.A. (eds) Theory and Practice of Natural Computing. TPNC 2013. Lecture Notes in Computer Science, vol 8273. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45008-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-45008-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45007-5
Online ISBN: 978-3-642-45008-2
eBook Packages: Computer ScienceComputer Science (R0)