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: | Ibrahim, Zuwairie, Tsuboi, Yusei, Ono, Osamu, Khalid, Marzuki |
---|---|
Other Authors: | Zhang, J. |
Format: | Book Section |
Published: |
Springer
2005
|
Subjects: |
Similar Items
-
Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem
by: Ibrahim, Zuwairie, et al.
Published: (2007) -
Hybrid concentration-controlled direct-proportional length-based DNA computing for numerical optimization of the shortest path problem
by: Ibrahim, Zuwairie, et al.
Published: (2006) -
DNA implementation of k-shortest paths computation
by: Ibrahim, Zuwairie, et al.
Published: (2005) -
Parallel overlap assembly for initial pool generation of direct-proportional length-based DNA
by: Ibrahim, Zuwairie, et al.
Published: (2005) -
Experimental comparison of initial pool generation for direct-proportional length-based DNA computing
by: Ibrahim, Zuwairie, et al.
Published: (2007)