Cherry-picking distance between binary orchards parameterized by level

DOI10.1007/978-3-032-26891-4_14MaRDI QIDQ7391439zbMATH OpenFDO

Authors Manuel Lafond, Kaari Landry, Olivier Tremblay-Savard, Hamza Wahed, Christopher Whidden, Norbert Zeh

Publication date 2026

Full work available at URL https://doi.org/10.1007/978-3-032-26891-4_14

Mathematics Subject Classification ID

Problems related to evolution (92D15)

Cites work

• A class of phylogenetic networks reconstructable from ancestral profiles
• A unifying characterization of tree-based networks and orchard networks using cherry covers
• Comparison of phylogenetic trees
• Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
• Embedding phylogenetic trees in networks of low treewidth
• Hybridization number on three rooted binary trees is EPT
• On cherry-picking and network containment
• Orchard networks are trees with additional horizontal arcs
• Parameterized algorithms for diversity of networks with ecological dependencies
• Scanning phylogenetic networks is NP-hard
• The Structure of Level-k Phylogenetic Networks

This page was built for publication: Cherry-picking distance between binary orchards parameterized by level

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