Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set
From MaRDI portal
Publication:4915192
DOI10.1137/120864350zbMath1263.68174arXiv1112.5359OpenAlexW2132655694MaRDI QIDQ4915192
Nela Lekić, Steven Kelk, Simone Linz, Celine Scornavacca, Leo van Iersel, Leen Stougie
Publication date: 9 April 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.5359
Taxonomy, cladistics, statistics in mathematical biology (92B10) Combinatorial optimization (90C27) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)
Related Items (11)
Kernelizations for the hybridization number problem on multiple nonbinary trees ⋮ Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies ⋮ Reconstruction of LGT networks from tri-LGT-nets ⋮ Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance ⋮ A quadratic kernel for computing the hybridization number of multiple trees ⋮ 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 unrooted and root-uncertain variants of several well-known phylogenetic network problems ⋮ Hybridization Number on Three Rooted Binary Trees is EPT ⋮ Better Practical Algorithms for rSPR Distance and Hybridization Number ⋮ A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees
This page was built for publication: Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set
