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: | , , , , |
---|---|
格式: | Conference or Workshop Item |
出版: |
2005
|
主題: | |
在線閱讀: | http://eprints.utm.my/id/eprint/7185/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|