Superposition based on Watson-Crick-like complementarity
From MaRDI portal
Publication:2432544
DOI10.1007/s00224-004-1175-1zbMath1103.68064OpenAlexW2165177622MaRDI QIDQ2432544
Vincenzo Manca, Victor Mitrana, Paolo Bottoni, Anna Labella
Publication date: 25 October 2006
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-004-1175-1
Related Items
Hairpin Lengthening and Shortening of Regular Languages ⋮ A series of algorithmic results related to the iterated hairpin completion ⋮ Hairpin completions and reductions: semilinearity properties ⋮ Further remarks on DNA overlap assembly ⋮ Bounded hairpin completion ⋮ Two complementary operations inspired by the DNA hairpin formation: Completion and reduction ⋮ Bounded Hairpin Completion ⋮ Some Remarks on Superposition Based on Watson-Crick-Like Complementarity ⋮ Self-assembly of strings and languages ⋮ On the overlap assembly of strings and languages ⋮ On some algorithmic problems regarding the hairpin completion
This page was built for publication: Superposition based on Watson-Crick-like complementarity