DNA-based computing
DNA-based computing provides an alternative to solving optimization problems in graph theory. In this research, it is shown how DNA-based computing is used to find solutions to these problems, which involve logical thinking and are often NP hard complete. These include the shortest path, shortest sp...
Saved in:
Main Author: | Yong, Kian Yan |
---|---|
Other Authors: | Shu Jian Jun |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/54896 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Random walks in distributed networks and their applications
by: Anisur Rahaman Molla
Published: (2014) -
Some constructions of (t, m, s)-nets with improved parameters
by: Ling, San, et al.
Published: (2013) -
Dimensional crossover in spin-1 Heisenberg antiferromagnets : a quantum Monte Carlo study
by: Wierschem, Keola, et al.
Published: (2013) -
Ultralow-threshold two-photon pumped amplified spontaneous emission and lasing from seeded CdSe/CdS nanorod heterostructures
by: Xing, Guichuan, et al.
Published: (2013) -
On NP-hardness of the clique partition : independence number gap recognition and related problems
by: Busygin, Stanislav., et al.
Published: (2012)