Results 1 
9 of
9
Design of an autonomous DNA nanomechanical device capable of universal computation and universal translational motion
, 2004
"... Abstract. Intelligent nanomechanical devices that operate in an autonomous fashion are of great theoretical and practical interest. Recent successes in building large scale DNA nanostructures, in constructing DNA mechanical devices, and in DNA computing provide a solid foundation for the next step ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
Abstract. Intelligent nanomechanical devices that operate in an autonomous fashion are of great theoretical and practical interest. Recent successes in building large scale DNA nanostructures, in constructing DNA mechanical devices, and in DNA computing provide a solid foundation for the next step forward: designing autonomous DNA mechanical devices capable of arbitrarily complex behavior. One prototype system towards this goal can be an autonomous DNA mechanical device capable of universal computation, by mimicking the operation of a universal Turing machine. Building on our prior theoretical design and prototype experimental construction of an autonomous unidirectional DNA walking device moving along a linear track, we present here the design of a nanomechanical DNA device that autonomously mimics the operation of a 2state 5color universal Turing machine. Our autonomous nanomechanical device, called an Autonomous DNA Turing Machine (ADTM), is thus capable of universal computation and hence complex translational motion, which we define as universal translational motion. 1
DNA Computing
"... Molecular computing is computation done at the molecular scale. DNA computing is a class of molecular computing that does computation by the use of reactions involving DNA molecules. DNA computing has been by far the most successful (in scale and complexity of the computations and molecular assembli ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Molecular computing is computation done at the molecular scale. DNA computing is a class of molecular computing that does computation by the use of reactions involving DNA molecules. DNA computing has been by far the most successful (in scale and complexity of the computations and molecular assemblies done) of all known approaches to molecular computing, perhaps due in part to the very well established biotechnology and biochemistry on which its experimental demonstration relies, as well as the frequent teaming of scientists in the field with multiple essential disciplines including chemistry, biochemistry, physics, material science, and computer science. This chapter surveys the field of DNA computing. It begins in Section 1 with a discussion of the underlying principles, including motivation for molecular and DNA computations (Section 1.1), brief overviews of DNA
Solving the Maximum Independent Set Problem based on Molecule Parallel Supercomputing
"... Abstract: The maximum independent set Problem is to find a biggest vertex independent set in a given undirected graph. It is a vitally important NP problem in graph theory and applied mathematics, having numerous real life applications. It can be difficultly solved by the electronic computer in expo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: The maximum independent set Problem is to find a biggest vertex independent set in a given undirected graph. It is a vitally important NP problem in graph theory and applied mathematics, having numerous real life applications. It can be difficultly solved by the electronic computer in exponential level time. Simultaneity in previous studies DNA molecular computation usually be used to solve NPcomplete continuous path search problems (for example HPP, traveling salesman problem), rarely for NP problems with discrete vertex or path solutions result, such as the maximum independent set problem, graph coloring problem and so on. In this paper, we present a new algorithm for solving the maximum independent set problem with DNA molecular operations. For an undirected graph with n vertices, We reasonably design fixed length DNA strands representing the vertices and edges of graph, take appropriate steps and get the solutions of the problem in proper length range using O(n 2) time. We extend the application of DNA molecular operations and simultaneity simplify the complexity of the computation.
Superluminal transmission is possible from now on
, 2002
"... It is known that superluminal transmission of information and energy contradicts Einstein’s relativity. Here we announce an unusual TOE called ’nature theory ’ in which impossible things become possible. We present the scheme of an apparatus for sending signals over arbitrarily large distances with ..."
Abstract
 Add to MetaCart
(Show Context)
It is known that superluminal transmission of information and energy contradicts Einstein’s relativity. Here we announce an unusual TOE called ’nature theory ’ in which impossible things become possible. We present the scheme of an apparatus for sending signals over arbitrarily large distances with speeds arbitrarily exceeding the light speed in vacuum. Introducing the notions of effective speed and reliability of superluminal devices, we encourage experimenters to set and break world records in this new branch. At the same time we outline a mechanism (termed ’particle encapsulation’) owing to which nature theory remains Lorentz invariant and so consistent with experiments. From among other numerous applications of nature theory we discuss briefly local antigravitation and new computing machines, called ’vacuum computers’, applying ’cat principle’. They are of great interest because should enable humans to overcome the GödelTuring barrier. 12 pages, 1 figure 1 In the celebrated 1905 paper [1] Einstein changed our approach to time and laid down a new foundation for all modern physical science. One of the
VIRUS DETECTION WITH DNA LOGIC TAGS By
, 2007
"... This work would not have been possible without the guidance of my two advisors ..."
Abstract
 Add to MetaCart
This work would not have been possible without the guidance of my two advisors
Rational design of DNA sequences for
, 2004
"... nanotechnology, microarrays and molecular computers using Eulerian graphs ..."
Abstract
 Add to MetaCart
nanotechnology, microarrays and molecular computers using Eulerian graphs
SYNBIOLOGY An Analysis of Synthetic Biology Research in Europe and North America European Commission FP6 Reference:
"... ..."
(Show Context)
DNA BASED SELFASSEMBLY AND NANODEVICE: THEORY AND PRACTICE
, 2005
"... The construction of complex systems at the 1 100 nanometer (1 nanometer = ¡£¢¥¤§ ¦ meter) scale is a key challenge in current nanoscience. This challenge can be most effectively addressed by the “bottomup ” nanoconstruction methodology based on selfassembly, a process in which substructures au ..."
Abstract
 Add to MetaCart
The construction of complex systems at the 1 100 nanometer (1 nanometer = ¡£¢¥¤§ ¦ meter) scale is a key challenge in current nanoscience. This challenge can be most effectively addressed by the “bottomup ” nanoconstruction methodology based on selfassembly, a process in which substructures autonomously associate with each other to form superstructures driven by the selective affinity of the substructures. DNA, with its immense information encoding capacity and well defined WatsonCrick complementarity, has recently emerged as an excellent material for constructing selfassembled nanostructures. In this dissertation, we study four closely related aspects of DNA based selfassembly and nanodevices: complexity of selfassembly, faulttolerant selfassembly, DNA robotics devices, and DNA computing devices. Complexity of selfassembly. We establish a framework that models assemblies resulting from the cooperative effects of repulsion and attraction forces in a general setting of