A study on lower bound of direct proportional length-based DNA computing for shortest path problem
Previously, we proposed a direct proportional length-based DNA computing approach for weighted graph problem. The approach has been proposed essentially to overcome the shortcoming of constant proportional length-based DNA computing approach. However, by using this approach, the minimum weight of ed...
保存先:
| 主要な著者: | , , , |
|---|---|
| その他の著者: | |
| フォーマット: | Book Section |
| 出版事項: |
Springer
2005
|
| 主題: | |
| オンライン･アクセス: | http://eprints.utm.my/id/eprint/7164/ https://link.springer.com/chapter/10.1007/978-3-540-30497-5_12 http://dx.doi.org/10.1007/b104566 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|