Complexity and approximation of the minimum recombinant haplotype configuration problem (Q2371806): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the power of unique 2-prover 1-round games / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4258216 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization, approximation, and complexity classes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of satisfiability problems / rank | |||
Normal rank | |||
Revision as of 10:57, 26 June 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
