Sciweavers

621 search results - page 20 / 125
» DNA Computing
Sort
View
AI
2003
Springer
14 years 3 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
146views Bioinformatics» more  DNA 2004»
14 years 3 months ago
Partial Words for DNA Coding
A very basic problem in all DNA computations is finding a good encoding. Apart from the fact that they must provide a solution, the strands involved should not exhibit any undesir...
Peter Leupold
BMCBI
2006
76views more  BMCBI 2006»
13 years 10 months ago
Coloring the Mu transpososome
Background: Tangle analysis has been applied successfully to study proteins which bind two segments of DNA and can knot and link circular DNA. We show how tangle analysis can be e...
Isabel K. Darcy, Jeff Chang, Nathan Druivenga, Col...