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: | |
|---|---|
| Other Authors: | |
| 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 |
| id |
sg-ntu-dr.10356-54896 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.10356-548962023-03-11T17:58:22Z DNA-based computing Yong, Kian Yan Shu Jian Jun School of Mechanical and Aerospace Engineering DRNTU::Engineering::Computer science and engineering::Computer applications::Computers in other systems DRNTU::Science::Mathematics::Discrete mathematics::Graph theory DRNTU::Science::Mathematics::Discrete mathematics::Theory of computation DRNTU::Science::Biological sciences::Biomathematics 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 spanning tree, maximum flow and maximum bipartite matching problems. DNA-based computing is a suitable tool for these problems because of its massive parallelism during computation. The success of a DNA-based experiment designed around the shortest path problem, global positioning system problem, reinforced and revealed the potential of this approach. DOCTOR OF PHILOSOPHY (MAE) 2013-10-22T08:30:55Z 2013-10-22T08:30:55Z 2013 2013 Thesis Yong, K. Y. (2013). DNA-based computing. Doctoral thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/54896 10.32657/10356/54896 en 144 p. application/pdf |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
NTU Library |
| collection |
DR-NTU |
| language |
English |
| topic |
DRNTU::Engineering::Computer science and engineering::Computer applications::Computers in other systems DRNTU::Science::Mathematics::Discrete mathematics::Graph theory DRNTU::Science::Mathematics::Discrete mathematics::Theory of computation DRNTU::Science::Biological sciences::Biomathematics |
| spellingShingle |
DRNTU::Engineering::Computer science and engineering::Computer applications::Computers in other systems DRNTU::Science::Mathematics::Discrete mathematics::Graph theory DRNTU::Science::Mathematics::Discrete mathematics::Theory of computation DRNTU::Science::Biological sciences::Biomathematics Yong, Kian Yan DNA-based computing |
| description |
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 spanning tree, maximum flow and maximum bipartite matching problems. DNA-based computing is a suitable tool for these problems because of its massive parallelism during computation. The success of a DNA-based experiment designed around the shortest path problem, global positioning system problem, reinforced and revealed the potential of this approach. |
| author2 |
Shu Jian Jun |
| author_facet |
Shu Jian Jun Yong, Kian Yan |
| format |
Theses and Dissertations |
| author |
Yong, Kian Yan |
| author_sort |
Yong, Kian Yan |
| title |
DNA-based computing |
| title_short |
DNA-based computing |
| title_full |
DNA-based computing |
| title_fullStr |
DNA-based computing |
| title_full_unstemmed |
DNA-based computing |
| title_sort |
dna-based computing |
| publishDate |
2013 |
| url |
https://hdl.handle.net/10356/54896 |
| _version_ |
1761781992824766464 |