A polynomial case of the parsimony haplotyping problem (Q2494824): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4393480 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3236253 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank | |||
| 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: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank | |||
Normal rank | |||
Revision as of 16:51, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial case of the parsimony haplotyping problem |
scientific article |
Statements
A polynomial case of the parsimony haplotyping problem (English)
0 references
30 June 2006
0 references
totally unimodular matrices
0 references
approximation algorithms
0 references
fixed parameter tractability
0 references
computational biology
0 references
0 references
