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...
Saved in:
| Main Authors: | , , , |
|---|---|
| 其他作者: | |
| 格式: | 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 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|