New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees

DOI10.1007/s00453-022-00946-8zbMath1494.92075arXiv2007.13615OpenAlexW4229054548MaRDI QIDQ2149104

Yanyan Li

Publication date: 28 June 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.13615

zbMATH Keywords

parameterized algorithmsphylogenetic treesphylogenetic networkshybridization number

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Orchard networks are trees with additional horizontal arcs

Uses Software

• GitHub

Cites Work

• Kernelizations for the hybridization number problem on multiple nonbinary trees
• Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies
• A cluster reduction for computing the subtree distance between phylogenies
• Computing the minimum number of hybridization events for a consistent evolutionary history
• Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies
• Deciding the existence of a cherry-picking sequence is hard on two trees
• On the complexity of computing the temporal hybridization number for two phylogenies
• A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees

This page was built for publication: New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees