Results 1 
5 of
5
Efficient initial pool generation for weighted graph problems using parallel overlap assembly
 Preliminary Proceedings of the Tenth International Meeting on DNA Based Computers
, 2004
"... Abstract. Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, including hybridization/ligation and mix/split methods. Here, we implement and compare parallel overlap assembly wi ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Abstract. Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, including hybridization/ligation and mix/split methods. Here, we implement and compare parallel overlap assembly with the hybridization/ligation method. We applied these methods to the molecular algorithm to solve an instance of the graph problem with weighted edges. Our experimental results show that parallel overlap assembly is a better choice in terms of generation speed and material consumption than the hybridization/ligation method. Simulation of parallel overlap assembly was performed to investigate the potential and the limitation of the method. 1
Towards Solving Weighted Graph Problems DirectProportional LengthBased DNA
 Computing” Research Report, IEEE Computational Intelligence Society (CIS) Walter J Karplus Summer Research Grant
"... Biomolecular or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science, and mathematics. From DNA computing point of view, it has been proven that it is possible to solve weighted graph problems such as Traveling Salesman Problem ( ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Biomolecular or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science, and mathematics. From DNA computing point of view, it has been proven that it is possible to solve weighted graph problems such as Traveling Salesman Problem (TSP) and shortest path problem by exploiting some characteristics of DNA. Those characteristics are length, concentration, and melting temperature of DNA. In this work, we present an alternative lengthbased DNA computing approach whereby the cost of each path is encoded by the length of the oligonucleotides in a proportional way. The advantage is such that, after an initial pool generation and amplification, gel electrophoresis can be performed to separate the respective DNA duplex according to their length which directly decodes the results. For initial pool generation, parallel overlap assembly method and hybridization/ligation method are reviewed. Moreover, it is found that the parallel overlap assembly method should be employed instead of hybridization/ligation method for an efficient initial pool generation of directproportional lengthbased DNA computing. 1.
A DNA Sequence Design for Molecular Computation of HPP with Output Visualization Based on RealTime PCR
"... Abstract—Molecular computing has proved its possibility to solve weighted graph problem such as Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP) ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—Molecular computing has proved its possibility to solve weighted graph problem such as Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP)
IEEE TRANSACTIONS ON NANOBIOSCIENCE, VOL. 5, NO. 2, JUNE 2006 103 HybridizationLigation Versus Parallel Overlap
"... Previously, directproportional lengthbased DNA computing (DPLBDNAC) for solving weighted graph problems has been reported. The proposed DPLBDNAC has been successfully applied to solve the shortest path problem, which is an instance of weighted graph problems. The design and development of DPLBD ..."
Abstract
 Add to MetaCart
Previously, directproportional lengthbased DNA computing (DPLBDNAC) for solving weighted graph problems has been reported. The proposed DPLBDNAC has been successfully applied to solve the shortest path problem, which is an instance of weighted graph problems. The design and development of DPLBDNAC is important in order to extend the capability of DNA computing for solving numerical optimization problem. According to DPLBDNAC, after the initial pool generation, the initial solution is subjected to amplification by polymerase chain reaction and, finally, the output of the computation is visualized by gel electrophoresis. In this paper, however, we give more attention to the initial pool generation of DPLBDNAC. For this purpose, two kinds of initial pool generation methods, which are generally used for solving weighted graph problems, are evaluated. Those methods are hybridizationligation and parallel overlap assembly (POA). It is found that for DPLBDNAC, POA is better than that of the hybridizationligation method, in terms of population size, generation time, material usage, and efficiency, as supported by the results of actual experiments.
A Design and Implementation Method for Elevator Scheduling Problem Using DNA Computing Approach
"... We present a design and implementation method to solve an elevator scheduling problem using DNA computing in this research. DNA sequences of length directly proportional to the elevator’s traveling time are encoded to represent all possible travel path combinations based on certain initial condition ..."
Abstract
 Add to MetaCart
We present a design and implementation method to solve an elevator scheduling problem using DNA computing in this research. DNA sequences of length directly proportional to the elevator’s traveling time are encoded to represent all possible travel path combinations based on certain initial conditions such as present and destination floors, and hall calls from a floor. Parallel overlap assembly is employed for initial pool generation and polymerase chain reaction for amplification. Gel electrophoresis is then performed to separate the sequences according to its length and its image is captured to visualize the optimal path. Experimental result obtained verifies that this approach can be wellsuited to solve such realworld problem of this nature. Key words: Elevator scheduling problem, DNA computing, gel electrophoresis, optimal path.