DNA computation

Since Leonard Adleman successfully proposed and demonstrated the possibilities of DNA computation in 1994, many researchers has contributed to the field of DNA computation. The project aims to develop 4 different types of DNA computational algorithms corresponding to 4 different types of graphical c...

Full description

Saved in:
Bibliographic Details
Main Author: Wang, Qi Wen.
Other Authors: Shu Jian Jun
Format: Final Year Project
Language:English
Published: 2009
Subjects:
Online Access:http://hdl.handle.net/10356/16903
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-16903
record_format dspace
spelling sg-ntu-dr.10356-169032023-03-04T18:31:31Z DNA computation Wang, Qi Wen. Shu Jian Jun School of Mechanical and Aerospace Engineering DRNTU::Engineering::Bioengineering Since Leonard Adleman successfully proposed and demonstrated the possibilities of DNA computation in 1994, many researchers has contributed to the field of DNA computation. The project aims to develop 4 different types of DNA computational algorithms corresponding to 4 different types of graphical combinatorial problems based on the latest research – shortest path problem with equivalent and inequivalent edge length, shortest spanning tree and assignment problem. Each developed DNA computational algorithm comes along with independent analysis section which explains the working principle lying behind the developed algorithm. In addition, the project also demonstrates the existing silicon-based computing algorithm as well as developed DNA computational algorithm in a specified case study. The aim is to compare the two different algorithms in terms of complexity, performance and efficiency. Bachelor of Engineering 2009-05-28T09:12:57Z 2009-05-28T09:12:57Z 2009 2009 Final Year Project (FYP) http://hdl.handle.net/10356/16903 en Nanyang Technological University 113 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::Bioengineering
spellingShingle DRNTU::Engineering::Bioengineering
Wang, Qi Wen.
DNA computation
description Since Leonard Adleman successfully proposed and demonstrated the possibilities of DNA computation in 1994, many researchers has contributed to the field of DNA computation. The project aims to develop 4 different types of DNA computational algorithms corresponding to 4 different types of graphical combinatorial problems based on the latest research – shortest path problem with equivalent and inequivalent edge length, shortest spanning tree and assignment problem. Each developed DNA computational algorithm comes along with independent analysis section which explains the working principle lying behind the developed algorithm. In addition, the project also demonstrates the existing silicon-based computing algorithm as well as developed DNA computational algorithm in a specified case study. The aim is to compare the two different algorithms in terms of complexity, performance and efficiency.
author2 Shu Jian Jun
author_facet Shu Jian Jun
Wang, Qi Wen.
format Final Year Project
author Wang, Qi Wen.
author_sort Wang, Qi Wen.
title DNA computation
title_short DNA computation
title_full DNA computation
title_fullStr DNA computation
title_full_unstemmed DNA computation
title_sort dna computation
publishDate 2009
url http://hdl.handle.net/10356/16903
_version_ 1759858386673860608