Pages that link to "Item:Q1605127"
From MaRDI portal
The following pages link to Efficient DNA sticker algorithms for NP-complete graph problems (Q1605127):
Displaying 5 items.
- On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111) (← links)
- Molecular solution to the optimal linear arrangement problem based on DNA computation (Q937692) (← links)
- Making all spanning tree problem based on sticker model (Q1997053) (← links)
- A CONSTANT TIME ALGORITHM FOR DNA ADD (Q3636161) (← links)
- Solving two-dimensional cutting stock problem via a DNA computing algorithm (Q6095483) (← links)
