Data processing: measuring – calibrating – or testing – Measurement system in a specific environment – Biological or biochemical
Reexamination Certificate
2011-06-28
2011-06-28
Clow, Lori A (Department: 1631)
Data processing: measuring, calibrating, or testing
Measurement system in a specific environment
Biological or biochemical
C435S091200, C435S006120
Reexamination Certificate
active
07970547
ABSTRACT:
A device, system and method for molecular computing which not only includes a suitable, renewable power source, but actually is able to receive power through the performance of the computations themselves. The molecular computing machine of the present invention actually employs the free-energy difference between its input and output to accomplish a computation, preferably by using its input DNA molecule as a partial source of energy, or alternatively by using the input DNA molecule as the sole source of energy. This molecular finite automaton preferably transforms an input DNA molecule into an output DNA molecule by digesting the input as it computes.
REFERENCES:
patent: 4965188 (1990-10-01), Mullis et al.
patent: 5804373 (1998-09-01), Schweitzer et al.
patent: 6197563 (2001-03-01), Erlich et al.
patent: 6266569 (2001-07-01), Shapiro et al.
patent: 6514736 (2003-02-01), Erlich et al.
patent: 2002/0119458 (2002-08-01), Suyama et al.
Barany (PNAS (1991) vol. 88, pp. 189-193.
Adleman “Molecular Computation of Solutions to Combinatorial Problems”, Science, 266(5187): 1021-1024, 1994.
Benenson et al. “Programmable and Autonomous Computing Machine Made of Biomolecules”, Nature, 414: 430-434, 2001.
Bennett “The Thermodynamics of Computation—, A Review”, International Journal of Theoretical Physics, 21(12): 905-940, 1982.
Keyes et al. “Minimal Energy Dissipation in Logic”, IBM J. Res. Develop., 14: 152-156, 1970.
Bennett “Logical Reversibility of Computation”, IBM J. Res. Develop., 17: 525-532, 1973.
Benioff “Quantum Mechanical Models of Turing Machines That Dissipate No Energy”, Physical Review Letters, 48(23): 1581-1585, 1982.
Zurek “Thermodynamic Cost of Computation, Algorithmic Complexity and the Information Metric”, Nature, 341: 119-124, 1989.
Li et al. “Reversibility and Adiabatic Computation: Trading Time and Space for Energy”, Proceedings: Mathematical, Physical and Energineering Sciences, 452(1947): 769-789, 1996.
Rothemund “A DNA and Restriction Enzyme Implementation of Turing Machines”, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 27: 75-119, 1996.
Winfree et al. “Design and Self-Assembly of Two-Dimensional DNA Crystals”, Nature, 394: 539-544, 1998.
Khodor et al. “Design and Implementation of Computational System Based on Programmed Mutagenesis”, BioSystems, 52(1-3): 93-97, 1999.
Smith “DNA Computers in Vitro and Vivo”, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 27: 121-185, 1996.
Garzon et al. “In Vitro Implementation of Finite-State Machines”, Automata Implementation: Lecture Notes in Computer Science, 1436: 56-74, 1998.
Lipton “DNA Solution of Hard Computational Problems”, Science, 268(5210): 542-545, 1995.
Quyang et al. “DNA Solution of the Maximal Clique Problem”, Science, 278(5337): 446-449, 1997.
Liu et al. “DNA Computing on Surfaces”, Nature, 403: 175-179, 2000.
Faulhammer et al. “Molecular Computation: RNA Solutions to Chess Problems”, Proc. Natl. Acad. Sci. USA, 97(4): 1385-1389, 2000.
Sakamoto et al. “State Transitions by Molecules”, BioSystems, 52: 81-91, 1999.
Mao et al. “Logical Computation Using Algorithmic Self-Assembly of DNA Triple-Crossover Molecules”, Nature, 407: 493-496, 2000.
Braich et al. “Solution of A 20-Variable 3-SAT Problem on A DNA Computer”, Science, 296: 499-502, 2002.
Lehn “Toward Complex Matter: Supramolecular Chemistry and Self-Organization”, Proc. Natl. Acad. Sci. USA, 99(8): 4763-4768, 2002.
Stojanovic et al. “A Deoxyribozyme-Based Molecular Automation”, Nature Biotechnology, 21(9): 1069-1074, 2003.
Benenson et al. “An Autonomous Molecular Computer for Logical Control of Gene Expression”, Nature, 429: 423-429, 2004.
Adar et al. “Stochastic Computing With Biomolecular Automata”, Proc. Natl. Acad. Sci. USA, 101(27): 9960-9965, 2004.
Soloveichik “The Computational Power of Benenson Automata”, Eprint ARXIV, p. 1-22, 2004.
Jonoska et al. “Transducers With Programmable Input by DNA Self-Assembly”, Molecular Computing, LNCS, 2950: 219-240, 2004.
Zhang et al. “Development of Nano-Scale DNA Computing Devices”, Current Nanoscience, 1: 89-9, 2005.
Braich et al, DNA Computing, 6th International Workshop on DNA-Based Computers, DNA 2000, Leiden, The Netherlands, Jun. 13-17, Lecture Notes in Computer Science 2054: 27-42.
Adar Rivka
Benenson Yaakov
Paz-Elizur Tamar
Shapiro Ehud
Clow Lori A
Graeser Gvorah
Graeser Associates Internation
Yeda Research and Development Co. Ltd.
LandOfFree
Programmable and autonomous computing machine made of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Programmable and autonomous computing machine made of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Programmable and autonomous computing machine made of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2656914