Pages that link to "Item:Q2467125"
From MaRDI portal
The following pages link to A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125):
Displaying 4 items.
- Deterministic polynomial-time algorithms for designing short DNA words (Q391100) (← links)
- On generalized balanced optimization problems (Q627450) (← links)
- Complexity of DNA sequencing by hybridization. (Q1401172) (← links)
- Unimodular hypergraph for DNA sequencing: a polynomial time algorithm (Q2212678) (← links)