Output details

A 3-approximation algorithm for the subtree distance between phylogenies

<28>Our results have been applied in developing practical bioinformatics algorithms, e.g. [Wu, A practical method for exact computation of subtree prune and regraft distance, Bioinformatics 25 (2009) 190-196] who states "The high level idea behind our approach is similar to that in Bordewich et al. (2008)" and [Whidden et al., Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments, Proc. SEA10, LNCS 6049 (2010) 141-153], and also in complexity-theory, e.g. [Kelk et al., Cycle killer...qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set, SIAM Journal on Discrete Mathematics 26 (2012) 1635–1656].