This paper investigates computation by linear assemblies of complex DNA tiles, which we call string tiles. By keeping track of the strands as they weave back and forth through the assembly, we show that surprisingly sophisticated calculations can be performed using linear self-assembly. Examples range from generating an addition table to providing O(1) solutions to CNF-SAT and DHPP. We classify the families of languages that can be generated by various types of DNA molecules, and establish a correspondence to the existing classes ET0Lml and ET0Lfin. Thus, linear self-assembly of string tiles can generate the output languages of finite-visit Turing Machines.
CITATION STYLE
Winfree, E., Eng, T., & Rozenberg, G. (2001). String tile models for DNA computing by self-assembly. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2054, pp. 63–88). Springer Verlag. https://doi.org/10.1007/3-540-44992-2_6
Mendeley helps you to discover research relevant for your work.