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: | Raza, Muhammad Tayyab, Park, Sung Ha |
---|---|
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 |
Ejemplares similares
-
(2,2′-Bipyrimidine-κ(2)
N
(1),N
(1′))diiodidopalladium(II)
por: Ha, Kwang
Publicado: (2012) -
Probing the electronic properties of ternary A(n)M(3n−1)B(2n) (n = 1: A = Ca, Sr; M = Rh, Ir and n = 3: A = Ca, Sr; M = Rh) phases: observation of superconductivity
por: Takeya, Hiroyuki, et al.
Publicado: (2013) -
Turing patterns by supramolecular self-assembly of a single salphen building block
por: Escárcega-Bobadilla, Martha V., et al.
Publicado: (2022) -
(2,2′-Bipyrimidine-κ(2)
N
(1),N
(1′))bis(thiocyanato-κN)platinum(II)
por: Ha, Kwang
Publicado: (2012) -
Chalcogen‐Bonding Interactions in Telluroether Heterocycles [Te(CH(2))(m)](n) (n=1–4; m=3–7)
por: Rodewald, Marko, et al.
Publicado: (2020)