Bond-free DNA language classes

DOI10.1007/S11047-006-9022-8MaRDI QIDQ2461298zbMATH OpenOpenAlexFDO

Authors Michael Domaratzki

Publication date 27 November 2007

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-006-9022-8

zbMATH Keywords

theory of codesshuffle on trajectoriesbond free properties

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• On properties of bond-free DNA languages
• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
• DNA Computing
• Coding properties of DNA languages.
• scientific article; zbMATH DE number 2087007

Cites work

• scientific article; zbMATH DE number 5605065 (Why is no real title available?)
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2087505 (Why is no real title available?)
• scientific article; zbMATH DE number 2113970 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• Algebraic properties of the shuffle over \(\omega\)-trajectories
• Aspects of shuffle and deletion on trajectories
• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
• Codes defined by multiple sets of trajectories
• Coding properties of DNA languages.
• Deletion along trajectories
• Language equations, maximality and error-detection
• On Equivalence and Containment Problems for Formal Languages
• On properties of bond-free DNA languages
• STACS 2004
• Shuffle on trajectories: Syntactic constraints
• Sticky-free and overhang-free DNA languages
• Trajectory-based codes

Cited in

(6)

• Theoretical and implementational aspects of the formal language server (LaSer)
• On properties of bond-free DNA languages
• On codes defined by bio-operations
• Characterizing DNA bond shapes using trajectories
• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
• Sticky-free and overhang-free DNA languages

This page was built for publication: Bond-free DNA language classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461298)