Accelerating DNA Computing via PLP-qPCR Answer Read out to Solve Traveling Salesman Problems
An asymmetric, fully-connected 8-city traveling salesman problem (TSP) was solved by DNA computing using the ordered node pair abundance (ONPA) approach through the use of pair ligation probe quantitative real time polymerase chain reaction (PLP-qPCR). The validity of using ONPA to derive the optima...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
IntechOpen
2020
|
| Materias: | |
| Acceso en línea: | https://www.intechopen.com/chapters/71501 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|