Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Q929154): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial case of the parsimony haplotyping problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New Formulation and Resolution Method for the p-Center Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank | |||
Normal rank | |||
Latest revision as of 10:53, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving haplotyping inference parsimony problem using a new basic polynomial formulation |
scientific article |
Statements
Solving haplotyping inference parsimony problem using a new basic polynomial formulation (English)
0 references
12 June 2008
0 references
integer linear programming
0 references
0 references
