Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms (Q2890436)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms |
scientific article; zbMATH DE number 6044583
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms |
scientific article; zbMATH DE number 6044583 |
Statements
8 June 2012
0 references
pure parsimony haplotyping
0 references
compact integer program
0 references
Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms (English)
0 references
