Complexity and approximation of the minimum recombinant haplotype configuration problem (Q2371806): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2007.02.036 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2007.02.036 / rank | |||
Normal rank | |||
Latest revision as of 06:20, 18 December 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
0 references
