Sciweavers

DNA
2004
Springer
168views Bioinformatics» more  DNA 2004»
14 years 3 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
165views Bioinformatics» more  DNA 2004»
14 years 3 months ago
Computing by Observing Bio-systems: The Case of Sticker Systems
Abstract. A very common approach in chemistry and biology is to observe the progress of an experiment, and take the result of this observation as the final output. Inspired by thi...
Artiom Alhazov, Matteo Cavaliere
DNA
2004
Springer
157views Bioinformatics» more  DNA 2004»
14 years 3 months ago
Bond-Free Languages: Formalizations, Maximality and Construction Methods
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA com...
Lila Kari, Stavros Konstantinidis, Petr Sosí...
DNA
2004
Springer
152views Bioinformatics» more  DNA 2004»
14 years 3 months ago
Compact Error-Resilient Computational DNA Tiling Assemblies
John H. Reif, Sudheer Sahu, Peng Yin
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
Bioinformatics
Top of PageReset Settings