Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiu, Qian.en_US
dc.description74 p.en_US
dc.description.abstractMost real life problems involve logical thinking and are often NP (Nondeterministic Polynomial time) problems. These problems become too complex and time consuming to solve when their size and number of parameters increase. Even with modern computers, solving these problems pose great challenges. DNA (Deoxyribonucleic acid) computing provides an alternative solution for these problems. This is especially useful because of the massive parallelism of DNA computing methods during computation. This allows NP problems to be solved in a relatively short amount of time accurately. However, the algorithms used in recent research to solve these problems are restricted to one parameter. For most problems, many parameters are involved. In this research, a DNA computing algorithm which is able to solve problemconsisting of several individual sub-problems or parameters is introduced. The algorithm is successfully used to solve the Tian Ji horse racing problem. Simulated results show the feasibility of this algorithm. Successful implementation of DNA computing for Tian Ji horse racing problem provides a new dimension to solving bigger problems with more parameters.en_US
dc.rightsNanyang Technological Universityen_US
dc.titleDNA-based solutions to Tian Ji's horse racing problemen_US
dc.contributor.supervisorShu Jian Junen_US
dc.contributor.schoolSchool of Mechanical and Aerospace Engineeringen_US
dc.description.degreeMaster of Science (Biomedical Engineering)en_US
item.fulltextWith Fulltext-
Appears in Collections:MAE Theses
Files in This Item:
File Description SizeFormat 
  Restricted Access
6.86 MBAdobe PDFView/Open

Page view(s)

Updated on Jul 22, 2024


Updated on Jul 22, 2024

Google ScholarTM


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