Coding properties of DNA languages.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 50943 (Why is no real title available?)
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 1241377 (Why is no real title available?)
- scientific article; zbMATH DE number 522835 (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 1568800 (Why is no real title available?)
- DNA computing: Arrival of biological mathematics
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
Cited in
(30)- DNA Computing
- Decidability of involution hypercodes
- Theoretical and implementational aspects of the formal language server (LaSer)
- DNA Codes and Their Properties
- Watson-Crick palindromes in DNA computing
- Duplications and pseudo-duplications
- Some properties of related involution palindrome words
- Aspects of Molecular Computing
- Pseudo-inversion: closure properties and decidability
- Solutions to the involution language equation
- Language-theoretic aspects of DNA complementarity
- On properties of bond-free DNA languages
- Emergent computation. Emphasizing bioinformatics.
- Testing DNA code words properties of regular languages
- Some properties of involution palindrome languages
- Some properties of involution codes
- Formal descriptions of code properties: decidability, complexity, implementation
- BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
- DNA Computing
- Sticky-free and overhang-free DNA languages
- Some properties of involution binary relations
- DNA Computing
- A note of solutions to the morphic involution language equations
- Watson-Crick Partial Words
- Aspects of Molecular Computing
- Bond-free DNA language classes
- scientific article; zbMATH DE number 2087007 (Why is no real title available?)
- Language Forbidding-Enforcing Systems Defining DNA Codewords
- Generating DNA code words using forbidding and enforcing systems
- DNA Computing
This page was built for publication: Coding properties of DNA languages.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401178)
