scholarly journals DNA computing model based on lab-on-a-chip and its application on solving the timetabling problem

2008 ◽  
Vol 18 (5) ◽  
pp. 633-637
Author(s):  
Fengyue Zhang ◽  
Bo Liu ◽  
Wenbin Liu ◽  
Qiang Zhang
Keyword(s):  
Dna Computing ◽  
Lab On A Chip ◽  
Timetabling Problem ◽  
Computing Model ◽  
Model Based

Binary Tree DNA Computing Model Based on the Insert - Remove System

2013 ◽  
Vol 411-414 ◽  
pp. 2062-2066
Author(s):  
Qing Hu Wang ◽  
Zhi Li Pei ◽  
Jie Lian ◽  
Bin Wu
Keyword(s):  
Turing Machine ◽  
Binary Tree ◽  
Dna Computing ◽  
Computing System ◽  
Automata Theory ◽  
Dna Molecule ◽  
Computing Model ◽  
Model Based ◽  
Continuous Sequence

DNA computing has the support of automata theory completely, based on the equivalent for expressing problem by DNA computing model and the double-shift language in automata theory, using a DNA molecule may encode the instantaneous description of Turing machine, and the operation of continuous sequence can be realized by the DNA molecule s operation with enzymes. Insert - Remove System is a computing system in DNA computing, designed an Binary Tree DNA computing model based on the Insert - Remove System in this paper, which can realize the insert, delete and traversal operation, and has the completeness of the theory.

A novel DNA computing model based on RecA-mediated triple-stranded DNA structure

2007 ◽  
Vol 17 (6) ◽  
pp. 708-711 ◽  
Author(s):  
Fang Gang ◽  
Zhang Shemin ◽  
Dong Yafei ◽  
Xu Jin
Keyword(s):  
Dna Computing ◽  
Dna Structure ◽  
Computing Model ◽  
Model Based

DNA Computing Model Based on Self-Assembled Nanoparticle Probes for SAT Problem

2012 ◽  
Vol 443-444 ◽  
pp. 513-517
Author(s):  
Fei Li ◽  
Jin Xu ◽  
Zheng Li
Keyword(s):  
Dna Computing ◽  
Complex Problem ◽  
Dna Computation ◽  
Widespread Application ◽  
Sat Problem ◽  
Nanoparticle Probes ◽  
Computing Model ◽  
Model Based ◽  
Complete Problems ◽  
Self Assembled

. SAT problem is one of important NP-complete problems with widespread application. In this paper, a new DNA computing model based on self-assembled nanoparticle probes is presented to solve this problem. Its essence is that all possible combinations of variables for given problem are encoded in the recognition zone of self-assembled nanoparticle probes. Major benefits of this method include vast parallelism, extraordinary information density and easy controllable operation. The result reveals the potential of DNA computation based on nanotechnology in solving complex problem.

Design of the Stack Structure Based on DNA Computing Model

2012 ◽  
Vol 263-266 ◽  
pp. 1393-1397
Author(s):  
Qing Hu Wang ◽  
Zhi Li Pei ◽  
Jie Lian ◽  
Ning Lu ◽  
Yi Nan Lu
Keyword(s):  
Data Structures ◽  
Dna Computing ◽  
Molecular Techniques ◽  
Hairpin Structure ◽  
Structure Model ◽  
Computing Model ◽  
Model Based ◽  
New Type ◽  
Dna Computer

DNA computer is a new type of computer which computing by biological molecular techniques. If DNA computer want to realize its practicability, it must be the same as a traditional computer. In order to settle the issues of representation and organizational in DNA computer, we need a reasonable data structures to effectively represent and organize the information of DNA computer. The thesis designs a stack structure model based on DNA computing, which can express limited stack constraints through hairpin structure. At the same time, it can complete the operations of entering stack and leaving stack using two different restrictive enzymes.

scholarly journals Soft-Computing Model-Based Controllers for Increased Photovoltaic Plant Efficiencies

2007 ◽  
Vol 22 (4) ◽  
pp. 873-880 ◽  
Author(s):  
Abdulhadi Varnham ◽  
Abdulrahman M. Al-Ibrahim ◽  
Gurvinder S. Virk ◽  
Djamel Azzi
Keyword(s):  
Soft Computing ◽  
Computing Model ◽  
Model Based ◽  
Photovoltaic Plant
Sign in / Sign up

Export Citation Format

Share Document