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...

Full description

Saved in:
Bibliographic Details
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!