A DNA computing inspired computational model
From MaRDI portal
Publication:953543
DOI10.1016/J.TCS.2008.04.013zbMATH Open1151.68017OpenAlexW1988002982MaRDI QIDQ953543FDOQ953543
Authors: Giuditta Franco, M. Margenstern
Publication date: 6 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.013
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)
Cites Work
- Membrane computing. An introduction.
- Logical Reversibility of Computation
- Small universal Turing machines
- An algorithmic analysis of DNA structure
- DNA computing. New computing paradigms.
- Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity
- Computing by floating strings
- ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON
- Title not available (Why is that?)
- Title not available (Why is that?)
- On quasi-unilateral universal Turing machines
Cited In (7)
- Title not available (Why is that?)
- Sticker DNA computer model. II: Application
- A BIonic model for exchanging waves between water and DNA
- Programmed Mutagenesis is universal
- Computing by floating strings
- A novel DNA computing model based on RecA-mediated triple-stranded DNA structure
- Algorithmic applications of XPCR
This page was built for publication: A DNA computing inspired computational model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953543)