Pages that link to "Item:Q1850917"
From MaRDI portal
The following pages link to DNA computing of bipartite graphs for maximum matching (Q1850917):
Displaying 8 items.
- A DNA algorithm for the maximal matching problem (Q268662) (← links)
- DNA labelled graphs with DNA computing (Q931505) (← links)
- DNA paired fragment assembly using graph theory (Q1662696) (← links)
- DNA solution of integer linear programming (Q2572046) (← 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)
- (Q3614324) (← links)
- A molecular beacon computing model of maximum matching problem (Q4980914) (← links)