DNA-based computing

• Main Author: Yong, Kian Yan
• Other Authors: Shu Jian Jun
• Format: Theses and Dissertations
• Language: English
• Published: 2013
• Subjects: 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
• Online Access: https://hdl.handle.net/10356/54896
• Institution: Nanyang Technological University

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.