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...
保存先:
主要な著者: | , , , , |
---|---|
フォーマット: | Conference or Workshop Item |
出版事項: |
2005
|
主題: | |
オンライン・アクセス: | http://eprints.utm.my/id/eprint/7185/ |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|