Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Solutions of Shortest Path Problems by Concentration Control
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
NACST/Seq: A Sequence Design System with Multiobjective Optimization
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
DNA-like genomes for evolution in silico
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Padlock probe-mediated qRT-PCR for DNA computing answer determination
Natural Computing: an international journal
DNA computing for complex scheduling problem
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
A study on lower bound of direct proportional length-based DNA computing for shortest path problem
CIS'04 Proceedings of the First international conference on Computational and Information Science
BioADIT'06 Proceedings of the Second international conference on Biologically Inspired Approaches to Advanced Information Technology
Efficient initial pool generation for weighted graph problems using parallel overlap assembly
DNA'04 Proceedings of the 10th international conference on DNA computing
Hi-index | 0.00 |
We propose an encoding method of numerical data in DNA using temperature gradient. We introduce melting temperature (Tm) for this purpose. Melting temperature is a unique characteristic to manipulate the hybridization and denaturation processes that used in the key steps in DNA computing such as the solution generation step and the amplification step. DNA strands of lower melting temperature tend to denature with ease and also be easily amplified by slightly modified polymerase chain reaction, called denaturation temperature gradient polymerase chain reaction. Using these properties, we implement a local search molecular algorithm using temperature gradient, which is contrasted to conventional exhaustive search molecular algorithms. The proposed methods are verified by solving an instance of the travelling salesman problem. We could effectively amplify the correct solution and the use of temperature gradient made the detection of solutions easier.