DNA Computing
From MaRDI portal
Publication:5717673
DOI10.1007/B95518zbMath1098.68043OpenAlexW4248842587MaRDI QIDQ5717673
Kalpana Mahalingam, Nataša Jonoska
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95518
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (13)
Iterated Hairpin Completions of Non-crossing Words ⋮ Watson-Crick Partial Words ⋮ Unnamed Item ⋮ Watson-Crick powers of a word ⋮ Testing DNA code words properties of regular languages ⋮ Some properties of involution binary relations ⋮ Unnamed Item ⋮ Hairpin structures defined by DNA trajectories ⋮ On properties of bond-free DNA languages ⋮ DNA Coding Using the Subword Closure Operation ⋮ Hairpin Structures in DNA Words ⋮ 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
