Cargando…
M-State and N-Color (M–N = 1–1, 2–1, and 1–2) Turing Algorithms Demonstrated via DNA Self-Assembly
[Image: see text] The fast and extensive generation of patterns using specific algorithms is a major challenge in the field of DNA algorithmic self-assembly. Turing machines (TMs) are simple computable machines that execute certain algorithms using carefully designed logic gates. We investigate Turi...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
American Chemical Society
2023
|
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10157656/ https://www.ncbi.nlm.nih.gov/pubmed/37151505 http://dx.doi.org/10.1021/acsomega.2c08017 |