Polynomial and APX-hard cases of the individual haplotyping problem (Q1781994)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2174873
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial and APX-hard cases of the individual haplotyping problem |
scientific article; zbMATH DE number 2174873 |
Statements
Polynomial and APX-hard cases of the individual haplotyping problem (English)
0 references
10 June 2005
0 references
Haplotyping
0 references
Fixed-parameter tractability
0 references
APX-hardness
0 references
0.9044389724731444
0 references
0.8993621468544006
0 references
0.8549407720565796
0 references
0.8495279550552368
0 references
