A polynomial case of the parsimony haplotyping problem (Q2494824): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2005.05.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029494815 / rank | |||
Normal rank | |||
Revision as of 21:42, 19 March 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
