The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability (Q2628808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6603887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability |
scientific article; zbMATH DE number 6603887 |
Statements
The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability (English)
0 references
15 July 2016
0 references
haplotype inference
0 references
pure parsimony
0 references
branch-and-bound
0 references
integer programming
0 references
Boolean satisfiability
0 references
0 references
0 references
0 references
0 references
0.9568800926208496
0 references
0.8730228543281555
0 references
0.8523664474487305
0 references
0.8418124318122864
0 references
0.8404539227485657
0 references
