Sciweavers

202 search results - page 16 / 41
» A Sticker-Based Model for DNA Computation
Sort
View
RECOMB
2002
Springer
14 years 8 months ago
DNA sequence evolution with neighbor-dependent mutation
We introduce a model of DNA sequence evolution which can account for biases in mutation rates that depend on the identity of the neighboring bases. An analytic solution for this c...
Peter F. Arndt, Christopher B. Burge, Terence Hwa
DNA
2005
Springer
132views Bioinformatics» more  DNA 2005»
14 years 1 months ago
DNA Recombination by XPCR
The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial generation of libraries. In this paper a new method is proposed for generating a initial p...
Giuditta Franco, Vincenzo Manca, Cinzia Giagulli, ...
DNA
2007
Springer
159views Bioinformatics» more  DNA 2007»
14 years 1 months ago
Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications
While algorithmic DNA self-assembly is, in theory, capable of forming complex patterns, its experimental demonstration has been limited by significant assembly errors. In this pa...
Urmi Majumder, Thomas H. LaBean, John H. Reif
IPPS
2009
IEEE
14 years 2 months ago
Accelerating error correction in high-throughput short-read DNA sequencing data with CUDA
Emerging DNA sequencing technologies open up exciting new opportunities for genome sequencing by generating read data with a massive throughput. However, produced reads are signif...
Haixiang Shi, Bertil Schmidt, Weiguo Liu, Wolfgang...
DNA
2009
Springer
173views Bioinformatics» more  DNA 2009»
14 years 2 months ago
Time-Complexity of Multilayered DNA Strand Displacement Circuits
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
Georg Seelig, David Soloveichik