Bond-free DNA language classes
From MaRDI portal
Recommendations
Cites work
- 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
- 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?)
- Language equations, maximality and error-detection
- On Equivalence and Containment Problems for Formal Languages
- On properties of bond-free DNA languages
- Shuffle on trajectories: Syntactic constraints
- STACS 2004
- Sticky-free and overhang-free DNA languages
- Trajectory-based codes
Cited in
(6)- On properties of bond-free DNA languages
- Sticky-free and overhang-free DNA languages
- Theoretical and implementational aspects of the formal language server (LaSer)
- Characterizing DNA bond shapes using trajectories
- BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
- On codes defined by bio-operations
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)