Abstract
In this paper we propose a procedure for the storage and retrieval of digital signals utilizing DNA. Digital signals are encoded in DNA sequences that satisfy among other constraints the Noise Tolerance Constraint (NTC) that we have previously introduced. NTC takes into account the presence of noise in digital signals by exploiting the annealing between non-perfect complementary sequences. We discuss various issues arising from the development of DNA-based database solutions (i) in vitro (in test tubes, or other materials) for short-term storage and (ii) in vivo (inside organisms) for long-term storage. We discuss the benefits and drawbacks of each scheme and its effects on the codeword design problem and performance. We also propose a new way of constructing the database elements such that a short-term database can be converted into a long term one and vice versa without the need for a re-synthesis. The latter improves efficiency and reduces the cost of a long-term database.
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
Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266(5187), 1021–1024 (1994)
Baum, E.B.: Building an associative memory vastly larger than the brain. Science 268(5210), 583–585 (1995)
Clelland, C.T., Risca, V., Bancroft, C.: Hiding messages in DNA microdots. Nature 399(6736), 533–534 (1999)
Kakavand, H., O’Brien, D., Hassibi, A., Lee, T.H.: Maximum a Posteriori (MAP) Estimator for Polymerase Chain Reaction (PCR) Processes. In: Proc. of 26th Int. Conf. of IEEE Engineering in Medicine and Biology (2004)
Kameda, M.Y., Uejima, H., Hagiya, M., Sakamoto, K., Ohuchi, A.: Conformational addressing using the hairpin structure of single-strand DNA. In: Chen, J., Reif, J.H. (eds.) DNA 2003. LNCS, vol. 2943, pp. 219–224. Springer, Heidelberg (2004) (Revised Papers)
Kashiwamura, S., Yamamoto, M., Kameda, A., Shiba, T., Ohuchi, A.: Hierarchical DNA Memory Based on Nested PCR. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 112–123. Springer, Heidelberg (2003)
Ozawa, Y., Hanaoka, S., Saito, R., Tomita, M.: Differences of Translation Termination Sites Among the Three Stop Codons. In: Asai, K., Miyano, S., Takagi, T. (eds.) Genome Informatics 1999, vol. 10, pp. 328–329. Universal Academy Press, Tokyo (1999)
She, K.: So you want to Work with Giants: The BAC Vector. BioTeach Journal 1 (Fall 2003), Available online at http://www.bioteach.ubc.ca
Tsaftaris, S.A.: DNA-based Digital Signal Processing, M.S. Thesis, Northwestern University, Dept. of Electrical and Computer Engineering (June 2003)
Tsaftaris, S.A., Katsaggelos, A.K., Pappas, T.N., Papoutsakis, E.T.: DNA based matching of digital signals. In: Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, Montreal, Quebec, Canada, vol. 5, pp. 581–584 (2004)
Tsaftaris, S.A., Katsaggelos, A.K., Pappas, T.N., Papoutsakis, E.T.: How can DNA-computing be applied in digital signal processing? IEEE Signal Processing Mag. 21(6), 57–61 (2004)
Tsaftaris, S.A., Katsaggelos, A.K.: A New Codeword Design Algorithm for DNA-Based Storage and Retrieval of Digital Signals. In: Pre-Proceedings of the 11th International Meeting on DNA Computing, London, Canada, June 6-9 (2005)
Wong, P.C., Wong, K., Foote, H.: Organic Data Memory Using the DNA Approach. Communications of the ACMÂ 46(1) (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsaftaris, S.A., Katsaggelos, A.K. (2005). On Designing DNA Databases for the Storage and Retrieval of Digital Signals. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539117_160
Download citation
DOI: https://doi.org/10.1007/11539117_160
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28325-6
Online ISBN: 978-3-540-31858-3
eBook Packages: Computer ScienceComputer Science (R0)