scientific article; zbMATH DE number 7716287

DOI10.4230/LIPICS.WABI.2021.1MaRDI QIDQ6133859zbMATH OpenFDO

Authors Yi-Chieh Wu, Ran Libeskind-Hadas

Publication date 24 July 2023

zbMATH Keywords

phylogeneticshybridizationNP-hardnessdeep coalescencereconciliation

Mathematics Subject Classification ID

Problems related to evolution (92D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Finding a most parsimonious or likely tree in a network with respect to an alignment
• Gene tree reconciliation including transfers with replacement is NP-hard and FPT
• On computing the maximum parsimony score of a phylogenetic network
• Computing the minimum number of hybridization events for a consistent evolutionary history
• On the quirks of maximum parsimony and likelihood on phylogenetic networks

Cited in

(4)

• On the quirks of maximum parsimony and likelihood on phylogenetic networks
• Computing the minimum number of hybridization events for a consistent evolutionary history
• Constructing a consensus phylogeny from a leaf-removal distance (extended abstract)
• Detecting hybrid speciation in the presence of incomplete lineage sorting using gene tree incongruence: a model

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133859)