nach oben

Natural Computing

Erschienen in:

01.09.2008

Large-scale DNA memory based on the nested PCR

verfasst von: Masahito Yamamoto, Satoshi Kashiwamura, Azuma Ohuchi, Masashi Furukawa

Erschienen in: Natural Computing | Ausgabe 3/2008

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

A DNA Memory with over 10 million (16.8 M) addresses was achieved. The data embedded into a unique address was correctly extracted through an addressing processes based on nested PCR. The limitation of the scaling-up of the proposed DNA memory is discussed by using a theoretical model based on combinatorial optimization with some experimental restrictions. The results reveal that the size of the address space of the DNA memory presented here may be close to the theoretical limit. The high-capacity DNA memory can be also used in cryptography (steganography) or DNA ink. In decoding process, multiple data with different addresses can be also simultaneously accessed by using the mixture of some address primers.

Vorheriger Artikel Toward minimum size self-assembled counters

Nächster Artikel Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Nur mit Berechtigung zugänglich

Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021–1024CrossRef

Baum EB (1995) Building an associative memory vastly larger than the brain. Science 268:583–585CrossRef

Benenson Y, Paz-Elizur T, Adar R, Keinan E, Livneh Z, Shapiro E (2001) Programmable and autonomous computing machine made of biomolecules. Nature 414:430–434CrossRef

Braich RS, Chelyapov N, Johnson C, Rothemund PWK, Adleman L (2002) Solution of a 20-variable 3-SAT problem on a DNA computer. Science 296:499–502CrossRef

Chen J, Deaton R, Wang YZ (2005) A DNA-based memory with in vitro learning and associative recall. Nat Comput 4(2):83–101CrossRefMathSciNet

Clelland CT, Risca V, Bancroft C (1999) Hiding message in DNA microdots. Nature 399:533–544CrossRef

Deaton R, Murphy RC, Garzon M, Franceschetti DR, Stevens SE Jr (1999) Good encoding for DNA-based solutions to combinatorial problems. In: Landweber LF, Baum EB (eds) DNA based computers II: DIMACS workshop, June 1996, DIMACS series in discrete mathematics and theoretical computer science 44:247–258

Hashiyada M (2004) Development of biometric DNA ink for authentication security. Tohoku J Exp Med 204:109–117CrossRef

Hashiyada M, Itakura Y, Nagashima T, Nata M, Funayama M (2003) Polymorphism of 17 STRs by multiplex analysis in Japanese population. Forensic Sci Int 133:250–253CrossRef

Itakura Y, Hashiyada M, Nagashima T, Tsuji S (2002) Proposal on Personal Identifiers Generated from the STR Information of DNA. Int J Information Security 1:149–160MATHCrossRef

Kameda A, Kashiwamura S, Yamamoto M, Ohuchi A, Hagiya M (2007) Combining randomness and a high-capacity DNA memory. In: Preliminary proceeding of 13th international meeting on DNA Based computers, pp 261–269

Kashiwamura S, Yamamoto M, Kameda A, Shiba T, Ohuchi A (2003) Hierarchical DNA memory based on nested PCR. In: Hagiya M, Ohuchi A (eds) DNA8: 8th International workshop on DNA-based computers, Sapporo, Japan, June 2002. Lecture notes in computer science, vol 2568. Springer, Berlin Heidelberg New York, pp 112–123

Kashiwamura S, Kameda A, Yamamoto M, Ohuchi A (2004) Two-step search for DNA sequence design. IEICE TRANSACTIONS on Fundamentals of Electronics, Commun Computer Sci E87-A(6):1446–1453

Kashiwamura S, Yamamoto M, Kameda A, Shiba T, Ohuchi A (2005a) Potential for enlarging DNA memory: the validity of experimental operations of scaled-up nested primer molecular memory. BioSystems 80:99–112CrossRef

Kashiwamura S, Yamamoto M, Kameda A, Ohuchi A (2005b) Experimental challenge of scaled-up hierarchical DNA memory expressing a 10,000-address space. In: Preliminary proceeding of 11th international meeting on DNA based computers, p 396

Lipton R (1995) DNA solution of hard combinatorial problems. Science 268:542–545CrossRef

Lyngso LB, Zuker M, Pedersen CN (1999) Fast evaluation of internal loops in RNA secondary structure prediction. Bioinformatics 15:440–445CrossRef

McPherson MJ, Hames BD, Taylor GR (1995a) PCR: A practical approach. Oxford University Press

McPherson MJ, Hames BD, Taylor GR (1995b) PCR2: A practical approach. Oxford University Press

Neel A, Garzon MH, Penumatsa P (2004) Improving the quality of semantic retrieval in DNA-based memories with learning. In: KES 2004: 8th Internaltional conference, Wellington, New Zealand, September 20–25 2004, Lecture notes in computer science, vol 3213. Springer, Berlin Heidelberg, New York, pp 18–24

Reif JH, LaBean TH, Pirrung M, Rana VS, Guo B, Kingsford C, Wickham GS (2002) Experimental construction of very large scale dna databases with associative search capability. In: Jonoska N, Seeman NC (eds) DNA 7: 7th International workshop on DNA-based computers, Tampa, FL, USA, June 2001. Lecture notes in computer science, vol 2340. Springer, Berlin, Heidelberg, New York, pp 231–247

SantaLucia J, Allawi HT, Seneviratne PA (1996) Improved nearest-neighbor parameters for predicting DNA duplex stability. Biochemistry 35:3555–3562CrossRef

Sugimoto N, Nakano S, Yoneyama M, Honda K (1996) Improved thermodynamic parameters and helix initiation factor to predict stability of DNA duplexes. Nucl Acid Res 24:4501–4505CrossRef

Tanaka F, Kameda A, Yamamoto M, Ohuchi A (2005) Design of nucleic acid sequences for DNA computing based on a thermodynamic approach. Nucl Acid Res 33:903–911

Tulpan DC, Hoos HH, Condon A (2003) Stochastic local search algorithms for DNA word design. In: Hagiya M, Ohuchi A (eds) DNA8: 8th international workshop on DNA-based computers, Sapporo, Japan, June 2002. Lecture notes in computer science, vol 2568. Springer, Berlin, Heidelberg, New York, pp 229–241

Wong PC, Wong KK, Foote H (2003) Organic data memory using the DNA approach. Commun ACM 46(1):95–98CrossRef

Zuker M, Stiegler P (1981) Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucl Acid Res 9:133–148CrossRef

Titel: Large-scale DNA memory based on the nested PCR
verfasst von: Masahito Yamamoto
Satoshi Kashiwamura
Azuma Ohuchi
Masashi Furukawa
Publikationsdatum: 01.09.2008
Verlag: Springer Netherlands
Erschienen in: Natural Computing / Ausgabe 3/2008
Print ISSN: 1567-7818
Elektronische ISSN: 1572-9796
DOI: https://doi.org/10.1007/s11047-008-9076-x

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 3/2008

Toward minimum size self-assembled counters

Equivalence in template-guided recombination

Incorporation and use of modified nucleotides in aqueous DNA computing

Experimental analysis of the basic idea on the transcription-based diagnostic automata controlled by programmed molecules

A design and feasibility study of reactions comprising DNA molecular machine that walks autonomously by using a restriction enzyme

Solutions to computational problems through gene assembly

Premium Partner