Hairpin Completion Versus Hairpin Reduction

DOI10.1007/978-3-540-73001-9_55zbMath1151.68420OpenAlexW1514051560MaRDI QIDQ5425355

Victor Mitrana, Florin Manea

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_55

zbMATH Keywords

DNA computingformal languageshairpin completionhairpin reductionprimitive hairpin root

Mathematics Subject Classification ID

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

Related Items (13)

Iterated Hairpin Completions of Non-crossing Words ⋮ Hairpin Lengthening and Shortening of Regular Languages ⋮ A series of algorithmic results related to the iterated hairpin completion ⋮ Language theoretical properties of hairpin formations ⋮ The pseudopalindromic completion of regular languages ⋮ Further remarks on DNA overlap assembly ⋮ On iterated hairpin completion ⋮ Bounded hairpin completion ⋮ Deciding regularity of hairpin completions of regular languages in polynomial time ⋮ Two complementary operations inspired by the DNA hairpin formation: Completion and reduction ⋮ Bounded Hairpin Completion ⋮ On the overlap assembly of strings and languages ⋮ State Complexity of Overlap Assembly

This page was built for publication: Hairpin Completion Versus Hairpin Reduction