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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Book Section |
| Published: |
Springer
2005
|
| Subjects: |