Literature DB >> 23101001

Multiplying with DNA.

Gang Wu1, Nadrian C Seeman.   

Abstract

A functional machine is not only an assembly of parts, but also an assembly of processes. The processing of each part must obey laws that respect to the property of this part. For example, building any kind of computer entails selecting appropriate components and assembling their properties to function in computation. Here, we describe computation using a DNA strand as the basic unit and we have used this unit to achieve the function of multiplication. We exploit the phenomenon of DNA hybridization, in which each strand can represent two individual units that can pair to form a single unit. We represent the numbers we multiply in binary, with different lengths representing each digit present in the number. In principle, all combinations of the numbers will be present in solution. Following hybridization, there is present a collection of duplex molecules that are tailed by single-stranded ends. These intermediates are converted to fully duplex molecules by filling in the ends with DNA polymerase. The lengths that are present represent the digits that are present, and they may be separated by denaturing PAGE. The results give a series of bands for each power of two. The number of bands in the size domain for a particular power of two is converted to binary and the sum of all present bands is then added together. Experimentally, the result of this process always yields the correct answer.

Year:  2006        PMID: 23101001      PMCID: PMC3479220          DOI: 10.1007/s11047-006-9006-8

Source DB:  PubMed          Journal:  Nat Comput        ISSN: 1567-7818            Impact factor:   1.690


  11 in total

1.  Molecular computation by DNA hairpin formation.

Authors:  K Sakamoto; H Gouzu; K Komiya; D Kiga; S Yokoyama; T Yokomori; M Hagiya
Journal:  Science       Date:  2000-05-19       Impact factor: 47.728

2.  Molecular computation: RNA solutions to chess problems.

Authors:  D Faulhammer; A R Cukras; R J Lipton; L F Landweber
Journal:  Proc Natl Acad Sci U S A       Date:  2000-02-15       Impact factor: 11.205

3.  Solution of a 20-variable 3-SAT problem on a DNA computer.

Authors:  Ravinderjit S Braich; Nickolas Chelyapov; Cliff Johnson; Paul W K Rothemund; Leonard Adleman
Journal:  Science       Date:  2002-03-14       Impact factor: 47.728

4.  De novo design of sequences for nucleic acid structural engineering.

Authors:  N C Seeman
Journal:  J Biomol Struct Dyn       Date:  1990-12

5.  PNA hybridizes to complementary oligonucleotides obeying the Watson-Crick hydrogen-bonding rules.

Authors:  M Egholm; O Buchardt; L Christensen; C Behrens; S M Freier; D A Driver; R H Berg; S K Kim; B Norden; P E Nielsen
Journal:  Nature       Date:  1993-10-07       Impact factor: 49.962

6.  Making DNA add.

Authors:  F Guarnieri; M Fliss; C Bancroft
Journal:  Science       Date:  1996-07-12       Impact factor: 47.728

7.  Forks and combs and DNA: the synthesis of branched oligodeoxyribonucleotides.

Authors:  T Horn; M S Urdea
Journal:  Nucleic Acids Res       Date:  1989-09-12       Impact factor: 16.971

8.  DNA solution of hard computational problems.

Authors:  R J Lipton
Journal:  Science       Date:  1995-04-28       Impact factor: 47.728

9.  Molecular computation of solutions to combinatorial problems.

Authors:  L M Adleman
Journal:  Science       Date:  1994-11-11       Impact factor: 47.728

10.  A new general approach for the simultaneous chemical synthesis of large numbers of oligonucleotides: segmental solid supports.

Authors:  R Frank; W Heikens; G Heisterberg-Moutsis; H Blöcker
Journal:  Nucleic Acids Res       Date:  1983-07-11       Impact factor: 16.971

View more

北京卡尤迪生物科技股份有限公司 © 2022-2023.