The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree (Q2884583)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
scientific article

    Statements

    The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    phylogenetic tree
    0 references
    rooted triplet
    0 references
    minimally resolved supertree
    0 references
    NP-hardness
    0 references
    graph coloring
    0 references
    tree separator
    0 references
    0 references