Pages that link to "Item:Q1361168"
From MaRDI portal
The following pages link to DNA computing: Arrival of biological mathematics (Q1361168):
Displayed 22 items.
- Some properties of involution binary relations (Q493117) (← links)
- Adding matrix control: insertion-deletion systems with substitutions. III (Q831848) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- Splicing representations of stricly locally testable languages (Q1270777) (← links)
- Coding properties of DNA languages. (Q1401178) (← links)
- Splicing in abstract families of languages (Q1575672) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- Efficient DNA sticker algorithms for NP-complete graph problems (Q1605127) (← links)
- Reasoning continuously: a formal construction of continuous proofs (Q2027208) (← links)
- Insertion-deletion systems with substitutions. I (Q2106623) (← links)
- Bioinformatics: organisms from Venus, technology from Jupiter, algorithms from Mars (Q2512284) (← links)
- Unconventional construction of DNA codes: Group Homomorphism (Q2831828) (← links)
- Small Universal Devices (Q2944894) (← links)
- Approximate reasoning on a DNA‐chip (Q3059787) (← links)
- Transposition based contextual insertion on linear DNA strands with deletion precedence (Q3154797) (← links)
- Universality in Molecular and Cellular Computing (Q3195684) (← links)
- Possibilities of constructing two dimensional pictures in DNA computing: Part II (Q3375519) (← links)
- Insertion-deletion systems with substitutions I (Q5037217) (← links)
- DNA algorithms for fractal construction—an application of the<i>SInsDelP</i>system (Q5297936) (← links)
- Possibilities of constructing two dimensional pictures in DNA computing: Part I (Q5712011) (← links)
- (Q6070610) (← links)
- On the generative capacity of matrix insertion-deletion systems of small sum-norm (Q6095512) (← links)