The following pages link to (Q4224876):
Displaying 14 items.
- Graph-theoretic formalization of hybridization in DNA sticker complexes (Q256713) (← links)
- A DNA sticker algorithm for bit-substitution in a block cipher (Q436877) (← links)
- Molecular solution to the optimal linear arrangement problem based on DNA computation (Q937692) (← links)
- Parallel DNA arithmetic operation based on \(n\)-moduli set (Q1026280) (← links)
- DNA computing: Arrival of biological mathematics (Q1361168) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- Efficient DNA sticker algorithms for NP-complete graph problems (Q1605127) (← links)
- Topics in the theory of DNA computing. (Q1853473) (← links)
- Strand design for biomolecular computation. (Q1853477) (← links)
- Spatial cluster analysis by the bin-packing problem and DNA computing technique (Q1956125) (← links)
- A DNA-based graph encoding scheme with its applications to graph isomorphism problems (Q2378959) (← links)
- A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers (Q2479238) (← links)
- Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes (Q3092332) (← links)
- DNA2DNA computations: A potential “killer app”? (Q4571939) (← links)
