Sciweavers

1793 search results - page 2 / 359
» On the Design of Codes for DNA Computing
Sort
View
AI
2003
Springer
13 years 10 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
DNA
2004
Springer
122views Bioinformatics» more  DNA 2004»
13 years 10 months ago
A Design for Cellular Evolutionary Computation by Using Bacteria
Kenichi Wakabayashi, Masayuki Yamamura
DNA
2006
Springer
100views Bioinformatics» more  DNA 2006»
13 years 6 months ago
In Search of Optimal Codes for DNA Computing
Max H. Garzon, Vinhthuy T. Phan, Sujoy Roy, Andrew...
IPPS
2006
IEEE
13 years 11 months ago
FPGA based architecture for DNA sequence comparison and database search
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
Euripides Sotiriades, Christos Kozanitis, Apostolo...
UPP
2004
Springer
13 years 10 months ago
Design, Simulation, and Experimental Demonstration of Self-assembled DNA Nanostructures and Motors
Self-assembly is the spontaneous self-ordering of substructures into superstructures driven by the selective affinity of the substructures. DNA provides a molecular scale material...
John H. Reif, Thomas H. LaBean, Sudheer Sahu, Hao ...