Ibrahim, Z. (2004) DNA computing for an absolute 1-centre problem: an evolutionary approach. In: International Workshop On Biologically Inspired Computing (BIC), Tohoku, University, Sendai, Japan, 2004, n/a.
Full text not available from this repository.
Deoxyribonucleic Acid or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science and mathematics. Thus, in this paper, the possibility of DNA-based computing to solve an absolute 1-center problem by molecular manipulations is presented. This is truly the first attempt to solve such a problem by DNA-based computing approach. Since, part of the procedures involve with shortest path computation, research works on DNA computing for shortest path Traveling Salesman Problem, in short, TSP are reviewed. These approaches are studied and only the appropriate one is adapted in designing the computation procedures. This DNA-based computation is designed in such a way that every path is encoded by oligonucleotides and the path’s length is directly proportional to the length of oligonucleotides. Using these properties, gel electrophoresis is performed in order to separate the respective DNA molecules according to their length. One expectation arise from this paper is that it is possible to verify the instance absolute 1-center problem using DNA computing by laboratory experiments.
|Item Type:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||DNA computing, operation research, 1-center problem.|
|Subjects:||T Technology > TK Electrical engineering. Electronics Nuclear engineering|
|Deposited By:||Liza Porijo|
|Last Modified:||28 Dec 2011 15:54|
Repository Staff Only: item control page