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: | Ibrahim, Zuwairie, Tsuboi, Yusei, Ono, Osamu, Khalid, Marzuki |
---|---|
Other Authors: | Zhang, J. |
Format: | Book Section |
Published: |
Springer
2005
|
Subjects: | |
Online Access: | 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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
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) -
Direct-proportional length-based DNA computing implementation for elevator scheduling problem
by: Muhammad, Mohd. Saufee, et al.
Published: (2007) -
DNA implementation of k-shortest paths computation
by: Ibrahim, Zuwairie, et al.
Published: (2005) -
Hybridization-ligation versus parallel overlap assembly : an experimental comparison of initial pool generation for direct-proportional length-based DNA computing
by: Ibrahim, Zuwairie, et al.
Published: (2006)