DNA code word design for DNA computing with real-time polymerase chain reaction

Problem statement: A number of DNA computing models to solve mathematical graph problem such as the Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP), and the Shortest Path Problem (SPP), have been proposed and demonstrated. Normally, the DNA sequences used for the computation should...

詳細記述

保存先:
書誌詳細
主要な著者: Ibrahim, Zuwairie, Mohamed Saaid, Muhammad Faiz, Khalid, Marzuki, Sarmin, Nor Haniza
フォーマット: 論文
出版事項: Science Publications 2009
主題:
オンライン・アクセス:http://eprints.utm.my/id/eprint/13360/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!