The computational power of Benenson automata
From MaRDI portal
Publication:2575082
DOI10.1016/j.tcs.2005.07.027zbMath1079.68055OpenAlexW2010274993WikidataQ59329024 ScholiaQ59329024MaRDI QIDQ2575082
Erik Winfree, David Soloveichik
Publication date: 5 December 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://authors.library.caltech.edu/22759/
computational complexityDNA computingcircuit complexitymolecular computingbranching programsrestriction enzymes
Formal languages and automata (68Q45) Medical applications (general) (92C50) Protein sequences, DNA sequences (92D20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Exploring programmable self-assembly in non-DNA based molecular computing ⋮ Analysis and design of molecular machines ⋮ Isothermal reactivating whiplash PCR for locally programmable molecular computation ⋮ Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes ⋮ Theory of tailor automata ⋮ Graph-theoretic formalization of hybridization in DNA sticker complexes
Cites Work