A polynomial case of the parsimony haplotyping problem (Q2494824): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:01, 3 February 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
