Molecular computation approach to compete Dijkstra's algorithm
Deoxyribonucleic Acid or DNA computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. In this paper, the potential of DNA computing to compete with Dijkstra's algorithm is investigated in detail that considers the computation...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Book Section |
| 出版事項: |
Institute of Electrical and Electronics Engineers
2004
|
| 主題: | |
| オンライン･アクセス: | http://eprints.utm.my/id/eprint/12129/ http://dx.doi.org/10.1109/ASCC.2004.184830 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | Deoxyribonucleic Acid or DNA computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. In this paper, the potential of DNA computing to compete with Dijkstra's algorithm is investigated in detail that considers the computation of single source shortest path of a network or graph as a point of reference. The 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. Thus, the shortest strands representing the shortest path could be extracted. We will describe in detail in this paper the overall biochemical laboratory procedures involved during the computation. |
|---|