Sticky-free and overhang-free DNA languages
From MaRDI portal
Publication:1889765
DOI10.1007/s00236-003-0118-7zbMath1072.68044OpenAlexW2025553490MaRDI QIDQ1889765
Lila Kari, Stavros Konstantinidis, Geoff Wozniak, Elena Losseva
Publication date: 9 December 2004
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-003-0118-7
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (16)
The syntactic monoid of hairpin-free languages ⋮ On codes defined by bio-operations ⋮ Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID ⋮ BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS ⋮ Bond-free DNA language classes ⋮ Synchronization ⋮ Linear constructions for DNA codes ⋮ On properties of bond-free DNA languages ⋮ k-involution codes and related sets ⋮ INVOLUTIVELY BORDERED WORDS ⋮ Watson-Crick palindromes in DNA computing ⋮ Watson-Crick Conjugate and Commutative Words ⋮ Hairpin Structures in DNA Words ⋮ On pseudoknot-bordered words and their properties ⋮ Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
This page was built for publication: Sticky-free and overhang-free DNA languages
