Abstract
In molecular computing, it has long been a central focus to realize robust computational processes by suppressing the randomness of molecular reactions. To this end, several methods have been developed to control hybridization reactions of DNA molecules by optimizing DNA sequences and reaction parameters. However, another direction in the field is to take advantage of molecular randomness rather than avoid it. In this paper, we show that randomness can be useful in combination with a huge-capacity molecular memory, and demonstrate its application to an existing technology — DNA ink.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Leonard, M.: Adleman: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1024 (1994)
Braich, R.S., Chelyapov, N., Johnson, C., Rothemund, P.W.K., Adleman, L.: Solution to a 20-Variable 3-SAT Problem on a DNA Computer. Science 296, 499–502 (2002)
Fujibayashi, K., Murata, S.: A Method of Error Suppression for Self-assembling DNA Tiles. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA Computing. LNCS, vol. 3384, pp. 113–127. Springer, Heidelberg (2005)
Gotoh, O., Sakai, Y., Mawatari, Y., Gunji, W., Murakami, Y., Suyama, A.: Normalized molecular encoding method for quantitative gene expression profiling. In: Carbone, A., Pierce, N.A. (eds.) DNA Computing. LNCS, vol. 3892, p. 395. Springer, Heidelberg (2006)
Itakura, Y., Hashiyada, M., Nagashima, T., Fukuyama, M.: Validation Experiment Report on DNA Information for Personal Identification (Part I). Technical Report of IEICE ISEC2001-12 (2001-05), The Institute of Electronics, Information and Communication Engineers, pp. 1–8 (2001) (in Japanese)
Itakura, Y., Hashiyada, M., Nagashima, T., Tsuji, S.: Validation Experiment Report on DNA Information for Personal Identification (Part II). Technical Report of IEICE ISEC2001-13 (2001-05), The Institute of Electronics, Information and Communication Engineers , 9–16 (2001) (in Japanese)
Kashiwamura, S., Yamamoto, M., Kameda, A., Shiba, T., Ohuchi, A.: Hierarchical DNA Memory Based on Nested PCR. In: Hagiya, M., Ohuchi, A. (eds.) DNA Computing. LNCS, vol. 2568, pp. 112–123. Springer, Heidelberg (2003)
Kashiwamura, S., Kameda, A., Yamamoto, M., Ohuchi, A.: Two-Step Search for DNA Sequence Design. IEICE E87-A(6), 1446–1453 (2004)
Kashiwamura, S., Yamamoto, M., Kameda, A., Shiba, T., Ohuchi, A.: Potential for Enlarging DNA Memory: The Validity of Experimental Operations of Scaled-up Nested Primer Molecular Memory. BioSystems 80, 99–112 (2005)
Kubota, M., Hagiya, M.: Minimum Basin Algorithm: An Effective Analysis Technique for DNA Energy Landscapes. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA Computing. LNCS, vol. 3384, pp. 202–214. Springer, Heidelberg (2005)
Nitta, N., Suyama, A.: Autonomous biomolecular computer modeled after retroviral replication. In: Chen, J., Reif, J.H. (eds.) DNA Computing. LNCS, vol. 2943, pp. 203–212. Springer, Heidelberg (2004)
Soloveichik, D., Winfree, E.: Complexity of Compact Proofreading for Self-assembled Patterns. In: Carbone, A., Pierce, N.A. (eds.) DNA Computing. LNCS, vol. 3892, pp. 305–324. Springer, Heidelberg (2006)
Suyama, A.: Programmable DNA computer with application to mathematical and biological problems. Preliminary Proceedings of the Eighth International Meeting on DNA Based Computers, 91 (2002)
Takahashi, K., Yaegashi, S., Asanuma, H., Hagiya, M.: Photo- and Thermoregulation of DNA Nanomachines. In: Carbone, A., Pierce, N.A. (eds.) DNA Computing. LNCS, vol. 3892, pp. 336–346. Springer, Heidelberg (2006)
Yamamoto, M., Kashiwamura, S., Ohuchi, A.: DNA Memory with 16.8M addresses. DNA13 (submitted 2007)
Yurke, B., Turberfield, A.J., Mills Jr., A.P., Simmel, F.C., Neumann, J.L.: A DNA-fuelled molecular machine made of DNA. Nature 406, 605–608 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kameda, A., Kashiwamura, S., Yamamoto, M., Ohuchi, A., Hagiya, M. (2008). Combining Randomness and a High-Capacity DNA Memory. In: Garzon, M.H., Yan, H. (eds) DNA Computing. DNA 2007. Lecture Notes in Computer Science, vol 4848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77962-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-77962-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77961-2
Online ISBN: 978-3-540-77962-9
eBook Packages: Computer ScienceComputer Science (R0)