DNA computing: Arrival of biological mathematics
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1241360 (Why is no real title available?)
- scientific article; zbMATH DE number 1024500 (Why is no real title available?)
- scientific article; zbMATH DE number 1047931 (Why is no real title available?)
- scientific article; zbMATH DE number 1537933 (Why is no real title available?)
- scientific article; zbMATH DE number 743584 (Why is no real title available?)
- scientific article; zbMATH DE number 908772 (Why is no real title available?)
- scientific article; zbMATH DE number 3400850 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Contextual insertions/deletions and computability
- DNA computing based on splicing: The existence of universal computers
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Getting started in mathematical biology.
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On the computational power of DNA
- On the power of the splicing operation1
- On the splicing operation
Cited in
(22)- Approximate reasoning on a DNA‐chip
- Parsimonious computational completeness
- Insertion-deletion systems with substitutions. I
- Using DNA to solve the bounded Post correspondence problem
- Insertion-deletion systems with substitutions. I
- Small universal devices
- Coding properties of DNA languages.
- Adding matrix control: insertion-deletion systems with substitutions. III
- Insertion-deletion with substitutions. II: About the role of one-sided context
- Splicing representations of stricly locally testable languages
- On the generative capacity of matrix insertion-deletion systems of small sum-norm
- Reasoning continuously: a formal construction of continuous proofs
- DNA algorithms for fractal construction—an application of theSInsDelPsystem
- Efficient DNA sticker algorithms for NP-complete graph problems
- Splicing in abstract families of languages
- Possibilities of constructing two dimensional pictures in DNA computing: Part I
- Transposition based contextual insertion on linear DNA strands with deletion precedence
- Possibilities of constructing two dimensional pictures in DNA computing: Part II
- Universality in Molecular and Cellular Computing
- Bioinformatics: organisms from Venus, technology from Jupiter, algorithms from Mars
- Some properties of involution binary relations
- Unconventional construction of DNA codes: group homomorphism
This page was built for publication: DNA computing: Arrival of biological mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361168)
