Name
Title | ||
|---|---|---|
Efficient initial pool generation for weighted graph problems using parallel overlap assembly |
Abstract | ||
|---|---|---|
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initial-pool 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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/11493785_19 | DNA |
Keywords | Field | DocType |
generation speed,efficient initial pool generation,dna computing algorithm,ligation method,better choice,initial-pool generation,weighted graph problem,graph problem,initial pool,split method,combinatorial generation,dna computing | Graph problem,Graph,Computer science,Algorithm,Hamiltonian path problem,Travelling salesman problem,Mathematical problem,DNA computing | Conference |
Volume | ISSN | ISBN |
3384 | 0302-9743 | 3-540-26174-5 |
Citations | PageRank | References |
9 | 0.93 | 3 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ji Youn Lee | 1 | 29 | 3.24 |
| Hee-Woong Lim | 2 | 18 | 2.30 |
| Suk-In Yoo | 3 | 18 | 2.30 |
| Byoung-Tak Zhang | 4 | 1571 | 158.56 |
| Tai Hyun Park | 5 | 32 | 4.34 |