Finding a most parsimonious or likely tree in a network with respect to an alignment (Q1738036): Difference between revisions
From MaRDI portal
Latest revision as of 23:46, 18 July 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
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
0 references
0 references