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...
| Main Authors: | , , , |
|---|---|
| Andre forfattere: | |
| Format: | Book Section |
| Udgivet: |
Springer
2006
|
| Fag: |