4 search results - page 1 / 1 » DNA implementation of k-shortest paths computation |
CEC
2005
IEEE
13 years 7 months ago
2005
IEEE
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
ICNC
2005
Springer
13 years 10 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
EC
1998
13 years 4 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
tigate the role of nondeterminism in Winfree's abstract Tile Assembly Model (aTAM), which was conceived to model artificial molecular self-assembling systems constructed from...