DNA Computing
From MaRDI portal
Publication:5494352
DOI10.1007/B136914zbMath1116.68457OpenAlexW4248466611MaRDI QIDQ5494352
Lila Kari, Petr Sosík, Stavros Konstantinidis
Publication date: 19 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136914
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (4)
Hairpin Structures in DNA Words ⋮ Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences ⋮ Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language ⋮ Computing maximal Kleene closures that are embeddable in a given subword-closed language
This page was built for publication: DNA Computing
