DNA Computing
From MaRDI portal
Publication:5717670
DOI10.1007/B95518zbMath1098.68604OpenAlexW4248842587MaRDI 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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (11)
Solving the minimum bisection problem using a biologically inspired computational model ⋮ Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro ⋮ Unnamed Item ⋮ Watson-Crick powers of a word ⋮ Testing DNA code words properties of regular languages ⋮ Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ Dipole codes attractively encode glue functions ⋮ 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 subword-closed language
Uses Software
This page was built for publication: DNA Computing
