Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842)

From MaRDI portal
Revision as of 06:07, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
scientific article

    Statements

    Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 2017
    0 references
    phylogenetics
    0 references
    compatibility
    0 references
    unrooted phylogenetic trees
    0 references
    parameterized complexity
    0 references
    FPT algorithm
    0 references
    dynamic programming
    0 references

    Identifiers