A polynomial case of the parsimony haplotyping problem (Q2494824)

From MaRDI portal
Revision as of 00:38, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references