Please use this identifier to cite or link to this item:
Title: DNA computation
Authors: Wang, Qi Wen.
Keywords: DRNTU::Engineering::Bioengineering
Issue Date: 2009
Abstract: 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.
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:MAE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
  Restricted Access
1.6 MBAdobe PDFView/Open

Page view(s)

checked on Sep 26, 2020


checked on Sep 26, 2020

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.