DNA implementation of k-shortest paths computation
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonucleotides and the length of the path is directly proportional to the length of oligonucleotides. For initial pool generat...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/7185/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|