A DNA sequence design for molecular computation of HPP with output visualization based on real-time PCR
Molecular computing has proved its possibility to solve weighted graph problem such as Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP) and the Shortest Path Problem (SPP). Normally, in molecular computation, the DNA sequences used for the computation should be critically designed in...
Main Authors: | Ibrahim, Zuwairie, Kurniawan, Tri Basuki, Khalid, Marzuki |
---|---|
Format: | Article |
Published: |
2008
|
Subjects: |
Similar Items
-
A DNA sequence design for molecular computation of hamiltonian path problem with output visualization based on real-time PCR
by: Ibrahim, Zuwairie, et al.
Published: (2008) -
Implementation of ant colony system for DNA sequence optimization
by: Ibrahim, Zuwairie, et al.
Published: (2009) -
An improved in silico algorithm for output visualization of DNA computing based on real-time PCR
by: Mohamed Saaid, Muhammad Faiz, et al.
Published: (2008) -
Dnants : a software for DNA sequence design based on ant colony system
by: Kurniawan, Tri Basuki, et al.
Published: (2008) -
Implementation of binary particle swarm optimization for DNA sequence design
by: Khalid, Noor Khafifah, et al.
Published: (2009)