DNA computing, sticker systems, and universality
From MaRDI portal
Publication:1130166
DOI10.1007/S002360050125zbMath0904.68127OpenAlexW1995435794MaRDI QIDQ1130166
Lila Kari, Arto Salomaa, Grzegorz Rozenberg, Gheorghe Păun, Sheng Yu
Publication date: 8 November 1998
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360050125
Related Items (12)
Computing with viruses ⋮ String assembling systems: comparison to sticker systems and decidability ⋮ Computing by observing: simple systems and simple observers ⋮ Solving two-dimensional cutting stock problem via a DNA computing algorithm ⋮ Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity ⋮ Making all spanning tree problem based on sticker model ⋮ The emerging discipline of biomolecular computation in the US ⋮ A CONSTANT TIME ALGORITHM FOR DNA ADD ⋮ Some Remarks on Superposition Based on Watson-Crick-Like Complementarity ⋮ Theory of tailor automata ⋮ Watson–Crick Jumping Finite Automata ⋮ Efficient DNA sticker algorithms for NP-complete graph problems
This page was built for publication: DNA computing, sticker systems, and universality
