Sticky-free and overhang-free DNA languages
From MaRDI portal
Publication:1889765
Recommendations
- On properties of bond-free DNA languages
- Bond-free DNA language classes
- scientific article; zbMATH DE number 2087007
- scientific article; zbMATH DE number 1342113
- Toehold DNA languages are regular (extended abstract)
- DNAQL: a query language for DNA sticker complexes
- Aspects of Molecular Computing
- A formal language analysis of DNA hairpin structures
- Coding properties of DNA languages.
- Language-theoretic aspects of DNA complementarity
Cited in
(20)- Watson-Crick palindromes in DNA computing
- The syntactic monoid of hairpin-free languages
- WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
- Coding properties of DNA languages.
- On codes defined by bio-operations
- Linear constructions for DNA codes
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
- DNA Computing
- Computing maximal Kleene closures that are embeddable in a given constrained DNA language
- scientific article; zbMATH DE number 2087007 (Why is no real title available?)
- Hairpin Structures in DNA Words
- Bond-free DNA language classes
- Toehold DNA languages are regular (extended abstract)
- Watson-Crick Conjugate and Commutative Words
- k-involution codes and related sets
- BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
- Involutively bordered words
- Synchronization
- On properties of bond-free DNA languages
- On pseudoknot-bordered words and their properties
This page was built for publication: Sticky-free and overhang-free DNA languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889765)
