Sciweavers

DNA
2004
Springer
168views Bioinformatics» more  DNA 2004»
15 years 7 months ago
Biomolecular Implementation of Computing Devices with Unbounded Memory
We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down...
Matteo Cavaliere, Natasa Jonoska, Sivan Yogev, Ron...
DNA
2004
Springer
15 years 7 months ago
DNA Hybridization Catalysts and Catalyst Circuits
Practically all of life’s molecular processes, from chemical synthesis to replication, involve enzymes that carry out their functions through the catalysis of metastable fuels in...
Georg Seelig, Bernard Yurke, Erik Winfree
DNA
2004
Springer
132views Bioinformatics» more  DNA 2004»
15 years 7 months ago
Error Free Self-assembly Using Error Prone Tiles
DNA self-assembly is emerging as a key paradigm for nano-technology, nano-computation, and several related disciplines. In nature, DNA self-assembly is often equipped with explicit...
Ho-Lin Chen, Ashish Goel
DNA
2004
Springer
146views Bioinformatics» more  DNA 2004»
15 years 7 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
DNA
2004
Springer
102views Bioinformatics» more  DNA 2004»
15 years 5 months ago
Minimum Basin Algorithm: An Effective Analysis Technique for DNA Energy Landscapes
To design DNA nano-machines or analyze DNA molecular reactions, it is important to be able to predict the energy landscape of molecular structures and the energy barrier of a trans...
Mitsuhiro Kubota, Masami Hagiya
Bioinformatics
Top of PageReset Settings