Finding a most parsimonious or likely tree in a network with respect to an alignment (Q1738036): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964309341 / rank
 
Normal rank

Revision as of 20:47, 19 March 2024

scientific article
Language Label Description Also known as
English
Finding a most parsimonious or likely tree in a network with respect to an alignment
scientific article

    Statements

    Finding a most parsimonious or likely tree in a network with respect to an alignment (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 March 2019
    0 references
    phylogenetic tree
    0 references
    phylogenetic network
    0 references
    maximum parsimony
    0 references
    maximum likelihood
    0 references
    NP-hardness
    0 references
    APX-hardness
    0 references

    Identifiers