Hybrid concentration-controlled direct-proportional length-based DNA computing for numerical optimization of the shortest path problem
DNA computing often makes use of hybridization, whether for vastly generating the initial candidate answers or amplification by using polymerase chain reaction (PCR). The main idea behind DNA computing approaches for solving weighted graph problems is that if the degree of hybridization can be contr...
Saved in:
Main Authors: | Ibrahim, Zuwairie, Tsuboi, Yusei, Ono, Osamu, Khalid, Marzuki |
---|---|
Other Authors: | Ijspeert, A. J. |
Format: | Book Section |
Published: |
Springer
2006
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/7188/ https://link.springer.com/chapter/10.1007%2F11613022_18 |
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) -
A study on lower bound of direct proportional length-based DNA computing for shortest path problem
by: Ibrahim, Zuwairie, et al.
Published: (2005) -
DNA implementation of k-shortest paths computation
by: Ibrahim, Zuwairie, et al.
Published: (2005) -
Direct-proportional length-based DNA computing implementation for elevator scheduling problem
by: Muhammad, Mohd. Saufee, et al.
Published: (2007) -
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)