Hairpin lengthening: language theoretic and algorithmic results

DOI10.1093/LOGCOM/EXS076zbMath1333.68110OpenAlexW2014204359MaRDI QIDQ3465044

Florin Manea, Carlos Martín-Vide, Victor Mitrana

Publication date: 28 January 2016

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exs076

zbMATH Keywords

DNA computingformal languageshairpin completionhairpin lengtheninghairpin structure

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

Hairpin Lengthening and Shortening of Regular Languages ⋮ Hairpin completions and reductions: semilinearity properties

This page was built for publication: Hairpin lengthening: language theoretic and algorithmic results