Pages that link to "Item:Q1773220"
From MaRDI portal
The following pages link to Theoretical and experimental DNA computation. (Q1773220):
Displayed 11 items.
- Graph-theoretic formalization of hybridization in DNA sticker complexes (Q256713) (← links)
- On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111) (← links)
- Growing self-organizing trees for autonomous hierarchical clustering (Q461112) (← links)
- In some curved spaces, one can solve NP-hard problems in polynomial time (Q843612) (← links)
- Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes (Q3092332) (← links)
- Hairpin Structures in DNA Words (Q3618686) (← links)
- A CONSTANT TIME ALGORITHM FOR DNA ADD (Q3636161) (← links)
- Probabilistic Reasoning with an Enzyme-Driven DNA Device (Q5168507) (← links)
- Anti-heterotic Computing (Q5861783) (← links)
- DNAQL: a query language for DNA sticker complexes (Q6095484) (← links)
- Conjugate word blending: formal model and experimental implementation by XPCR (Q6095510) (← links)