Pages that link to "Item:Q268662"
From MaRDI portal
The following pages link to A DNA algorithm for the maximal matching problem (Q268662):
Displaying 9 items.
- A DNA procedure for solving the shortest path problem (Q864742) (← links)
- DNA computing of bipartite graphs for maximum matching (Q1850917) (← links)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
- Terminal pair maximal flow finding using DNA computation (Q2780801) (← links)
- Solving the maximal matching problem with DNA molecules in Adleman-Lipton model (Q2788698) (← links)
- A batch separation experiment-based DNA algorithm of the maximum independent set problem (Q2887515) (← links)
- PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA (Q3444840) (← links)
- (Q4737647) (← links)
- A molecular beacon computing model of maximum matching problem (Q4980914) (← links)