A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time equivalence between DNA sequencing and the exact perfect matching problem |
scientific article |
Statements
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (English)
0 references
18 January 2008
0 references
graph theory
0 references
computational complexity
0 references
computational biology
0 references
DNA sequencing
0 references
