A polynomial case of the parsimony haplotyping problem (Q2494824)
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 5038132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial case of the parsimony haplotyping problem |
scientific article; zbMATH DE number 5038132 |
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
0.8730125427246094
0 references
0.8652290105819702
0 references
0.8096323013305664
0 references
0.8088164329528809
0 references
0.7992584109306335
0 references
