Sciweavers

CEC
2005
IEEE
13 years 5 months ago
DNA implementation of k-shortest paths computation
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...
Zuwairie Ibrahim, Yusei Tsuboi, Mohd Saufee Muhamm...
DNA
2001
Springer
125views Bioinformatics» more  DNA 2001»
13 years 8 months ago
PNA-mediated Whiplash PCR
The directed evolution of proteins, using an in vitro domainal shuffling strategy was proposed in (J. Kolkman and W. Stemmer, Nat. Biotech. 19, 423 (2001). Due to backhybridization...
John A. Rose, Russell J. Deaton, Masami Hagiya, Ak...
DNA
2004
Springer
13 years 9 months ago
Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
Ji Youn Lee, Hee-Woong Lim, Suk-In Yoo, Byoung-Tak...