Please use this identifier to cite or link to this item:
|Title:||DNA-based computing||Authors:||Yong, Kian Yan.||Keywords:||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::Mathematics::Applied mathematics::Complex systems
|Issue Date:||2013||Source:||Yong, K. Y. (2013). DNA-based computing. Doctoral thesis, Nanyang Technological University, Singapore.||Abstract:||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.||URI:||http://hdl.handle.net/10356/54896||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||MAE Theses|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.