DNA Computing
From MaRDI portal
Publication:5717670
DOI10.1007/b95518zbMath1098.68604MaRDI QIDQ5717670
Giancarlo Mauri, Claudio Ferretti
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
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
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, Dipole codes attractively encode glue functions, Solving the minimum bisection problem using a biologically inspired computational model, Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro, Testing DNA code words properties of regular languages, Transducer descriptions of DNA code properties and undecidability of antimorphic problems, On properties of bond-free DNA languages, Hairpin Structures in DNA Words
Uses Software