Pages that link to "Item:Q1853477"
From MaRDI portal
The following pages link to Strand design for biomolecular computation. (Q1853477):
Displayed 11 items.
- Deterministic polynomial-time algorithms for designing short DNA words (Q391100) (← links)
- Dipole codes attractively encode glue functions (Q529021) (← links)
- On codeword design in metric DNA spaces (Q734201) (← links)
- Solving the minimum bisection problem using a biologically inspired computational model (Q847667) (← links)
- Molecular solution to the optimal linear arrangement problem based on DNA computation (Q937692) (← links)
- Solving the maximum weighted clique problem based on parallel biological computing model (Q1665198) (← links)
- Linear constructions for DNA codes (Q1779298) (← links)
- A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing (Q2396466) (← links)
- A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem (Q2576612) (← links)
- Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences (Q3618688) (← links)
- Design methods for 3D wireframe DNA nanostructures (Q6084211) (← links)