Implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly
In this paper, an in vitro implementation of DNA computing for finding k-shortest paths of a weighted graph is reported. After the initial solution is subjected to amplification by polymerase chain reaction, k-shortest paths are visualized by polyacrylamide gel electrophoresis and the selection can...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
ICIC International
2006
|
| Subjects: |