On properties of bond-free DNA languages

DOI10.1016/j.tcs.2004.12.032zbMath1080.68036OpenAlexW1983239548MaRDI QIDQ1779300

Petr Sosík, Lila Kari, Stavros Konstantinidis

Publication date: 1 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.032

zbMATH Keywords

DNA computingBinary word operationDNA language

Mathematics Subject Classification ID

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

Related Items (9)

FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION ⋮ Codes defined by multiple sets of trajectories ⋮ Algebraic properties of substitution on trajectories ⋮ On codes defined by bio-operations ⋮ On the complexity and decidability of some problems involving shuffle ⋮ Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ Bond-free DNA language classes ⋮ Strand algebras for DNA computing ⋮ Hairpin structures defined by DNA trajectories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deletion along trajectories
• DNA sequence design using templates
• Shuffle on trajectories: Syntactic constraints
• On language equations with invertible operations
• Coding properties of DNA languages.
• Language equations, maximality and error-detection
• Aspects of shuffle and deletion on trajectories
• Sticky-free and overhang-free DNA languages
• DNA Computing
• DNA Computing

This page was built for publication: On properties of bond-free DNA languages