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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| 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 |
| Summary: | 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. |
|---|