CEC
2005
IEEE
13 years 6 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...
COLT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...