The computational power of Benenson automata
From MaRDI portal
Publication:2575082
DOI10.1016/j.tcs.2005.07.027zbMath1079.68055WikidataQ59329024 ScholiaQ59329024MaRDI QIDQ2575082
David Soloveichik, Erik Winfree
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 complexity; DNA computing; circuit complexity; molecular computing; branching programs; restriction enzymes
68Q45: Formal languages and automata
92C50: Medical applications (general)
92D20: Protein sequences, DNA sequences
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Isothermal reactivating whiplash PCR for locally programmable molecular computation, Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes
Cites Work