On the computational power of DNA
From MaRDI portal
Publication:5961619
DOI10.1016/S0166-218X(96)00058-3zbMath0906.68071OpenAlexW2054579370WikidataQ55895561 ScholiaQ55895561MaRDI QIDQ5961619
Jiří Sgall, Christopher Dunworth, Richard J. Lipton, Dan Boneh
Publication date: 21 April 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20)
Related Items
Improved Leader Election for Self-organizing Programmable Matter ⋮ Cyclic DNA codes over the ring \(\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2+v^2\mathbb {F}_2+uv^2\mathbb {F}_2\) ⋮ DNA computing: Arrival of biological mathematics ⋮ Unnamed Item ⋮ DNA2DNA computations: A potential “killer app”? ⋮ Leader Election and Shape Formation with Self-organizing Programmable Matter ⋮ Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\) ⋮ The emerging discipline of biomolecular computation in the US ⋮ Experimental efficiency of programmed mutagenesis ⋮ Graph splicing systems ⋮ On the computational power of DNA ⋮ Distributed transformations of Hamiltonian shapes based on line moves ⋮ Distributed transformations of Hamiltonian shapes based on line moves ⋮ A CONSTANT TIME ALGORITHM FOR DNA ADD ⋮ Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes ⋮ Molecular computing, bounded nondeterminism, and efficient recursion ⋮ Using DNA to solve the bounded Post correspondence problem ⋮ Secure hash algorithm-2 formed on DNA ⋮ Graph-theoretic formalization of hybridization in DNA sticker complexes
Cites Work
