Complexity and approximation of the minimum recombinant haplotype configuration problem (Q2371806): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:10, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximation of the minimum recombinant haplotype configuration problem |
scientific article |
Statements
Complexity and approximation of the minimum recombinant haplotype configuration problem (English)
0 references
9 July 2007
0 references
haplotyping
0 references
pedigree
0 references
recombinant
0 references
SNP
0 references
complexity
0 references
approximation
0 references
L-reduction
0 references
positive result
0 references
negative result
0 references
bounded number
0 references
children
0 references
mates
0 references
single nucleotide polymorphism
0 references
