DNA Computing
From MaRDI portal
Publication:5717673
DOI10.1007/b95518zbMath1098.68043MaRDI 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
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Unnamed Item, Watson-Crick Partial Words, DNA Coding Using the Subword Closure Operation, Unnamed Item, Watson-Crick powers of a word, Computing maximal Kleene closures that are embeddable in a given subword-closed language, Some properties of involution binary relations, Testing DNA code words properties of regular languages, On properties of bond-free DNA languages, Hairpin structures defined by DNA trajectories, Iterated Hairpin Completions of Non-crossing Words, Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language, Hairpin Structures in DNA Words