A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial time equivalence between DNA sequencing and the exact perfect matching problem |
scientific article; zbMATH DE number 5228528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time equivalence between DNA sequencing and the exact perfect matching problem |
scientific article; zbMATH DE number 5228528 |
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
0.8844376
0 references
0.87513924
0 references
0.86580104
0 references
0.8627318
0 references
0.86256313
0 references
