Pages that link to "Item:Q2250259"
From MaRDI portal
The following pages link to Solving traveling salesman problem in the Adleman-Lipton model (Q2250259):
Displayed 4 items.
- A biological algorithm to solve the assignment problem based on DNA molecules computation (Q278315) (← links)
- Solving the maximum weighted clique problem based on parallel biological computing model (Q1665198) (← links)
- A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing (Q2396466) (← links)
- Solving the maximal matching problem with DNA molecules in Adleman–Lipton model (Q2788698) (← links)